About the Execution of ITS-Tools for FamilyReunion-COL-L00400M0040C020P020G001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 2328522.00 | 0.00 | 0.00 | ??F??T??F??????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850300338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850300338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.8K Feb 27 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 27 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 22:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 22:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 27 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 27 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679468600119
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00400M0040C020P020G001
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202303021504
[2023-03-22 07:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 07:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:03:21] [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.
[2023-03-22 07:03:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 07:03:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 712 ms
[2023-03-22 07:03:22] [INFO ] Detected 5 constant HL places corresponding to 106 PT places.
[2023-03-22 07:03:22] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 538109 PT places and 508890.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2023-03-22 07:03:22] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2023-03-22 07:03:22] [INFO ] Skeletonized 16 HLPN properties in 3 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 11 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
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 10052 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=159 ) properties (out of 54) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 44) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 40) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-22 07:03:23] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-22 07:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 07:03:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-22 07:03:23] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:31
[2023-03-22 07:03:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 07:03:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-22 07:03:24] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :31
[2023-03-22 07:03:24] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :31
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-22 07:03:24] [INFO ] After 896ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :31
Fused 32 Parikh solutions to 30 different solutions.
Finished Parikh walk after 221 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=55 )
Parikh walk visited 31 properties in 425 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-22 07:03:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 07:03:25] [INFO ] Flatten gal took : 41 ms
[2023-03-22 07:03:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 07:03:25] [INFO ] Flatten gal took : 9 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 21
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 11
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
[2023-03-22 07:03:26] [INFO ] Unfolded HLPN to a Petri net with 477829 places and 412249 transitions 1184997 arcs in 1626 ms.
[2023-03-22 07:03:26] [INFO ] Unfolded 13 HLPN properties in 140 ms.
[2023-03-22 07:03:27] [INFO ] Reduced 8020 identical enabling conditions.
[2023-03-22 07:03:27] [INFO ] Reduced 401 identical enabling conditions.
[2023-03-22 07:03:27] [INFO ] Reduced 401 identical enabling conditions.
[2023-03-22 07:03:27] [INFO ] Reduced 16040 identical enabling conditions.
Deduced a syphon composed of 401 places in 1382 ms
Reduce places removed 467 places and 0 transitions.
Support contains 390660 out of 477362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477362/477362 places, 412249/412249 transitions.
Reduce places removed 1289 places and 0 transitions.
Discarding 16441 places :
Implicit places reduction removed 16441 places
Iterating post reduction 0 with 17730 rules applied. Total rules applied 17730 place count 459632 transition count 412249
Applied a total of 17730 rules in 57589 ms. Remains 459632 /477362 variables (removed 17730) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-22 07:06:45] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:07:26] [INFO ] Implicit Places using invariants in 160473 ms returned []
Implicit Place search using SMT only with invariants took 160476 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-22 07:09:26] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:09:59] [INFO ] Dead Transitions using invariants and state equation in 152890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459632/477362 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370984 ms. Remains : 459632/477362 places, 412249/412249 transitions.
Support contains 390660 out of 459632 places after structural reductions.
[2023-03-22 07:10:21] [INFO ] Flatten gal took : 15856 ms
[2023-03-22 07:11:05] [INFO ] Flatten gal took : 16531 ms
[2023-03-22 07:11:59] [INFO ] Input system was already deterministic with 412249 transitions.
Interrupted random walk after 1178 steps, including 0 resets, run timeout after 30030 ms. (steps per millisecond=0 ) properties seen 8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1457 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1325 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1723 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1852 ms. (steps per millisecond=0 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1366 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1158 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1205 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=1 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4663 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-22 07:15:02] [WARNING] Invariant computation timed out after 120 seconds.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:15:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:15:28] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 307653 out of 459632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
Discarding 16441 places :
Implicit places reduction removed 16441 places
Drop transitions removed 16441 transitions
Trivial Post-agglo rules discarded 16441 transitions
Performed 16441 trivial Post agglomeration. Transition count delta: 16441
Iterating post reduction 0 with 32882 rules applied. Total rules applied 32882 place count 443191 transition count 395808
Reduce places removed 16441 places and 0 transitions.
Performed 1669 Post agglomeration using F-continuation condition.
Performed 3072 Post agglomeration using F-continuation condition.
Performed 4451 Post agglomeration using F-continuation condition.
Performed 5944 Post agglomeration using F-continuation condition.
Performed 7417 Post agglomeration using F-continuation condition.
Performed 8898 Post agglomeration using F-continuation condition.
Performed 10385 Post agglomeration using F-continuation condition.
Performed 11871 Post agglomeration using F-continuation condition.
Performed 13389 Post agglomeration using F-continuation condition.
Performed 14851 Post agglomeration using F-continuation condition.
Performed 16313 Post agglomeration using F-continuation condition.
Performed 16441 Post agglomeration using F-continuation condition.Transition count delta: 16441
Iterating post reduction 1 with 32882 rules applied. Total rules applied 65764 place count 426750 transition count 379367
Reduce places removed 16441 places and 0 transitions.
Iterating post reduction 2 with 16441 rules applied. Total rules applied 82205 place count 410309 transition count 379367
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 82205 place count 410309 transition count 378966
Deduced a syphon composed of 401 places in 916 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 83007 place count 409908 transition count 378966
Performed 400 Post agglomeration using F-continuation condition.
Performed 401 Post agglomeration using F-continuation condition.Transition count delta: 401
Deduced a syphon composed of 401 places in 861 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 83809 place count 409507 transition count 378565
Free-agglomeration rule (complex) applied 16441 times.
Iterating global reduction 3 with 16441 rules applied. Total rules applied 100250 place count 409507 transition count 362124
Reduce places removed 16441 places and 0 transitions.
Iterating post reduction 3 with 16441 rules applied. Total rules applied 116691 place count 393066 transition count 362124
Applied a total of 116691 rules in 913239 ms. Remains 393066 /459632 variables (removed 66566) and now considering 362124/412249 (removed 50125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 913249 ms. Remains : 393066/459632 places, 362124/412249 transitions.
[2023-03-22 07:31:09] [INFO ] Flatten gal took : 18099 ms
[2023-03-22 07:31:52] [INFO ] Flatten gal took : 16551 ms
[2023-03-22 07:32:45] [INFO ] Input system was already deterministic with 412249 transitions.
Computed a total of 459632 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 459632 transition count 412249
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 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
Discarding 66967 places :
Implicit places reduction removed 66967 places
Iterating post reduction 0 with 66967 rules applied. Total rules applied 66967 place count 392665 transition count 412249
Applied a total of 66967 rules in 56553 ms. Remains 392665 /459632 variables (removed 66967) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 392665 cols
[2023-03-22 07:35:50] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:36:30] [INFO ] Implicit Places using invariants in 159966 ms returned []
Implicit Place search using SMT only with invariants took 159968 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 392665 cols
[2023-03-22 07:38:30] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:39:09] [INFO ] Computed 95844 place invariants in 2063226 ms
[2023-03-22 07:39:18] [INFO ] Dead Transitions using invariants and state equation in 167974 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392665/459632 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384532 ms. Remains : 392665/459632 places, 412249/412249 transitions.
[2023-03-22 07:39:38] [INFO ] Flatten gal took : 13119 ms
[2023-03-22 07:39:52] [INFO ] Flatten gal took : 14555 ms
[2023-03-22 07:40:19] [INFO ] Input system was already deterministic with 412249 transitions.
[2023-03-22 07:40:37] [INFO ] Flatten gal took : 15242 ms
[2023-03-22 07:40:56] [INFO ] Flatten gal took : 18724 ms
[2023-03-22 07:40:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10132549518420799772.gal : 2176 ms
[2023-03-22 07:40:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15597972112825125942.ctl : 337 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10132549518420799772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15597972112825125942.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
BK_STOP 1679470928641
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00400M0040C020P020G001"
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-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00400M0040C020P020G001, 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 r165-tall-167838850300338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00400M0040C020P020G001.tgz
mv FamilyReunion-COL-L00400M0040C020P020G001 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 '
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 ;