Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127500234.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 NoC3x3-PT-1B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127500234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 362K May 5 16:51 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 NoC3x3-PT-1B-CTLFireability-00
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-01
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-02
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-03
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-04
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-05
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-06
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-07
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-08
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-09
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-10
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-11
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-12
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-13
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-14
FORMULA_NAME NoC3x3-PT-1B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620949592210

Running Version 0
[2021-05-13 23:46:33] [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]
[2021-05-13 23:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:46:33] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2021-05-13 23:46:33] [INFO ] Transformed 1416 places.
[2021-05-13 23:46:33] [INFO ] Transformed 1640 transitions.
[2021-05-13 23:46:33] [INFO ] Found NUPN structural information;
[2021-05-13 23:46:33] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2021-05-13 23:46:33] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 23:46:33] [INFO ] Reduced 1 identical enabling conditions.
Support contains 612 out of 1416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 1257 transition count 1481
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 1257 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 360 place count 1215 transition count 1439
Iterating global reduction 0 with 42 rules applied. Total rules applied 402 place count 1215 transition count 1439
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 417 place count 1215 transition count 1424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 422 place count 1210 transition count 1419
Iterating global reduction 1 with 5 rules applied. Total rules applied 427 place count 1210 transition count 1419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 431 place count 1210 transition count 1415
Applied a total of 431 rules in 222 ms. Remains 1210 /1416 variables (removed 206) and now considering 1415/1640 (removed 225) transitions.
// Phase 1: matrix 1415 rows 1210 cols
[2021-05-13 23:46:34] [INFO ] Computed 40 place invariants in 24 ms
[2021-05-13 23:46:34] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 1415 rows 1210 cols
[2021-05-13 23:46:34] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-13 23:46:35] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
// Phase 1: matrix 1415 rows 1210 cols
[2021-05-13 23:46:35] [INFO ] Computed 40 place invariants in 5 ms
[2021-05-13 23:46:35] [INFO ] Dead Transitions using invariants and state equation in 653 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1210/1416 places, 1415/1640 transitions.
[2021-05-13 23:46:36] [INFO ] Flatten gal took : 109 ms
[2021-05-13 23:46:36] [INFO ] Flatten gal took : 67 ms
[2021-05-13 23:46:36] [INFO ] Input system was already deterministic with 1415 transitions.
Incomplete random walk after 100000 steps, including 83 resets, run finished after 450 ms. (steps per millisecond=222 ) properties (out of 106) seen :104
Running SMT prover for 2 properties.
// Phase 1: matrix 1415 rows 1210 cols
[2021-05-13 23:46:37] [INFO ] Computed 40 place invariants in 8 ms
[2021-05-13 23:46:37] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2021-05-13 23:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:46:37] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-13 23:46:37] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 4 ms to minimize.
[2021-05-13 23:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2021-05-13 23:46:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:46:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2021-05-13 23:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:46:38] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-13 23:46:38] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2021-05-13 23:46:38] [INFO ] Computed and/alt/rep : 1414/2134/1414 causal constraints (skipped 0 transitions) in 67 ms.
[2021-05-13 23:46:57] [INFO ] Added : 1250 causal constraints over 250 iterations in 19269 ms. Result :unknown
[2021-05-13 23:46:58] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2021-05-13 23:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:46:58] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-13 23:46:58] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 1 ms to minimize.
[2021-05-13 23:46:58] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2021-05-13 23:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2021-05-13 23:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:46:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2021-05-13 23:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:46:59] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2021-05-13 23:46:59] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2021-05-13 23:46:59] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2021-05-13 23:46:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2021-05-13 23:46:59] [INFO ] Computed and/alt/rep : 1414/2134/1414 causal constraints (skipped 0 transitions) in 82 ms.
[2021-05-13 23:47:19] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 1 ms to minimize.
[2021-05-13 23:47:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Graph (trivial) has 1116 edges and 1210 vertex of which 604 / 1210 are part of one of the 18 SCC in 8 ms
Free SCC test removed 586 places
Ensure Unique test removed 686 transitions
Reduce isomorphic transitions removed 686 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 623 transition count 635
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 102 rules applied. Total rules applied 196 place count 530 transition count 626
Reduce places removed 3 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 32 rules applied. Total rules applied 228 place count 527 transition count 597
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 263 place count 498 transition count 591
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 263 place count 498 transition count 580
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 285 place count 487 transition count 580
Discarding 82 places :
Symmetric choice reduction at 4 with 82 rule applications. Total rules 367 place count 405 transition count 497
Iterating global reduction 4 with 82 rules applied. Total rules applied 449 place count 405 transition count 497
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 449 place count 405 transition count 485
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 473 place count 393 transition count 485
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 492 place count 374 transition count 457
Iterating global reduction 4 with 19 rules applied. Total rules applied 511 place count 374 transition count 457
Performed 92 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 695 place count 282 transition count 362
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 700 place count 282 transition count 357
Performed 7 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 714 place count 275 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 717 place count 275 transition count 390
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 718 place count 275 transition count 390
Applied a total of 718 rules in 181 ms. Remains 275 /1210 variables (removed 935) and now considering 390/1415 (removed 1025) transitions.
[2021-05-13 23:47:19] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:47:19] [INFO ] Flatten gal took : 17 ms
[2021-05-13 23:47:19] [INFO ] Input system was already deterministic with 390 transitions.
[2021-05-13 23:47:19] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:47:19] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16413552859305941446.gal : 9 ms
[2021-05-13 23:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13366385515665485158.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16413552859305941446.gal, -t, CGAL, -ctl, /tmp/CTLFireability13366385515665485158.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16413552859305941446.gal -t CGAL -ctl /tmp/CTLFireability13366385515665485158.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11968e+29,0.363858,16724,2,5250,5,59912,6,0,1464,51992,0


Converting to forward existential form...Done !
original formula: EF(((AF(((((((p782==0)&&((p1035==0)||(p1192==0)))&&(p1394==0))&&(p515==0))&&(p899==0))&&((p1350==1)||(p170==1)))) * EG((((((((((((p423==1)||(p1312==1))||(p1238==1))||(p369==1))||(p1303==1))||(p605==1))||(p1239==1))||(p1111==1))||(p612==1))||(p47==1))&&(((((((p1155==1)||(p73==1))||(p24==1))||(p364==1))||(p964==1))||(p708==1))||(p188==1))))) * (EF((((p1137==1)||(p1337==1))&&(((((p180==1)||(p996==1))||(p1146==1))||(p711==1))||(p1402==1)))) + AF(((((((((((p64==0)&&(p892==0))&&(p846==0))&&((p254==0)||(p307==0)))&&(p1173==0))&&(p1394==0))&&(p611==0))&&(p142==0))&&(p1101==0))&&(p1278==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (!(EG(!(((((((p782==0)&&((p1035==0)||(p1192==0)))&&(p1394==0))&&(p515==0))&&(p899==0))&&((p1350==1)||(p170==1)))))) * EG((((((((((((p423==1)||(p1312==1))||(p1238==1))||(p369==1))||(p1303==1))||(p605==1))||(p1239==1))||(p1111==1))||(p612==1))||(p47==1))&&(((((((p1155==1)||(p73==1))||(p24==1))||(p364==1))||(p964==1))||(p708==1))||(p188==1)))))),TRUE) * (((p1137==1)||(p1337==1))&&(((((p180==1)||(p996==1))||(p1146==1))||(p711==1))||(p1402==1))))] != FALSE + [((FwdU(Init,TRUE) * (!(EG(!(((((((p782==0)&&((p1035==0)||(p1192==0)))&&(p1394==0))&&(p515==0))&&(p899==0))&&((p1350==1)||(p170==1)))))) * EG((((((((((((p423==1)||(p1312==1))||(p1238==1))||(p369==1))||(p1303==1))||(p605==1))||(p1239==1))||(p1111==1))||(p612==1))||(p47==1))&&(((((((p1155==1)||(p73==1))||(p24==1))||(p364==1))||(p964==1))||(p708==1))||(p188==1)))))) * !(EG(!(((((((((((p64==0)&&(p892==0))&&(p846==0))&&((p254==0)||(p307==0)))&&(p1173==0))&&(p1394==0))&&(p611==0))&&(p142==0))&&(p1101==0))&&(p1278==0))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t82, t114, t242, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/385/5/390
Detected timeout of ITS tools.
[2021-05-13 23:47:49] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:47:49] [INFO ] Applying decomposition
[2021-05-13 23:47:49] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14603523917277087565.txt, -o, /tmp/graph14603523917277087565.bin, -w, /tmp/graph14603523917277087565.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14603523917277087565.bin, -l, -1, -v, -w, /tmp/graph14603523917277087565.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:47:49] [INFO ] Decomposing Gal with order
[2021-05-13 23:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:47:49] [INFO ] Removed a total of 56 redundant transitions.
[2021-05-13 23:47:49] [INFO ] Flatten gal took : 51 ms
[2021-05-13 23:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2021-05-13 23:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10731797024351348505.gal : 7 ms
[2021-05-13 23:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9098677849110578779.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10731797024351348505.gal, -t, CGAL, -ctl, /tmp/CTLFireability9098677849110578779.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10731797024351348505.gal -t CGAL -ctl /tmp/CTLFireability9098677849110578779.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11968e+29,0.157899,9464,249,389,4897,8695,773,6794,306,16913,0


Converting to forward existential form...Done !
original formula: EF(((AF(((((((i7.u23.p782==0)&&((i9.i1.u31.p1035==0)||(i8.u39.p1192==0)))&&(i10.u46.p1394==0))&&(i3.u15.p515==0))&&(i6.u26.p899==0))&&((i11.u45.p1350==1)||(i1.u7.p170==1)))) * EG((((((((((((i2.u14.p423==1)||(i11.u44.p1312==1))||(i11.u40.p1238==1))||(i2.u13.p369==1))||(i11.u45.p1303==1))||(i4.u18.p605==1))||(i10.u42.p1239==1))||(i9.i1.u34.p1111==1))||(i4.u18.p612==1))||(i1.u2.p47==1))&&(((((((i9.i1.u37.p1155==1)||(i0.u4.p73==1))||(i3.u1.p24==1))||(i2.u13.p364==1))||(i7.u28.p964==1))||(i4.u20.p708==1))||(i1.u9.p188==1))))) * (EF((((i9.i1.u36.p1137==1)||(i11.u44.p1337==1))&&(((((i1.u8.p180==1)||(i7.u29.p996==1))||(i9.i1.u35.p1146==1))||(i4.u20.p711==1))||(i10.u46.p1402==1)))) + AF(((((((((((i0.u3.p64==0)&&(i6.u27.p892==0))&&(i5.u24.p846==0))&&((i2.u12.p254==0)||(i2.u12.p307==0)))&&(i8.u38.p1173==0))&&(i10.u46.p1394==0))&&(i4.u18.p611==0))&&(i1.u9.p142==0))&&(i9.i1.u33.p1101==0))&&(i10.u41.p1278==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (!(EG(!(((((((i7.u23.p782==0)&&((i9.i1.u31.p1035==0)||(i8.u39.p1192==0)))&&(i10.u46.p1394==0))&&(i3.u15.p515==0))&&(i6.u26.p899==0))&&((i11.u45.p1350==1)||(i1.u7.p170==1)))))) * EG((((((((((((i2.u14.p423==1)||(i11.u44.p1312==1))||(i11.u40.p1238==1))||(i2.u13.p369==1))||(i11.u45.p1303==1))||(i4.u18.p605==1))||(i10.u42.p1239==1))||(i9.i1.u34.p1111==1))||(i4.u18.p612==1))||(i1.u2.p47==1))&&(((((((i9.i1.u37.p1155==1)||(i0.u4.p73==1))||(i3.u1.p24==1))||(i2.u13.p364==1))||(i7.u28.p964==1))||(i4.u20.p708==1))||(i1.u9.p188==1)))))),TRUE) * (((i9.i1.u36.p1137==1)||(i11.u44.p1337==1))&&(((((i1.u8.p180==1)||(i7.u29.p996==1))||(i9.i1.u35.p1146==1))||(i4.u20.p711==1))||(i10.u46.p1402==1))))] != FALSE + [((FwdU(Init,TRUE) * (!(EG(!(((((((i7.u23.p782==0)&&((i9.i1.u31.p1035==0)||(i8.u39.p1192==0)))&&(i10.u46.p1394==0))&&(i3.u15.p515==0))&&(i6.u26.p899==0))&&((i11.u45.p1350==1)||(i1.u7.p170==1)))))) * EG((((((((((((i2.u14.p423==1)||(i11.u44.p1312==1))||(i11.u40.p1238==1))||(i2.u13.p369==1))||(i11.u45.p1303==1))||(i4.u18.p605==1))||(i10.u42.p1239==1))||(i9.i1.u34.p1111==1))||(i4.u18.p612==1))||(i1.u2.p47==1))&&(((((((i9.i1.u37.p1155==1)||(i0.u4.p73==1))||(i3.u1.p24==1))||(i2.u13.p364==1))||(i7.u28.p964==1))||(i4.u20.p708==1))||(i1.u9.p188==1)))))) * !(EG(!(((((((((((i0.u3.p64==0)&&(i6.u27.p892==0))&&(i5.u24.p846==0))&&((i2.u12.p254==0)||(i2.u12.p307==0)))&&(i8.u38.p1173==0))&&(i10.u46.p1394==0))&&(i4.u18.p611==0))&&(i1.u9.p142==0))&&(i9.i1.u33.p1101==0))&&(i10.u41.p1278==0))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t242, i2.u13.t114, i4.u20.t82, i6.u27.t54, i10.u42.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/364/5/369
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Graph (trivial) has 1181 edges and 1210 vertex of which 739 / 1210 are part of one of the 20 SCC in 2 ms
Free SCC test removed 719 places
Ensure Unique test removed 846 transitions
Reduce isomorphic transitions removed 846 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 490 transition count 526
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 56 rules applied. Total rules applied 99 place count 448 transition count 512
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 111 place count 438 transition count 510
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 111 place count 438 transition count 507
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 435 transition count 507
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 198 place count 354 transition count 425
Iterating global reduction 3 with 81 rules applied. Total rules applied 279 place count 354 transition count 425
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 279 place count 354 transition count 411
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 307 place count 340 transition count 411
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 326 place count 321 transition count 382
Iterating global reduction 3 with 19 rules applied. Total rules applied 345 place count 321 transition count 382
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 501 place count 243 transition count 304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 506 place count 243 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 512 place count 240 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 513 place count 240 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 239 transition count 304
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 133 edges and 238 vertex of which 2 / 238 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 516 place count 237 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 518 place count 237 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 520 place count 236 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 523 place count 236 transition count 298
Applied a total of 523 rules in 98 ms. Remains 236 /1210 variables (removed 974) and now considering 298/1415 (removed 1117) transitions.
[2021-05-13 23:48:20] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:48:20] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:48:20] [INFO ] Input system was already deterministic with 298 transitions.
[2021-05-13 23:48:20] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:48:20] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:48:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6900668943297597844.gal : 2 ms
[2021-05-13 23:48:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5164630575893460615.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6900668943297597844.gal, -t, CGAL, -ctl, /tmp/CTLFireability5164630575893460615.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6900668943297597844.gal -t CGAL -ctl /tmp/CTLFireability5164630575893460615.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31614e+27,0.263114,13368,2,4595,5,46301,6,0,1216,36002,0


Converting to forward existential form...Done !
original formula: EF((EF(EG(!(E((((p1141==1)||(p322==1))||(p10==1)) U (((((((p22==1)||(p674==1))||(p1343==1))||(p1246==1))||(p599==1))||(p1009==1))||(p772==1)))))) * (((((((((p1123==1)||(p342==1))||(p310==1))||(p165==1))||(p40==1))||(p1135==1))||(p1387==1))||(p94==1))||((p128==1)&&(p495==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * (((((((((p1123==1)||(p342==1))||(p310==1))||(p165==1))||(p40==1))||(p1135==1))||(p1387==1))||(p94==1))||((p128==1)&&(p495==1)))),TRUE),!(E((((p1141==1)||(p322==1))||(p10==1)) U (((((((p22==1)||(p674==1))||(p1343==1))||(p1246==1))||(p599==1))||(p1009==1))||(p772==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t41, t43, t79, t110, t276, t277, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/291/7/298
Detected timeout of ITS tools.
[2021-05-13 23:48:50] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:48:50] [INFO ] Applying decomposition
[2021-05-13 23:48:50] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12918857080580943318.txt, -o, /tmp/graph12918857080580943318.bin, -w, /tmp/graph12918857080580943318.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12918857080580943318.bin, -l, -1, -v, -w, /tmp/graph12918857080580943318.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:48:50] [INFO ] Decomposing Gal with order
[2021-05-13 23:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:48:50] [INFO ] Removed a total of 38 redundant transitions.
[2021-05-13 23:48:50] [INFO ] Flatten gal took : 18 ms
[2021-05-13 23:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2021-05-13 23:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11141891782450460709.gal : 3 ms
[2021-05-13 23:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4034298893943912820.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11141891782450460709.gal, -t, CGAL, -ctl, /tmp/CTLFireability4034298893943912820.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11141891782450460709.gal -t CGAL -ctl /tmp/CTLFireability4034298893943912820.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31614e+27,0.088125,7376,243,344,2895,5298,694,3686,226,9900,0


Converting to forward existential form...Done !
original formula: EF((EF(EG(!(E((((i7.u27.p1141==1)||(i1.u10.p322==1))||(i7.u0.p10==1)) U (((((((i2.i1.u1.p22==1)||(i2.i1.u16.p674==1))||(i9.i0.u34.p1343==1))||(i8.u31.p1246==1))||(i2.i0.u15.p599==1))||(i6.u25.p1009==1))||(i4.u20.p772==1)))))) * (((((((((i7.u28.p1123==1)||(i1.u11.p342==1))||(i1.u10.p310==1))||(i0.i1.u6.p165==1))||(i0.i0.u2.p40==1))||(i7.u28.p1135==1))||(i9.i1.u35.p1387==1))||(i0.i0.u4.p94==1))||((i0.i0.u5.p128==1)&&(i3.u17.p495==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * (((((((((i7.u28.p1123==1)||(i1.u11.p342==1))||(i1.u10.p310==1))||(i0.i1.u6.p165==1))||(i0.i0.u2.p40==1))||(i7.u28.p1135==1))||(i9.i1.u35.p1387==1))||(i0.i0.u4.p94==1))||((i0.i0.u5.p128==1)&&(i3.u17.p495==1)))),TRUE),!(E((((i7.u27.p1141==1)||(i1.u10.p322==1))||(i7.u0.p10==1)) U (((((((i2.i1.u1.p22==1)||(i2.i1.u16.p674==1))||(i9.i0.u34.p1343==1))||(i8.u31.p1246==1))||(i2.i0.u15.p599==1))||(i6.u25.p1009==1))||(i4.u20.p772==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t277, i1.u10.t110, i2.i1.u16.t79, i6.t43, i7.u0.t41, i7.u28.t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/284/6/290
Detected timeout of ITS tools.
Graph (trivial) has 1191 edges and 1210 vertex of which 732 / 1210 are part of one of the 20 SCC in 1 ms
Free SCC test removed 712 places
Ensure Unique test removed 840 transitions
Reduce isomorphic transitions removed 840 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 497 transition count 522
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 445 transition count 513
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 442 transition count 508
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 129 place count 437 transition count 506
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 436 transition count 505
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 131 place count 436 transition count 500
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 141 place count 431 transition count 500
Discarding 86 places :
Symmetric choice reduction at 5 with 86 rule applications. Total rules 227 place count 345 transition count 413
Iterating global reduction 5 with 86 rules applied. Total rules applied 313 place count 345 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 315 place count 345 transition count 411
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 315 place count 345 transition count 397
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 343 place count 331 transition count 397
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 361 place count 313 transition count 368
Iterating global reduction 6 with 18 rules applied. Total rules applied 379 place count 313 transition count 368
Performed 83 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 6 with 166 rules applied. Total rules applied 545 place count 230 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 547 place count 230 transition count 282
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 551 place count 228 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 552 place count 228 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 553 place count 227 transition count 284
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 141 edges and 221 vertex of which 22 / 221 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 8 rules applied. Total rules applied 561 place count 210 transition count 283
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 25 rules applied. Total rules applied 586 place count 209 transition count 259
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 588 place count 208 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 590 place count 207 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 593 place count 207 transition count 254
Applied a total of 593 rules in 103 ms. Remains 207 /1210 variables (removed 1003) and now considering 254/1415 (removed 1161) transitions.
[2021-05-13 23:49:20] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:49:20] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:49:20] [INFO ] Input system was already deterministic with 254 transitions.
[2021-05-13 23:49:20] [INFO ] Flatten gal took : 23 ms
[2021-05-13 23:49:20] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8959489699398998911.gal : 1 ms
[2021-05-13 23:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4864320484734914922.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8959489699398998911.gal, -t, CGAL, -ctl, /tmp/CTLFireability4864320484734914922.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8959489699398998911.gal -t CGAL -ctl /tmp/CTLFireability4864320484734914922.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10365e+26,0.17245,9796,2,2836,5,28738,6,0,1065,22910,0


Converting to forward existential form...Done !
original formula: EF((!(EF(((p987==0)&&(p426==0)))) * (!(AG((((((((p813==1)||(p620==1))||(p859==1))||((p1032==1)&&(p1074==1)))||((p739==1)&&(p1354==1)))||(p1012==1))||(p1146==1)))) + !(AG((((p129==1)||(p488==1))||(p220==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((p987==0)&&(p426==0))))),TRUE) * !((((((((p813==1)||(p620==1))||(p859==1))||((p1032==1)&&(p1074==1)))||((p739==1)&&(p1354==1)))||(p1012==1))||(p1146==1))))] != FALSE + [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((p987==0)&&(p426==0))))),TRUE) * !((((p129==1)||(p488==1))||(p220==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/253/1/254
Detected timeout of ITS tools.
[2021-05-13 23:49:50] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:49:50] [INFO ] Applying decomposition
[2021-05-13 23:49:50] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3328440181599200915.txt, -o, /tmp/graph3328440181599200915.bin, -w, /tmp/graph3328440181599200915.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3328440181599200915.bin, -l, -1, -v, -w, /tmp/graph3328440181599200915.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:49:50] [INFO ] Decomposing Gal with order
[2021-05-13 23:49:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:49:50] [INFO ] Removed a total of 19 redundant transitions.
[2021-05-13 23:49:50] [INFO ] Flatten gal took : 12 ms
[2021-05-13 23:49:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2021-05-13 23:49:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4002478919373505674.gal : 2 ms
[2021-05-13 23:49:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11666371425463542010.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4002478919373505674.gal, -t, CGAL, -ctl, /tmp/CTLFireability11666371425463542010.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4002478919373505674.gal -t CGAL -ctl /tmp/CTLFireability11666371425463542010.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10365e+26,0.074222,6300,136,246,2096,2273,498,2594,186,4856,0


Converting to forward existential form...Done !
original formula: EF((!(EF(((i7.u21.p987==0)&&(i1.i1.u6.p426==0)))) * (!(AG((((((((i5.u16.p813==1)||(i3.u11.p620==1))||(i6.u18.p859==1))||((i9.u23.p1032==1)&&(u22.p1074==1)))||((i6.u19.p739==1)&&(i10.u28.p1354==1)))||(i9.u24.p1012==1))||(i9.u24.p1146==1)))) + !(AG((((i0.u0.p129==1)||(i2.u8.p488==1))||(i0.u2.p220==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((i7.u21.p987==0)&&(i1.i1.u6.p426==0))))),TRUE) * !((((((((i5.u16.p813==1)||(i3.u11.p620==1))||(i6.u18.p859==1))||((i9.u23.p1032==1)&&(u22.p1074==1)))||((i6.u19.p739==1)&&(i10.u28.p1354==1)))||(i9.u24.p1012==1))||(i9.u24.p1146==1))))] != FALSE + [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((i7.u21.p987==0)&&(i1.i1.u6.p426==0))))),TRUE) * !((((i0.u0.p129==1)||(i2.u8.p488==1))||(i0.u2.p220==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/250/1/251
(forward)formula 0,0,0.359546,17888,1,0,19053,11729,2980,43920,1297,48340,16428
FORMULA NoC3x3-PT-1B-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Graph (trivial) has 1103 edges and 1210 vertex of which 404 / 1210 are part of one of the 18 SCC in 1 ms
Free SCC test removed 386 places
Ensure Unique test removed 437 transitions
Reduce isomorphic transitions removed 437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 823 transition count 741
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 270 rules applied. Total rules applied 507 place count 587 transition count 707
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 42 rules applied. Total rules applied 549 place count 580 transition count 672
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 45 rules applied. Total rules applied 594 place count 546 transition count 661
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 596 place count 544 transition count 661
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 596 place count 544 transition count 648
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 622 place count 531 transition count 648
Discarding 87 places :
Symmetric choice reduction at 5 with 87 rule applications. Total rules 709 place count 444 transition count 560
Iterating global reduction 5 with 87 rules applied. Total rules applied 796 place count 444 transition count 560
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 798 place count 444 transition count 558
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 798 place count 444 transition count 545
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 824 place count 431 transition count 545
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 841 place count 414 transition count 520
Iterating global reduction 6 with 17 rules applied. Total rules applied 858 place count 414 transition count 520
Performed 115 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 115 places in 0 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 6 with 230 rules applied. Total rules applied 1088 place count 299 transition count 396
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1102 place count 299 transition count 382
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1103 place count 298 transition count 380
Iterating global reduction 7 with 1 rules applied. Total rules applied 1104 place count 298 transition count 380
Performed 11 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1126 place count 287 transition count 456
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1128 place count 287 transition count 454
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1130 place count 287 transition count 452
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1135 place count 287 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1136 place count 286 transition count 451
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 120 edges and 285 vertex of which 2 / 285 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1139 place count 284 transition count 450
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1143 place count 283 transition count 447
Applied a total of 1143 rules in 117 ms. Remains 283 /1210 variables (removed 927) and now considering 447/1415 (removed 968) transitions.
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 14 ms
[2021-05-13 23:49:51] [INFO ] Input system was already deterministic with 447 transitions.
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 14 ms
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8710958748128744837.gal : 2 ms
[2021-05-13 23:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6241391095970794609.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8710958748128744837.gal, -t, CGAL, -ctl, /tmp/CTLFireability6241391095970794609.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8710958748128744837.gal -t CGAL -ctl /tmp/CTLFireability6241391095970794609.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25189e+30,0.232397,12176,2,1682,5,36382,6,0,1557,30910,0


Converting to forward existential form...Done !
original formula: EF(((((((((p715==1)||(p1005==1))||(p546==1))||(p302==1))||(p376==1))||(p550==1)) + AG(((((((((EF(((((((((p927==1)||(p359==1))||(p574==1))||(p6==1))||(p1323==1))||(p139==1))||(p395==1))||(p441==1))) + (p1106==1)) + (p1264==1)) + ((p496==1)&&(p713==1))) + (p772==1)) + (p1137==1)) + (p288==1)) * ((p1010==0)||(p1117==0))) * ((((((((((((((((((p1184==1)||(p132==1))||(p1016==1))||(p1096==1))||((p61==1)&&(p91==1)))||(p902==1))||(p628==1))||(p1196==1))||(p220==1))||(p958==1))||(p17==1))||(p1397==1))||(p247==1))||(p405==1))||(p71==1))||(p994==1))||(p250==1))||(p108==1))))) + (!(EF(((((p617==1)||(p263==1))||(p288==1))||(p816==1)))) * (((p244==1)||(p1172==1))||(p1346==1)))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((((((p715==1)||(p1005==1))||(p546==1))||(p302==1))||(p376==1))||(p550==1)))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((E(TRUE U ((((((((p927==1)||(p359==1))||(p574==1))||(p6==1))||(p1323==1))||(p139==1))||(p395==1))||(p441==1))) + (p1106==1)) + (p1264==1)) + ((p496==1)&&(p713==1))) + (p772==1)) + (p1137==1)) + (p288==1)) * ((p1010==0)||(p1117==0))) * ((((((((((((((((((p1184==1)||(p132==1))||(p1016==1))||(p1096==1))||((p61==1)&&(p91==1)))||(p902==1))||(p628==1))||(p1196==1))||(p220==1))||(p958==1))||(p17==1))||(p1397==1))||(p247==1))||(p405==1))||(p71==1))||(p994==1))||(p250==1))||(p108==1)))))))] != FALSE) + [((FwdU(Init,TRUE) * (((p244==1)||(p1172==1))||(p1346==1))) * !(E(TRUE U ((((p617==1)||(p263==1))||(p288==1))||(p816==1)))))] != FALSE)
(forward)formula 0,1,0.235579,12560,1,0,7,36382,8,1,1575,30910,1
FORMULA NoC3x3-PT-1B-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Graph (trivial) has 1095 edges and 1210 vertex of which 481 / 1210 are part of one of the 16 SCC in 1 ms
Free SCC test removed 465 places
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 164 place count 744 transition count 714
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 179 rules applied. Total rules applied 343 place count 581 transition count 698
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 348 place count 578 transition count 696
Reduce places removed 1 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 3 with 44 rules applied. Total rules applied 392 place count 577 transition count 653
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 443 place count 534 transition count 645
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 443 place count 534 transition count 632
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 469 place count 521 transition count 632
Discarding 89 places :
Symmetric choice reduction at 5 with 89 rule applications. Total rules 558 place count 432 transition count 543
Iterating global reduction 5 with 89 rules applied. Total rules applied 647 place count 432 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 648 place count 432 transition count 542
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 648 place count 432 transition count 526
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 680 place count 416 transition count 526
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 700 place count 396 transition count 494
Iterating global reduction 6 with 20 rules applied. Total rules applied 720 place count 396 transition count 494
Performed 102 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 924 place count 294 transition count 387
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 935 place count 294 transition count 376
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 957 place count 283 transition count 425
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 963 place count 283 transition count 419
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 974 place count 283 transition count 408
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 975 place count 283 transition count 408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 976 place count 282 transition count 407
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 118 edges and 278 vertex of which 10 / 278 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 982 place count 273 transition count 406
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 995 place count 272 transition count 394
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 997 place count 271 transition count 393
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1001 place count 269 transition count 391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1006 place count 269 transition count 386
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1009 place count 269 transition count 383
Applied a total of 1009 rules in 100 ms. Remains 269 /1210 variables (removed 941) and now considering 383/1415 (removed 1032) transitions.
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 20 ms
[2021-05-13 23:49:51] [INFO ] Input system was already deterministic with 383 transitions.
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:49:51] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9874005101170251385.gal : 1 ms
[2021-05-13 23:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12100872485250799432.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9874005101170251385.gal, -t, CGAL, -ctl, /tmp/CTLFireability12100872485250799432.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9874005101170251385.gal -t CGAL -ctl /tmp/CTLFireability12100872485250799432.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99654e+29,0.230293,11972,2,906,5,38049,6,0,1441,33528,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p999==0)||((((((((p114==0)&&(p1315==0))&&(p241==0))&&(p1127==0))&&(p805==0))&&(p965==0))&&(p111==0))&&(p506==0))) * !(EF(((((((((((p682==1)||(p681==1))||(p435==1))||(p1143==1))||(p323==1))||(p229==1))||((p474==1)&&(p889==1)))||(p93==1))||(p1385==1))||(p947==1))))) + (((((((((((p990==0)&&(p341==0))&&(p391==0))&&(p1255==0))&&(p668==0))&&(p934==0))&&(p284==0))&&(p415==0))&&(p412==0))&&(p565==0))&&(((((((((p649==1)||(p423==1))||(p1155==1))||(p1377==1))||(p512==1))||(p608==1))||((p471==1)&&(p697==1)))||(p281==1))||(p111==1))))) * ((((((((p1104==1)||(p571==1))||(p305==1))||(p1407==1))||(p1230==1))||(p1246==1))||(p1084==1))||(p1135==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((((p1104==1)||(p571==1))||(p305==1))||(p1407==1))||(p1230==1))||(p1246==1))||(p1084==1))||(p1135==1))) * !(E(TRUE U !(((((p999==0)||((((((((p114==0)&&(p1315==0))&&(p241==0))&&(p1127==0))&&(p805==0))&&(p965==0))&&(p111==0))&&(p506==0))) * !(E(TRUE U ((((((((((p682==1)||(p681==1))||(p435==1))||(p1143==1))||(p323==1))||(p229==1))||((p474==1)&&(p889==1)))||(p93==1))||(p1385==1))||(p947==1))))) + (((((((((((p990==0)&&(p341==0))&&(p391==0))&&(p1255==0))&&(p668==0))&&(p934==0))&&(p284==0))&&(p415==0))&&(p412==0))&&(p565==0))&&(((((((((p649==1)||(p423==1))||(p1155==1))||(p1377==1))||(p512==1))||(p608==1))||((p471==1)&&(p697==1)))||(p281==1))||(p111==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t50, t80, t100, t329, t330, t331, t332, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/375/8/383
Detected timeout of ITS tools.
[2021-05-13 23:50:21] [INFO ] Flatten gal took : 11 ms
[2021-05-13 23:50:21] [INFO ] Applying decomposition
[2021-05-13 23:50:21] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6920269712331676449.txt, -o, /tmp/graph6920269712331676449.bin, -w, /tmp/graph6920269712331676449.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6920269712331676449.bin, -l, -1, -v, -w, /tmp/graph6920269712331676449.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:50:21] [INFO ] Decomposing Gal with order
[2021-05-13 23:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:50:21] [INFO ] Removed a total of 95 redundant transitions.
[2021-05-13 23:50:21] [INFO ] Flatten gal took : 19 ms
[2021-05-13 23:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 4 ms.
[2021-05-13 23:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7824215405138914780.gal : 2 ms
[2021-05-13 23:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14470981823590905803.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7824215405138914780.gal, -t, CGAL, -ctl, /tmp/CTLFireability14470981823590905803.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7824215405138914780.gal -t CGAL -ctl /tmp/CTLFireability14470981823590905803.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99654e+29,0.115052,8252,227,291,5031,4832,767,5879,260,10287,0


Converting to forward existential form...Done !
original formula: EF((AG(((((i9.u33.p999==0)||((((((((i0.i0.u2.p114==0)&&(i13.i0.u45.p1315==0))&&(i0.i1.u5.p241==0))&&(i11.u37.p1127==0))&&(i9.u27.p805==0))&&(i9.u31.p965==0))&&(i0.i0.u1.p111==0))&&(i4.u16.p506==0))) * !(EF(((((((((((i7.u22.p682==1)||(i7.u23.p681==1))||(i3.u12.p435==1))||(i11.u39.p1143==1))||(i1.u8.p323==1))||(i0.i1.u4.p229==1))||((i4.u14.p474==1)&&(i9.u28.p889==1)))||(i0.i0.u2.p93==1))||(i13.i1.u46.p1385==1))||(i8.u30.p947==1))))) + (((((((((((i9.u32.p990==0)&&(i2.u10.p341==0))&&(i2.u10.p391==0))&&(i12.u44.p1255==0))&&(i6.u20.p668==0))&&(i8.u29.p934==0))&&(i1.u7.p284==0))&&(i3.u11.p415==0))&&(i3.u11.p412==0))&&(i5.u18.p565==0))&&(((((((((i6.u21.p649==1)||(i3.u12.p423==1))||(i11.u37.p1155==1))||(i13.i1.u47.p1377==1))||(i4.u16.p512==1))||(i5.u19.p608==1))||((i6.u13.p471==1)&&(i7.u24.p697==1)))||(i1.u7.p281==1))||(i0.i0.u1.p111==1))))) * ((((((((i11.u36.p1104==1)||(i5.u18.p571==1))||(i1.u7.p305==1))||(i13.i1.u47.p1407==1))||(i13.i1.u42.p1230==1))||(i12.u43.p1246==1))||(i10.u35.p1084==1))||(i11.u38.p1135==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((((i11.u36.p1104==1)||(i5.u18.p571==1))||(i1.u7.p305==1))||(i13.i1.u47.p1407==1))||(i13.i1.u42.p1230==1))||(i12.u43.p1246==1))||(i10.u35.p1084==1))||(i11.u38.p1135==1))) * !(E(TRUE U !(((((i9.u33.p999==0)||((((((((i0.i0.u2.p114==0)&&(i13.i0.u45.p1315==0))&&(i0.i1.u5.p241==0))&&(i11.u37.p1127==0))&&(i9.u27.p805==0))&&(i9.u31.p965==0))&&(i0.i0.u1.p111==0))&&(i4.u16.p506==0))) * !(E(TRUE U ((((((((((i7.u22.p682==1)||(i7.u23.p681==1))||(i3.u12.p435==1))||(i11.u39.p1143==1))||(i1.u8.p323==1))||(i0.i1.u4.p229==1))||((i4.u14.p474==1)&&(i9.u28.p889==1)))||(i0.i0.u2.p93==1))||(i13.i1.u46.p1385==1))||(i8.u30.p947==1))))) + (((((((((((i9.u32.p990==0)&&(i2.u10.p341==0))&&(i2.u10.p391==0))&&(i12.u44.p1255==0))&&(i6.u20.p668==0))&&(i8.u29.p934==0))&&(i1.u7.p284==0))&&(i3.u11.p415==0))&&(i3.u11.p412==0))&&(i5.u18.p565==0))&&(((((((((i6.u21.p649==1)||(i3.u12.p423==1))||(i11.u37.p1155==1))||(i13.i1.u47.p1377==1))||(i4.u16.p512==1))||(i5.u19.p608==1))||((i6.u13.p471==1)&&(i7.u24.p697==1)))||(i1.u7.p281==1))||(i0.i0.u1.p111==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t331, i3.u11.t100, i6.u21.t80, i8.u30.t50, i13.i1.u47.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/356/5/361
Detected timeout of ITS tools.
Graph (trivial) has 1215 edges and 1210 vertex of which 807 / 1210 are part of one of the 20 SCC in 1 ms
Free SCC test removed 787 places
Ensure Unique test removed 936 transitions
Reduce isomorphic transitions removed 936 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 422 transition count 466
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 410 transition count 466
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 410 transition count 463
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 407 transition count 463
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 116 place count 322 transition count 377
Iterating global reduction 2 with 85 rules applied. Total rules applied 201 place count 322 transition count 377
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 201 place count 322 transition count 364
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 227 place count 309 transition count 364
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 247 place count 289 transition count 333
Iterating global reduction 2 with 20 rules applied. Total rules applied 267 place count 289 transition count 333
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 419 place count 213 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 421 place count 212 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 211 transition count 255
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 145 edges and 205 vertex of which 28 / 205 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 429 place count 191 transition count 255
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 457 place count 191 transition count 227
Applied a total of 457 rules in 64 ms. Remains 191 /1210 variables (removed 1019) and now considering 227/1415 (removed 1188) transitions.
[2021-05-13 23:50:51] [INFO ] Flatten gal took : 5 ms
[2021-05-13 23:50:51] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:50:51] [INFO ] Input system was already deterministic with 227 transitions.
[2021-05-13 23:50:51] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:50:51] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:50:51] [INFO ] Time to serialize gal into /tmp/CTLFireability977079473709171602.gal : 0 ms
[2021-05-13 23:50:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7764803027685478476.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability977079473709171602.gal, -t, CGAL, -ctl, /tmp/CTLFireability7764803027685478476.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability977079473709171602.gal -t CGAL -ctl /tmp/CTLFireability7764803027685478476.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.92849e+25,0.120258,8980,2,2603,5,23287,6,0,974,18205,0


Converting to forward existential form...Done !
original formula: !(EF((((p66==1)&&(p393==1))||(p694==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((p66==1)&&(p393==1))||(p694==1)))] = FALSE
(forward)formula 0,0,0.124315,9424,1,0,7,23287,8,1,983,18205,1
FORMULA NoC3x3-PT-1B-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Graph (trivial) has 1146 edges and 1210 vertex of which 623 / 1210 are part of one of the 18 SCC in 1 ms
Free SCC test removed 605 places
Ensure Unique test removed 703 transitions
Reduce isomorphic transitions removed 703 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 604 transition count 606
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 122 rules applied. Total rules applied 228 place count 499 transition count 589
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 251 place count 495 transition count 570
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 275 place count 476 transition count 565
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 275 place count 476 transition count 558
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 289 place count 469 transition count 558
Discarding 86 places :
Symmetric choice reduction at 4 with 86 rule applications. Total rules 375 place count 383 transition count 471
Iterating global reduction 4 with 86 rules applied. Total rules applied 461 place count 383 transition count 471
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 461 place count 383 transition count 457
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 489 place count 369 transition count 457
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 509 place count 349 transition count 427
Iterating global reduction 4 with 20 rules applied. Total rules applied 529 place count 349 transition count 427
Performed 89 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 707 place count 260 transition count 335
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 712 place count 260 transition count 330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 713 place count 259 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 714 place count 259 transition count 327
Performed 7 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 728 place count 252 transition count 358
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 736 place count 252 transition count 350
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 739 place count 252 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 740 place count 251 transition count 349
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 118 edges and 247 vertex of which 16 / 247 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 7 rules applied. Total rules applied 747 place count 239 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 767 place count 237 transition count 329
Applied a total of 767 rules in 67 ms. Remains 237 /1210 variables (removed 973) and now considering 329/1415 (removed 1086) transitions.
[2021-05-13 23:50:52] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:50:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:50:52] [INFO ] Input system was already deterministic with 329 transitions.
[2021-05-13 23:50:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:50:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:50:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2006120624145585922.gal : 1 ms
[2021-05-13 23:50:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2749568214923820344.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2006120624145585922.gal, -t, CGAL, -ctl, /tmp/CTLFireability2749568214923820344.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2006120624145585922.gal -t CGAL -ctl /tmp/CTLFireability2749568214923820344.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.99217e+27,0.356708,17324,2,3903,5,69105,6,0,1258,54618,0


Converting to forward existential form...Done !
original formula: E((A((((((((p423==1)||((p455==1)&&(p695==1)))||(p352==1))||(p444==1))||(p1059==1))||((p750==1)&&(p807==1)))||(p1402==1)) U AG((((p71==0)&&(p111==0))&&(p865==0)))) + (((((((((p1060==0)&&(p620==0))&&(p123==0))&&(p364==0))&&(p599==0))&&(p1071==0))&&((p481==0)||(p650==0))) * ((!(A((((p223==1)||(p775==1))||(p362==1)) U (((p1088==1)||(p50==1))||(p1097==1)))) + (p325==1)) + (p1337==1))) * ((p421==0)||((p289==0)&&(p997==0))))) U ((p365==1)||(p72==1)))
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!(E(TRUE U !((((p71==0)&&(p111==0))&&(p865==0)))))) U (!((((((((p423==1)||((p455==1)&&(p695==1)))||(p352==1))||(p444==1))||(p1059==1))||((p750==1)&&(p807==1)))||(p1402==1))) * !(!(E(TRUE U !((((p71==0)&&(p111==0))&&(p865==0)))))))) + EG(!(!(E(TRUE U !((((p71==0)&&(p111==0))&&(p865==0))))))))) + (((((((((p1060==0)&&(p620==0))&&(p123==0))&&(p364==0))&&(p599==0))&&(p1071==0))&&((p481==0)||(p650==0))) * ((!(!((E(!((((p1088==1)||(p50==1))||(p1097==1))) U (!((((p223==1)||(p775==1))||(p362==1))) * !((((p1088==1)||(p50==1))||(p1097==1))))) + EG(!((((p1088==1)||(p50==1))||(p1097==1))))))) + (p325==1)) + (p1337==1))) * ((p421==0)||((p289==0)&&(p997==0)))))) * ((p365==1)||(p72==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t48, t96, t261, t262, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/324/5/329
Detected timeout of ITS tools.
[2021-05-13 23:51:22] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:51:22] [INFO ] Applying decomposition
[2021-05-13 23:51:22] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11821913817303436323.txt, -o, /tmp/graph11821913817303436323.bin, -w, /tmp/graph11821913817303436323.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11821913817303436323.bin, -l, -1, -v, -w, /tmp/graph11821913817303436323.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:51:22] [INFO ] Decomposing Gal with order
[2021-05-13 23:51:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:51:22] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-13 23:51:22] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:51:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2021-05-13 23:51:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3572264686317530431.gal : 2 ms
[2021-05-13 23:51:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13347343740477932090.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3572264686317530431.gal, -t, CGAL, -ctl, /tmp/CTLFireability13347343740477932090.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3572264686317530431.gal -t CGAL -ctl /tmp/CTLFireability13347343740477932090.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.99217e+27,0.097699,7952,171,226,3949,4540,644,5160,214,9004,0


Converting to forward existential form...Done !
original formula: E((A((((((((i4.u10.p423==1)||((i5.u12.p455==1)&&(i6.u17.p695==1)))||(u9.p352==1))||(i4.u11.p444==1))||(i11.u28.p1059==1))||((i10.u19.p750==1)&&(i9.u22.p807==1)))||(i13.i0.u40.p1402==1)) U AG((((i0.u1.p71==0)&&(i0.u2.p111==0))&&(i10.u23.p865==0)))) + (((((((((i11.u28.p1060==0)&&(i7.u15.p620==0))&&(i0.u3.p123==0))&&(u9.p364==0))&&(i5.u14.p599==0))&&(i11.u29.p1071==0))&&((i7.u16.p481==0)||(i7.u16.p650==0))) * ((!(A((((u5.p223==1)||(i9.u21.p775==1))||(u9.p362==1)) U (((i11.u30.p1088==1)||(i0.u3.p50==1))||(i11.u27.p1097==1)))) + (i2.u8.p325==1)) + (i13.i1.u38.p1337==1))) * ((i4.u11.p421==0)||((i2.u6.p289==0)&&(i10.u25.p997==0))))) U ((u9.p365==1)||(i0.u2.p72==1)))
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!(E(TRUE U !((((i0.u1.p71==0)&&(i0.u2.p111==0))&&(i10.u23.p865==0)))))) U (!((((((((i4.u10.p423==1)||((i5.u12.p455==1)&&(i6.u17.p695==1)))||(u9.p352==1))||(i4.u11.p444==1))||(i11.u28.p1059==1))||((i10.u19.p750==1)&&(i9.u22.p807==1)))||(i13.i0.u40.p1402==1))) * !(!(E(TRUE U !((((i0.u1.p71==0)&&(i0.u2.p111==0))&&(i10.u23.p865==0)))))))) + EG(!(!(E(TRUE U !((((i0.u1.p71==0)&&(i0.u2.p111==0))&&(i10.u23.p865==0))))))))) + (((((((((i11.u28.p1060==0)&&(i7.u15.p620==0))&&(i0.u3.p123==0))&&(u9.p364==0))&&(i5.u14.p599==0))&&(i11.u29.p1071==0))&&((i7.u16.p481==0)||(i7.u16.p650==0))) * ((!(!((E(!((((i11.u30.p1088==1)||(i0.u3.p50==1))||(i11.u27.p1097==1))) U (!((((u5.p223==1)||(i9.u21.p775==1))||(u9.p362==1))) * !((((i11.u30.p1088==1)||(i0.u3.p50==1))||(i11.u27.p1097==1))))) + EG(!((((i11.u30.p1088==1)||(i0.u3.p50==1))||(i11.u27.p1097==1))))))) + (i2.u8.p325==1)) + (i13.i1.u38.p1337==1))) * ((i4.u11.p421==0)||((i2.u6.p289==0)&&(i10.u25.p997==0)))))) * ((u9.p365==1)||(i0.u2.p72==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions u9.t96, i0.t262, i0.u2.t261, i10.u23.t48, i11.t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/5/305
Detected timeout of ITS tools.
Graph (trivial) has 1074 edges and 1210 vertex of which 445 / 1210 are part of one of the 16 SCC in 1 ms
Free SCC test removed 429 places
Ensure Unique test removed 488 transitions
Reduce isomorphic transitions removed 488 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 189 place count 780 transition count 738
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 210 rules applied. Total rules applied 399 place count 592 transition count 716
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 407 place count 586 transition count 714
Reduce places removed 1 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 3 with 49 rules applied. Total rules applied 456 place count 585 transition count 666
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 65 rules applied. Total rules applied 521 place count 537 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 536 transition count 649
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 522 place count 536 transition count 635
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 550 place count 522 transition count 635
Discarding 85 places :
Symmetric choice reduction at 6 with 85 rule applications. Total rules 635 place count 437 transition count 549
Iterating global reduction 6 with 85 rules applied. Total rules applied 720 place count 437 transition count 549
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 720 place count 437 transition count 537
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 744 place count 425 transition count 537
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 760 place count 409 transition count 513
Iterating global reduction 6 with 16 rules applied. Total rules applied 776 place count 409 transition count 513
Performed 105 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 210 rules applied. Total rules applied 986 place count 304 transition count 403
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 998 place count 304 transition count 391
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1026 place count 290 transition count 462
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1039 place count 290 transition count 449
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1043 place count 290 transition count 445
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1049 place count 290 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1050 place count 290 transition count 444
Applied a total of 1050 rules in 71 ms. Remains 290 /1210 variables (removed 920) and now considering 444/1415 (removed 971) transitions.
[2021-05-13 23:51:52] [INFO ] Flatten gal took : 12 ms
[2021-05-13 23:51:52] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:51:52] [INFO ] Input system was already deterministic with 444 transitions.
[2021-05-13 23:51:52] [INFO ] Flatten gal took : 14 ms
[2021-05-13 23:51:52] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:51:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5757429225815971651.gal : 2 ms
[2021-05-13 23:51:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2662129869955658926.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5757429225815971651.gal, -t, CGAL, -ctl, /tmp/CTLFireability2662129869955658926.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5757429225815971651.gal -t CGAL -ctl /tmp/CTLFireability2662129869955658926.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.89785e+30,0.318763,14068,2,1036,5,48017,6,0,1578,42129,0


Converting to forward existential form...Done !
original formula: E(!(A((((((p247==0)&&(p198==0))&&(p1014==0))&&(p1118==0)) * E((((((((p1396==1)||(p388==1))||(p808==1))||(p1078==1))||(p317==1))||(p721==1))&&((((((p1202==1)||(p1137==1))||(p1107==1))||(p767==1))||(p540==1))||(p1057==1))) U (((((((((((((((((p893==1)||(p244==1))||(p877==1))||((p58==1)&&(p209==1)))||(p59==1))||((p249==1)&&(p295==1)))||(p915==1))||(p456==1))||(p441==1))||(p236==1))||(p1006==1))||(p556==1))||(p170==1))||(p546==1))||(p248==1))||(p849==1))||(p1326==1)))) U E((p1346==1) U A((p525==1) U ((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1)))))) U ((((p129==1)||(p1206==1))||(p1126==1))||(p791==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(E((p1346==1) U !((E(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))) U (!((p525==1)) * !(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))))) + EG(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1)))))))) U (!((((((p247==0)&&(p198==0))&&(p1014==0))&&(p1118==0)) * E((((((((p1396==1)||(p388==1))||(p808==1))||(p1078==1))||(p317==1))||(p721==1))&&((((((p1202==1)||(p1137==1))||(p1107==1))||(p767==1))||(p540==1))||(p1057==1))) U (((((((((((((((((p893==1)||(p244==1))||(p877==1))||((p58==1)&&(p209==1)))||(p59==1))||((p249==1)&&(p295==1)))||(p915==1))||(p456==1))||(p441==1))||(p236==1))||(p1006==1))||(p556==1))||(p170==1))||(p546==1))||(p248==1))||(p849==1))||(p1326==1))))) * !(E((p1346==1) U !((E(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))) U (!((p525==1)) * !(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))))) + EG(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1)))))))))) + EG(!(E((p1346==1) U !((E(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))) U (!((p525==1)) * !(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))))) + EG(!(((((((((((p1013==1)&&(p1058==1))||(p664==1))||((p58==1)&&(p209==1)))||(p466==1))||(p1284==1))||(p1097==1))||(p120==1))||((p1219==1)&&(p1272==1)))||(p188==1))))))))))))) * ((((p129==1)||(p1206==1))||(p1126==1))||(p791==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t33, t42, t43, t72, t76, t131, t237, t273, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/436/8/444
Detected timeout of ITS tools.
[2021-05-13 23:52:22] [INFO ] Flatten gal took : 14 ms
[2021-05-13 23:52:22] [INFO ] Applying decomposition
[2021-05-13 23:52:22] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15238336629818343227.txt, -o, /tmp/graph15238336629818343227.bin, -w, /tmp/graph15238336629818343227.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15238336629818343227.bin, -l, -1, -v, -w, /tmp/graph15238336629818343227.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:52:22] [INFO ] Decomposing Gal with order
[2021-05-13 23:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:52:22] [INFO ] Removed a total of 238 redundant transitions.
[2021-05-13 23:52:22] [INFO ] Flatten gal took : 23 ms
[2021-05-13 23:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 5 ms.
[2021-05-13 23:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13949615525297506532.gal : 3 ms
[2021-05-13 23:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9748789132462859167.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13949615525297506532.gal, -t, CGAL, -ctl, /tmp/CTLFireability9748789132462859167.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13949615525297506532.gal -t CGAL -ctl /tmp/CTLFireability9748789132462859167.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.89785e+30,0.233479,12412,300,684,5920,21967,818,7120,366,40305,0


Converting to forward existential form...Done !
original formula: E(!(A((((((i2.i0.u4.p247==0)&&(i2.i0.u5.p198==0))&&(i10.u30.p1014==0))&&(i11.u35.p1118==0)) * E((((((((i14.u45.p1396==1)||(i3.u11.p388==1))||(i8.u23.p808==1))||(i10.u34.p1078==1))||(i3.u9.p317==1))||(i6.u21.p721==1))&&((((((i12.u39.p1202==1)||(i11.u37.p1137==1))||(i11.u36.p1107==1))||(i8.u22.p767==1))||(i5.u16.p540==1))||(i10.u33.p1057==1))) U (((((((((((((((((i7.u25.p893==1)||(i2.i1.u7.p244==1))||(i8.u24.p877==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i0.u0.p59==1))||((i3.u11.p249==1)&&(i3.u9.p295==1)))||(i7.u27.p915==1))||(i4.u13.p456==1))||(i3.u12.p441==1))||(i2.i1.u7.p236==1))||(i9.u28.p1006==1))||(i5.u17.p556==1))||(i1.u2.p170==1))||(i5.u17.p546==1))||(i2.i0.u8.p248==1))||(i8.u24.p849==1))||(i13.u43.p1326==1)))) U E((i13.u43.p1346==1) U A((i5.u17.p525==1) U ((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1)))))) U ((((i0.u1.p129==1)||(i12.u40.p1206==1))||(i11.u37.p1126==1))||(i8.u23.p791==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(E((i13.u43.p1346==1) U !((E(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))) U (!((i5.u17.p525==1)) * !(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))))) + EG(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1)))))))) U (!((((((i2.i0.u4.p247==0)&&(i2.i0.u5.p198==0))&&(i10.u30.p1014==0))&&(i11.u35.p1118==0)) * E((((((((i14.u45.p1396==1)||(i3.u11.p388==1))||(i8.u23.p808==1))||(i10.u34.p1078==1))||(i3.u9.p317==1))||(i6.u21.p721==1))&&((((((i12.u39.p1202==1)||(i11.u37.p1137==1))||(i11.u36.p1107==1))||(i8.u22.p767==1))||(i5.u16.p540==1))||(i10.u33.p1057==1))) U (((((((((((((((((i7.u25.p893==1)||(i2.i1.u7.p244==1))||(i8.u24.p877==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i0.u0.p59==1))||((i3.u11.p249==1)&&(i3.u9.p295==1)))||(i7.u27.p915==1))||(i4.u13.p456==1))||(i3.u12.p441==1))||(i2.i1.u7.p236==1))||(i9.u28.p1006==1))||(i5.u17.p556==1))||(i1.u2.p170==1))||(i5.u17.p546==1))||(i2.i0.u8.p248==1))||(i8.u24.p849==1))||(i13.u43.p1326==1))))) * !(E((i13.u43.p1346==1) U !((E(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))) U (!((i5.u17.p525==1)) * !(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))))) + EG(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1)))))))))) + EG(!(E((i13.u43.p1346==1) U !((E(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))) U (!((i5.u17.p525==1)) * !(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))))) + EG(!(((((((((((i10.u30.p1013==1)&&(i10.u33.p1058==1))||(i4.u19.p664==1))||((i0.u1.p58==1)&&(i2.i1.u6.p209==1)))||(i6.u14.p466==1))||(i13.u42.p1284==1))||(i10.u32.p1097==1))||(i0.u1.p120==1))||((i13.u42.p1219==1)&&(i13.u41.p1272==1)))||(i1.u3.p188==1))))))))))))) * ((((i0.u1.p129==1)||(i12.u40.p1206==1))||(i11.u37.p1126==1))||(i8.u23.p791==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t237, t273, i2.i0.t131, i8.u23.t76, i8.u24.t72, i10.t42, i10.t33, i10.u30.t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/400/8/408
Detected timeout of ITS tools.
Graph (trivial) has 1165 edges and 1210 vertex of which 671 / 1210 are part of one of the 20 SCC in 0 ms
Free SCC test removed 651 places
Ensure Unique test removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 558 transition count 571
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 97 rules applied. Total rules applied 182 place count 474 transition count 558
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 20 rules applied. Total rules applied 202 place count 472 transition count 540
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 26 rules applied. Total rules applied 228 place count 454 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 453 transition count 532
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 229 place count 453 transition count 528
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 237 place count 449 transition count 528
Discarding 84 places :
Symmetric choice reduction at 5 with 84 rule applications. Total rules 321 place count 365 transition count 443
Iterating global reduction 5 with 84 rules applied. Total rules applied 405 place count 365 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 408 place count 365 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 409 place count 364 transition count 440
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 409 place count 364 transition count 425
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 439 place count 349 transition count 425
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 460 place count 328 transition count 392
Iterating global reduction 7 with 21 rules applied. Total rules applied 481 place count 328 transition count 392
Performed 84 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 7 with 168 rules applied. Total rules applied 649 place count 244 transition count 306
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 653 place count 244 transition count 302
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 661 place count 240 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 664 place count 240 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 665 place count 239 transition count 317
Applied a total of 665 rules in 49 ms. Remains 239 /1210 variables (removed 971) and now considering 317/1415 (removed 1098) transitions.
[2021-05-13 23:52:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:52:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:52:52] [INFO ] Input system was already deterministic with 317 transitions.
[2021-05-13 23:52:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:52:52] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3534606310364639878.gal : 1 ms
[2021-05-13 23:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability118609435708631319.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3534606310364639878.gal, -t, CGAL, -ctl, /tmp/CTLFireability118609435708631319.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3534606310364639878.gal -t CGAL -ctl /tmp/CTLFireability118609435708631319.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.0884e+27,0.155346,9484,2,970,5,26943,6,0,1245,20476,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((((((((((EF((((((p1015==1)&&(p1070==1))||(p382==1))||(p996==1))||(p865==1))) * (p244==0)) * (p1054==0)) * (p428==0)) * (p361==0)) * (p1278==0)) * (p173==0)) * (p1396==0)) * (p666==0)) * (p3==0)) * (p71==0)) * (p38==0)) * (p1306==0)) * (p1097==0)) * (p960==0)) * (p693==0)) * ((p745==0)||(p1354==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((E(TRUE U (((((p1015==1)&&(p1070==1))||(p382==1))||(p996==1))||(p865==1))) * (p244==0)) * (p1054==0)) * (p428==0)) * (p361==0)) * (p1278==0)) * (p173==0)) * (p1396==0)) * (p666==0)) * (p3==0)) * (p71==0)) * (p38==0)) * (p1306==0)) * (p1097==0)) * (p960==0)) * (p693==0)) * ((p745==0)||(p1354==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t33, t59, t93, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/314/3/317
Detected timeout of ITS tools.
[2021-05-13 23:53:22] [INFO ] Flatten gal took : 8 ms
[2021-05-13 23:53:22] [INFO ] Applying decomposition
[2021-05-13 23:53:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph964633121719647606.txt, -o, /tmp/graph964633121719647606.bin, -w, /tmp/graph964633121719647606.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph964633121719647606.bin, -l, -1, -v, -w, /tmp/graph964633121719647606.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:53:23] [INFO ] Decomposing Gal with order
[2021-05-13 23:53:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:53:23] [INFO ] Removed a total of 52 redundant transitions.
[2021-05-13 23:53:23] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:53:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2021-05-13 23:53:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17414349157955433696.gal : 1 ms
[2021-05-13 23:53:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2813026461659162599.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17414349157955433696.gal, -t, CGAL, -ctl, /tmp/CTLFireability2813026461659162599.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17414349157955433696.gal -t CGAL -ctl /tmp/CTLFireability2813026461659162599.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.0884e+27,0.095306,7792,300,445,3916,4954,607,4651,252,9207,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((((((((((EF((((((i11.u26.p1015==1)&&(i11.u26.p1070==1))||(i3.u8.p382==1))||(i10.u24.p996==1))||(u20.p865==1))) * (i1.u4.p244==0)) * (i11.u26.p1054==0)) * (u10.p428==0)) * (i3.u9.p361==0)) * (i12.u29.p1278==0)) * (u3.p173==0)) * (i12.u31.p1396==0)) * (i5.u15.p666==0)) * (i12.u0.p3==0)) * (i1.u1.p71==0)) * (i1.u2.p38==0)) * (i12.u30.p1306==0)) * (i11.u25.p1097==0)) * (i10.u22.p960==0)) * (i6.u17.p693==0)) * ((i10.u23.p745==0)||(i12.u30.p1354==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((E(TRUE U (((((i11.u26.p1015==1)&&(i11.u26.p1070==1))||(i3.u8.p382==1))||(i10.u24.p996==1))||(u20.p865==1))) * (i1.u4.p244==0)) * (i11.u26.p1054==0)) * (u10.p428==0)) * (i3.u9.p361==0)) * (i12.u29.p1278==0)) * (u3.p173==0)) * (i12.u31.p1396==0)) * (i5.u15.p666==0)) * (i12.u0.p3==0)) * (i1.u1.p71==0)) * (i1.u2.p38==0)) * (i12.u30.p1306==0)) * (i11.u25.p1097==0)) * (i10.u22.p960==0)) * (i6.u17.p693==0)) * ((i10.u23.p745==0)||(i12.u30.p1354==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u10.t93, u20.t59, i11.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/298/3/301
Detected timeout of ITS tools.
[2021-05-13 23:53:53] [INFO ] Flatten gal took : 30 ms
[2021-05-13 23:53:53] [INFO ] Flatten gal took : 29 ms
[2021-05-13 23:53:53] [INFO ] Applying decomposition
[2021-05-13 23:53:53] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph947806212680234991.txt, -o, /tmp/graph947806212680234991.bin, -w, /tmp/graph947806212680234991.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph947806212680234991.bin, -l, -1, -v, -w, /tmp/graph947806212680234991.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:53:53] [INFO ] Decomposing Gal with order
[2021-05-13 23:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:53:53] [INFO ] Removed a total of 330 redundant transitions.
[2021-05-13 23:53:53] [INFO ] Flatten gal took : 61 ms
[2021-05-13 23:53:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 10 ms.
[2021-05-13 23:53:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16341637464117298849.gal : 8 ms
[2021-05-13 23:53:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10941225413639776517.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16341637464117298849.gal, -t, CGAL, -ctl, /tmp/CTLFireability10941225413639776517.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16341637464117298849.gal -t CGAL -ctl /tmp/CTLFireability10941225413639776517.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 00:16:20] [INFO ] Applying decomposition
[2021-05-14 00:16:21] [INFO ] Flatten gal took : 164 ms
[2021-05-14 00:16:21] [INFO ] Decomposing Gal with order
[2021-05-14 00:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 00:16:21] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-14 00:16:21] [INFO ] Flatten gal took : 203 ms
[2021-05-14 00:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 63 ms.
[2021-05-14 00:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7804969560287273059.gal : 10 ms
[2021-05-14 00:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8443531831148629913.ctl : 11 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7804969560287273059.gal, -t, CGAL, -ctl, /tmp/CTLFireability8443531831148629913.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7804969560287273059.gal -t CGAL -ctl /tmp/CTLFireability8443531831148629913.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 00:39:08] [INFO ] Flatten gal took : 164 ms
[2021-05-14 00:39:09] [INFO ] Input system was already deterministic with 1415 transitions.
[2021-05-14 00:39:09] [INFO ] Transformed 1210 places.
[2021-05-14 00:39:09] [INFO ] Transformed 1415 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 00:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1644196288746494859.gal : 14 ms
[2021-05-14 00:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability454450093130449861.ctl : 11 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability1644196288746494859.gal, -t, CGAL, -ctl, /tmp/CTLFireability454450093130449861.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability1644196288746494859.gal -t CGAL -ctl /tmp/CTLFireability454450093130449861.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, 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 r140-tall-162089127500234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1B.tgz
mv NoC3x3-PT-1B 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 ;