Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390100292.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 PolyORBLF-COL-S02J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390100292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.9K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 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 PolyORBLF-COL-S02J06T06-CTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589800839949

[2020-05-18 11:20:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 11:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 11:20:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 11:20:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2020-05-18 11:20:42] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2020-05-18 11:20:42] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-05-18 11:20:42] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-05-18 11:20:42] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-05-18 11:20:42] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-05-18 11:20:42] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-05-18 11:20:42] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-05-18 11:20:42] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 31 ms.
[2020-05-18 11:20:42] [INFO ] Computed order based on color domains.
[2020-05-18 11:20:42] [INFO ] Unfolded HLPN to a Petri net with 536 places and 968 transitions in 29 ms.
[2020-05-18 11:20:42] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 67 ms.
Incomplete random walk after 100000 steps, including 23 resets, run finished after 1050 ms. (steps per millisecond=95 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-18 11:20:43] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2020-05-18 11:20:43] [INFO ] Computed 50 place invariants in 48 ms
[2020-05-18 11:20:43] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-05-18 11:20:43] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned sat
[2020-05-18 11:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:20:45] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2020-05-18 11:20:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:20:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2020-05-18 11:20:45] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 48 ms returned sat
[2020-05-18 11:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:20:46] [INFO ] [Nat]Absence check using state equation in 1591 ms returned sat
[2020-05-18 11:20:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-05-18 11:20:47] [INFO ] [Nat]Added 78 Read/Feed constraints in 489 ms returned sat
[2020-05-18 11:20:47] [INFO ] Deduced a trap composed of 319 places in 434 ms
[2020-05-18 11:20:48] [INFO ] Deduced a trap composed of 273 places in 356 ms
[2020-05-18 11:20:48] [INFO ] Deduced a trap composed of 285 places in 338 ms
[2020-05-18 11:20:50] [INFO ] Deduced a trap composed of 74 places in 193 ms
[2020-05-18 11:20:51] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2020-05-18 11:20:51] [INFO ] Deduced a trap composed of 73 places in 76 ms
[2020-05-18 11:20:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4947 ms
[2020-05-18 11:20:52] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 106 ms.
[2020-05-18 11:21:05] [INFO ] Added : 435 causal constraints over 87 iterations in 12815 ms. Result :unknown
[2020-05-18 11:21:05] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-05-18 11:21:05] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 35 ms returned unsat
[2020-05-18 11:21:05] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-05-18 11:21:05] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned sat
[2020-05-18 11:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:06] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2020-05-18 11:21:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:21:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-18 11:21:07] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 36 ms returned sat
[2020-05-18 11:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:08] [INFO ] [Nat]Absence check using state equation in 1848 ms returned sat
[2020-05-18 11:21:09] [INFO ] [Nat]Added 78 Read/Feed constraints in 835 ms returned sat
[2020-05-18 11:21:10] [INFO ] Deduced a trap composed of 73 places in 254 ms
[2020-05-18 11:21:10] [INFO ] Deduced a trap composed of 37 places in 263 ms
[2020-05-18 11:21:10] [INFO ] Deduced a trap composed of 73 places in 100 ms
[2020-05-18 11:21:10] [INFO ] Deduced a trap composed of 74 places in 111 ms
[2020-05-18 11:21:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2020-05-18 11:21:11] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 162 ms.
[2020-05-18 11:21:26] [INFO ] Added : 580 causal constraints over 116 iterations in 16072 ms. Result :unknown
[2020-05-18 11:21:27] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned sat
[2020-05-18 11:21:27] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 46 ms returned sat
[2020-05-18 11:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:28] [INFO ] [Real]Absence check using state equation in 1703 ms returned sat
[2020-05-18 11:21:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:21:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 76 ms returned sat
[2020-05-18 11:21:29] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned sat
[2020-05-18 11:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:30] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2020-05-18 11:21:31] [INFO ] [Nat]Added 78 Read/Feed constraints in 274 ms returned sat
[2020-05-18 11:21:31] [INFO ] Deduced a trap composed of 39 places in 280 ms
[2020-05-18 11:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2020-05-18 11:21:31] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 76 ms.
[2020-05-18 11:21:48] [INFO ] Added : 390 causal constraints over 78 iterations in 17448 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-18 11:21:49] [INFO ] [Real]Absence check using 17 positive place invariants in 107 ms returned sat
[2020-05-18 11:21:49] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 39 ms returned sat
[2020-05-18 11:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:50] [INFO ] [Real]Absence check using state equation in 1340 ms returned sat
[2020-05-18 11:21:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:21:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-05-18 11:21:50] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 51 ms returned sat
[2020-05-18 11:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:21:51] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2020-05-18 11:21:52] [INFO ] [Nat]Added 78 Read/Feed constraints in 866 ms returned sat
[2020-05-18 11:21:53] [INFO ] Deduced a trap composed of 62 places in 292 ms
[2020-05-18 11:21:53] [INFO ] Deduced a trap composed of 59 places in 231 ms
[2020-05-18 11:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1077 ms
[2020-05-18 11:21:53] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 82 ms.
[2020-05-18 11:22:10] [INFO ] Added : 365 causal constraints over 73 iterations in 16620 ms. Result :unknown
[2020-05-18 11:22:10] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-05-18 11:22:10] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned unsat
[2020-05-18 11:22:10] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-18 11:22:10] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 68 ms returned unsat
[2020-05-18 11:22:10] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned unsat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 78 ms returned unsat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 54 ms returned unsat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-05-18 11:22:11] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 92 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-18 11:22:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 11:22:12] [INFO ] Flatten gal took : 370 ms
[2020-05-18 11:22:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 11:22:12] [INFO ] Flatten gal took : 161 ms
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 11:22:12] [INFO ] Applying decomposition
[2020-05-18 11:22:12] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2070475281607438234.txt, -o, /tmp/graph2070475281607438234.bin, -w, /tmp/graph2070475281607438234.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2070475281607438234.bin, -l, -1, -v, -w, /tmp/graph2070475281607438234.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 11:22:13] [INFO ] Decomposing Gal with order
[2020-05-18 11:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 11:22:13] [INFO ] Removed a total of 676 redundant transitions.
[2020-05-18 11:22:13] [INFO ] Flatten gal took : 340 ms
[2020-05-18 11:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 37 ms.
[2020-05-18 11:22:13] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 17 ms
[2020-05-18 11:22:13] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 11 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 85 ordering constraints for composite.
built 21 ordering constraints for composite.
built 55 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 67 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 55 ordering constraints for composite.
built 78 ordering constraints for composite.
built 53 ordering constraints for composite.
built 8 ordering constraints for composite.
built 56 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 39 ordering constraints for composite.
built 31 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-18 11:42:45] [INFO ] Applying decomposition
[2020-05-18 11:42:46] [INFO ] Flatten gal took : 899 ms
[2020-05-18 11:42:46] [INFO ] Decomposing Gal with order
[2020-05-18 11:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 11:42:46] [INFO ] Removed a total of 2681 redundant transitions.
[2020-05-18 11:42:47] [INFO ] Flatten gal took : 306 ms
[2020-05-18 11:42:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 68 ms.
[2020-05-18 11:42:47] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 52 ms
[2020-05-18 11:42:47] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 83 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 653 ordering constraints for composite.
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.54963e+08,308.269,3755412,183873,987,4.42646e+06,8198,1678,3.35503e+06,250,54446,0


Converting to forward existential form...Done !
original formula: E((((((((EG(((((((Threads4.P_1159_4>=3)||(Threads5.P_1159_5>=3))||(Threads2.P_1159_2>=3))||(Threads3.P_1159_3>=3))||(Threads0.P_1159_0>=3))||(Threads1.P_1159_1>=3))) + ((Threads1.ScheduleTaskB_1>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads2.ScheduleTaskB_2>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads0.ScheduleTaskB_0>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads4.ScheduleTaskB_4>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads5.ScheduleTaskB_5>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads3.ScheduleTaskB_3>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + (((((((((((((((((((((((((((((((((((((((((((D112.QueueJobB_12<1)||(P_1727.P_1727_0<1))&&((D117.QueueJobB_17<1)||(P_1727.P_1727_0<1)))&&((D17.QueueJobB_7<1)||(P_1727.P_1727_0<1)))&&((D122.QueueJobB_22<1)||(P_1727.P_1727_0<1)))&&((D136.QueueJobB_36<1)||(P_1727.P_1727_0<1)))&&((D12.QueueJobB_2<1)||(P_1727.P_1727_0<1)))&&((D137.QueueJobB_37<1)||(P_1727.P_1727_0<1)))&&((D126.QueueJobB_26<1)||(P_1727.P_1727_0<1)))&&((D132.QueueJobB_32<1)||(P_1727.P_1727_0<1)))&&((D141.QueueJobB_41<1)||(P_1727.P_1727_0<1)))&&((D113.QueueJobB_13<1)||(P_1727.P_1727_0<1)))&&((D111.QueueJobB_11<1)||(P_1727.P_1727_0<1)))&&((D11.QueueJobB_1<1)||(P_1727.P_1727_0<1)))&&((D123.QueueJobB_23<1)||(P_1727.P_1727_0<1)))&&((D140.QueueJobB_40<1)||(P_1727.P_1727_0<1)))&&((D16.QueueJobB_6<1)||(P_1727.P_1727_0<1)))&&((D135.QueueJobB_35<1)||(P_1727.P_1727_0<1)))&&((D118.QueueJobB_18<1)||(P_1727.P_1727_0<1)))&&((D131.QueueJobB_31<1)||(P_1727.P_1727_0<1)))&&((D114.QueueJobB_14<1)||(P_1727.P_1727_0<1)))&&((D127.QueueJobB_27<1)||(P_1727.P_1727_0<1)))&&((D110.QueueJobB_10<1)||(P_1727.P_1727_0<1)))&&((D134.QueueJobB_34<1)||(P_1727.P_1727_0<1)))&&((D139.QueueJobB_39<1)||(P_1727.P_1727_0<1)))&&((D124.QueueJobB_24<1)||(P_1727.P_1727_0<1)))&&((D15.QueueJobB_5<1)||(P_1727.P_1727_0<1)))&&((D10.QueueJobB_0<1)||(P_1727.P_1727_0<1)))&&((D119.QueueJobB_19<1)||(P_1727.P_1727_0<1)))&&((D19.QueueJobB_9<1)||(P_1727.P_1727_0<1)))&&((D120.QueueJobB_20<1)||(P_1727.P_1727_0<1)))&&((D115.QueueJobB_15<1)||(P_1727.P_1727_0<1)))&&((D130.QueueJobB_30<1)||(P_1727.P_1727_0<1)))&&((D128.QueueJobB_28<1)||(P_1727.P_1727_0<1)))&&((D133.QueueJobB_33<1)||(P_1727.P_1727_0<1)))&&((D116.QueueJobB_16<1)||(P_1727.P_1727_0<1)))&&((D138.QueueJobB_38<1)||(P_1727.P_1727_0<1)))&&((D13.QueueJobB_3<1)||(P_1727.P_1727_0<1)))&&((D121.QueueJobB_21<1)||(P_1727.P_1727_0<1)))&&((D14.QueueJobB_4<1)||(P_1727.P_1727_0<1)))&&((D125.QueueJobB_25<1)||(P_1727.P_1727_0<1)))&&((D18.QueueJobB_8<1)||(P_1727.P_1727_0<1)))&&((D129.QueueJobB_29<1)||(P_1727.P_1727_0<1)))) U A(((((((Threads4.NotifyEventEndOfCheckSourcesE_4>=1)||(Threads5.NotifyEventEndOfCheckSourcesE_5>=1))||(Threads2.NotifyEventEndOfCheckSourcesE_2>=1))||(Threads3.NotifyEventEndOfCheckSourcesE_3>=1))||(Threads0.NotifyEventEndOfCheckSourcesE_0>=1))||(Threads1.NotifyEventEndOfCheckSourcesE_1>=1)) U ((((((((SigAbort.SigAbort_0>=1)&&(Threads3.Check_Sources_B_3>=1))&&(ORB_Lock.ORB_Lock_0>=1))||(((SigAbort.SigAbort_0>=1)&&(Threads2.Check_Sources_B_2>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads1.Check_Sources_B_1>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads5.Check_Sources_B_5>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads0.Check_Sources_B_0>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads4.Check_Sources_B_4>=1))&&(ORB_Lock.ORB_Lock_0>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,(((((((EG(((((((Threads4.P_1159_4>=3)||(Threads5.P_1159_5>=3))||(Threads2.P_1159_2>=3))||(Threads3.P_1159_3>=3))||(Threads0.P_1159_0>=3))||(Threads1.P_1159_1>=3))) + ((Threads1.ScheduleTaskB_1>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads2.ScheduleTaskB_2>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads0.ScheduleTaskB_0>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads4.ScheduleTaskB_4>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads5.ScheduleTaskB_5>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + ((Threads3.ScheduleTaskB_3>=1)&&(IsMonitoring.IsMonitoring_0>=1))) + (((((((((((((((((((((((((((((((((((((((((((D112.QueueJobB_12<1)||(P_1727.P_1727_0<1))&&((D117.QueueJobB_17<1)||(P_1727.P_1727_0<1)))&&((D17.QueueJobB_7<1)||(P_1727.P_1727_0<1)))&&((D122.QueueJobB_22<1)||(P_1727.P_1727_0<1)))&&((D136.QueueJobB_36<1)||(P_1727.P_1727_0<1)))&&((D12.QueueJobB_2<1)||(P_1727.P_1727_0<1)))&&((D137.QueueJobB_37<1)||(P_1727.P_1727_0<1)))&&((D126.QueueJobB_26<1)||(P_1727.P_1727_0<1)))&&((D132.QueueJobB_32<1)||(P_1727.P_1727_0<1)))&&((D141.QueueJobB_41<1)||(P_1727.P_1727_0<1)))&&((D113.QueueJobB_13<1)||(P_1727.P_1727_0<1)))&&((D111.QueueJobB_11<1)||(P_1727.P_1727_0<1)))&&((D11.QueueJobB_1<1)||(P_1727.P_1727_0<1)))&&((D123.QueueJobB_23<1)||(P_1727.P_1727_0<1)))&&((D140.QueueJobB_40<1)||(P_1727.P_1727_0<1)))&&((D16.QueueJobB_6<1)||(P_1727.P_1727_0<1)))&&((D135.QueueJobB_35<1)||(P_1727.P_1727_0<1)))&&((D118.QueueJobB_18<1)||(P_1727.P_1727_0<1)))&&((D131.QueueJobB_31<1)||(P_1727.P_1727_0<1)))&&((D114.QueueJobB_14<1)||(P_1727.P_1727_0<1)))&&((D127.QueueJobB_27<1)||(P_1727.P_1727_0<1)))&&((D110.QueueJobB_10<1)||(P_1727.P_1727_0<1)))&&((D134.QueueJobB_34<1)||(P_1727.P_1727_0<1)))&&((D139.QueueJobB_39<1)||(P_1727.P_1727_0<1)))&&((D124.QueueJobB_24<1)||(P_1727.P_1727_0<1)))&&((D15.QueueJobB_5<1)||(P_1727.P_1727_0<1)))&&((D10.QueueJobB_0<1)||(P_1727.P_1727_0<1)))&&((D119.QueueJobB_19<1)||(P_1727.P_1727_0<1)))&&((D19.QueueJobB_9<1)||(P_1727.P_1727_0<1)))&&((D120.QueueJobB_20<1)||(P_1727.P_1727_0<1)))&&((D115.QueueJobB_15<1)||(P_1727.P_1727_0<1)))&&((D130.QueueJobB_30<1)||(P_1727.P_1727_0<1)))&&((D128.QueueJobB_28<1)||(P_1727.P_1727_0<1)))&&((D133.QueueJobB_33<1)||(P_1727.P_1727_0<1)))&&((D116.QueueJobB_16<1)||(P_1727.P_1727_0<1)))&&((D138.QueueJobB_38<1)||(P_1727.P_1727_0<1)))&&((D13.QueueJobB_3<1)||(P_1727.P_1727_0<1)))&&((D121.QueueJobB_21<1)||(P_1727.P_1727_0<1)))&&((D14.QueueJobB_4<1)||(P_1727.P_1727_0<1)))&&((D125.QueueJobB_25<1)||(P_1727.P_1727_0<1)))&&((D18.QueueJobB_8<1)||(P_1727.P_1727_0<1)))&&((D129.QueueJobB_29<1)||(P_1727.P_1727_0<1))))) * !(EG(!(((((((((SigAbort.SigAbort_0>=1)&&(Threads3.Check_Sources_B_3>=1))&&(ORB_Lock.ORB_Lock_0>=1))||(((SigAbort.SigAbort_0>=1)&&(Threads2.Check_Sources_B_2>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads1.Check_Sources_B_1>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads5.Check_Sources_B_5>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads0.Check_Sources_B_0>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads4.Check_Sources_B_4>=1))&&(ORB_Lock.ORB_Lock_0>=1))))))) * !(E(!(((((((((SigAbort.SigAbort_0>=1)&&(Threads3.Check_Sources_B_3>=1))&&(ORB_Lock.ORB_Lock_0>=1))||(((SigAbort.SigAbort_0>=1)&&(Threads2.Check_Sources_B_2>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads1.Check_Sources_B_1>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads5.Check_Sources_B_5>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads0.Check_Sources_B_0>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads4.Check_Sources_B_4>=1))&&(ORB_Lock.ORB_Lock_0>=1)))) U (!(((((((Threads4.NotifyEventEndOfCheckSourcesE_4>=1)||(Threads5.NotifyEventEndOfCheckSourcesE_5>=1))||(Threads2.NotifyEventEndOfCheckSourcesE_2>=1))||(Threads3.NotifyEventEndOfCheckSourcesE_3>=1))||(Threads0.NotifyEventEndOfCheckSourcesE_0>=1))||(Threads1.NotifyEventEndOfCheckSourcesE_1>=1))) * !(((((((((SigAbort.SigAbort_0>=1)&&(Threads3.Check_Sources_B_3>=1))&&(ORB_Lock.ORB_Lock_0>=1))||(((SigAbort.SigAbort_0>=1)&&(Threads2.Check_Sources_B_2>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads1.Check_Sources_B_1>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads5.Check_Sources_B_5>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads0.Check_Sources_B_0>=1))&&(ORB_Lock.ORB_Lock_0>=1)))||(((SigAbort.SigAbort_0>=1)&&(Threads4.Check_Sources_B_4>=1))&&(ORB_Lock.ORB_Lock_0>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions NOPDPs0t0, NOPDPs0t1, NOPDPs0t2, NOPDPs0t3, NOPDPs0t4, NOPDPs0t5, NOPDPs1t0, NOPDPs1t1, NOPDPs1t2, NOPDPs1t3, NOPDPs1t4, NOPDPs1t5, T_2285t20t1, T_2285t20t2, T_2285t20t3, T_2285t20t4, T_2285t20t5, T_2285t21t0, T_2285t21t2, T_2285t21t3, T_2285t21t4, T_2285t21t5, T_2285t22t0, T_2285t22t1, T_2285t22t3, T_2285t22t4, T_2285t22t5, T_2285t23t0, T_2285t23t1, T_2285t23t2, T_2285t23t4, T_2285t23t5, T_2285t24t0, T_2285t24t1, T_2285t24t2, T_2285t24t3, T_2285t24t5, T_2285t25t0, T_2285t25t1, T_2285t25t2, T_2285t25t3, T_2285t25t4, T_2283t0, T_2283t1, T_2283t2, T_2283t3, T_2283t4, T_2283t5, SetSigAbortt0, SetSigAbortt1, SetSigAbortt2, SetSigAbortt3, SetSigAbortt4, SetSigAbortt5, NopAbortt0, NopAbortt1, NopAbortt2, NopAbortt3, NopAbortt4, NopAbortt5, IsAbortt0, IsAbortt1, IsAbortt2, IsAbortt3, IsAbortt4, IsAbortt5, LeaveCSTCSt1, LeaveCSTCSt3, EnterCSTCSt4, T_1145t2, T_1145t4, T_1146t1, T_1148t0, T_1148t3, T_1148t5, T_1170t0, T_1170t1, T_1170t2, T_1170t3, T_1170t4, T_1170t5, GoIdlet0, LeaveIdlet3, EnterCSPWt0, EnterCSPWt1, EnterCSPWt2, EnterCSPWt5, LeaveCSPWt2, LeaveCSPWt4, LeaveCSPWt5, T_2578s0t0, T_2578s0t1, T_2578s0t2, T_2578s0t3, T_2578s0t4, T_2578s0t5, T_2578s1t0, T_2578s1t1, T_2578s1t2, T_2578s1t3, T_2578s1t4, T_2578s1t5, Threads0.T_2315t0, Threads0.DummyOR2t0, Threads0.DummyOR1t0, Threads1.T_2315t1, Threads1.DummyOR2t1, Threads1.DummyOR1t1, Threads2.T_2315t2, Threads2.DummyOR2t2, Threads2.DummyOR1t2, Threads3.T_2315t3, Threads3.DummyOR2t3, Threads3.DummyOR1t3, Threads4.T_2315t4, Threads4.DummyOR2t4, Threads4.DummyOR1t4, Threads5.T_2315t5, Threads5.DummyOR2t5, Threads5.DummyOR1t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :84/722/120/926
ITS-tools command line returned an error code 139
[2020-05-18 11:52:31] [INFO ] Flatten gal took : 123 ms
[2020-05-18 11:52:32] [INFO ] Input system was already deterministic with 968 transitions.
[2020-05-18 11:52:32] [INFO ] Transformed 536 places.
[2020-05-18 11:52:32] [INFO ] Transformed 968 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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
[2020-05-18 11:53:02] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 13 ms
[2020-05-18 11:53:02] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.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 15 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.54963e+08,801.949,15487556,2,637441,5,1.62963e+07,6,0,3184,1.75731e+07,0


Converting to forward existential form...Done !
original formula: E((((((((EG(((((((P_1159_4>=3)||(P_1159_5>=3))||(P_1159_2>=3))||(P_1159_3>=3))||(P_1159_0>=3))||(P_1159_1>=3))) + ((ScheduleTaskB_1>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_2>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_0>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_4>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_5>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_3>=1)&&(IsMonitoring_0>=1))) + (((((((((((((((((((((((((((((((((((((((((((QueueJobB_12<1)||(P_1727_0<1))&&((QueueJobB_17<1)||(P_1727_0<1)))&&((QueueJobB_7<1)||(P_1727_0<1)))&&((QueueJobB_22<1)||(P_1727_0<1)))&&((QueueJobB_36<1)||(P_1727_0<1)))&&((QueueJobB_2<1)||(P_1727_0<1)))&&((QueueJobB_37<1)||(P_1727_0<1)))&&((QueueJobB_26<1)||(P_1727_0<1)))&&((QueueJobB_32<1)||(P_1727_0<1)))&&((QueueJobB_41<1)||(P_1727_0<1)))&&((QueueJobB_13<1)||(P_1727_0<1)))&&((QueueJobB_11<1)||(P_1727_0<1)))&&((QueueJobB_1<1)||(P_1727_0<1)))&&((QueueJobB_23<1)||(P_1727_0<1)))&&((QueueJobB_40<1)||(P_1727_0<1)))&&((QueueJobB_6<1)||(P_1727_0<1)))&&((QueueJobB_35<1)||(P_1727_0<1)))&&((QueueJobB_18<1)||(P_1727_0<1)))&&((QueueJobB_31<1)||(P_1727_0<1)))&&((QueueJobB_14<1)||(P_1727_0<1)))&&((QueueJobB_27<1)||(P_1727_0<1)))&&((QueueJobB_10<1)||(P_1727_0<1)))&&((QueueJobB_34<1)||(P_1727_0<1)))&&((QueueJobB_39<1)||(P_1727_0<1)))&&((QueueJobB_24<1)||(P_1727_0<1)))&&((QueueJobB_5<1)||(P_1727_0<1)))&&((QueueJobB_0<1)||(P_1727_0<1)))&&((QueueJobB_19<1)||(P_1727_0<1)))&&((QueueJobB_9<1)||(P_1727_0<1)))&&((QueueJobB_20<1)||(P_1727_0<1)))&&((QueueJobB_15<1)||(P_1727_0<1)))&&((QueueJobB_30<1)||(P_1727_0<1)))&&((QueueJobB_28<1)||(P_1727_0<1)))&&((QueueJobB_33<1)||(P_1727_0<1)))&&((QueueJobB_16<1)||(P_1727_0<1)))&&((QueueJobB_38<1)||(P_1727_0<1)))&&((QueueJobB_3<1)||(P_1727_0<1)))&&((QueueJobB_21<1)||(P_1727_0<1)))&&((QueueJobB_4<1)||(P_1727_0<1)))&&((QueueJobB_25<1)||(P_1727_0<1)))&&((QueueJobB_8<1)||(P_1727_0<1)))&&((QueueJobB_29<1)||(P_1727_0<1)))) U A(((((((NotifyEventEndOfCheckSourcesE_4>=1)||(NotifyEventEndOfCheckSourcesE_5>=1))||(NotifyEventEndOfCheckSourcesE_2>=1))||(NotifyEventEndOfCheckSourcesE_3>=1))||(NotifyEventEndOfCheckSourcesE_0>=1))||(NotifyEventEndOfCheckSourcesE_1>=1)) U ((((((((SigAbort_0>=1)&&(Check_Sources_B_3>=1))&&(ORB_Lock_0>=1))||(((SigAbort_0>=1)&&(Check_Sources_B_2>=1))&&(ORB_Lock_0>=1)))||(((SigAbort_0>=1)&&(Check_Sources_B_1>=1))&&(ORB_Lock_0>=1)))||(((SigAbort_0>=1)&&(Check_Sources_B_5>=1))&&(ORB_Lock_0>=1)))||(((SigAbort_0>=1)&&(Check_Sources_B_0>=1))&&(ORB_Lock_0>=1)))||(((SigAbort_0>=1)&&(Check_Sources_B_4>=1))&&(ORB_Lock_0>=1)))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: [((FwdU(Init,(((((((EG(((((((P_1159_4>=3)||(P_1159_5>=3))||(P_1159_2>=3))||(P_1159_3>=3))||(P_1159_0>=3))||(P_1159_1>=3))) + ((ScheduleTaskB_1>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_2>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_0>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_4>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_5>=1)&&(IsMonitoring_0>=1))) + ((ScheduleTaskB_3>=1)&&(IsMonitoring_0>=1))) + (((((((((((((((((((((((((((((((((((((((((((QueueJobB_12<1)||(P_1727_0<1))&&((QueueJobB_17<1)||(P_1727_0<1)))&&((QueueJobB_7<1)||(P_1727_0<1)))&&((QueueJobB_22<1)||(P_1727_0<1)))&&((QueueJobB_36<1)||(P_1727_0<1)))&&((QueueJobB_2<1)||(P_1727_0<1)))&&((QueueJobB_37<1)||(P_1727_0<1)))&&((QueueJobB_26<1)||(P_1727_0<1)))&&((QueueJobB_32<1)||(P_1727_0<1)))&&((QueueJobB_41<1)||(P_1727_0<1)))&&((QueueJobB_13<1)||(P_1727_0<1)))&&((QueueJobB_11<1)||(P_1727_0<1)))&&((QueueJobB_1<1)||(P_1727_0<1)))&&((QueueJobB_23<1)||(P_1727_0<1)))&&((QueueJobB_40<1)||(P_1727_0<1)))&&((QueueJobB_6<1)||(P_1727_0<1)))&&((QueueJobB_35<1)||(P_1727_0<1)))&&((QueueJobB_18<1)||(P_1727_0<1)))&&((QueueJobB_31<1)||(P_1727_0<1)))&&((QueueJobB_14<1)||(P_1727_0<1)))&&((QueueJobB_27<1)||(P_1727_0<1)))&&((QueueJobB_10<1)||(P_1727_0<1)))&&((QueueJobB_34<1)||(P_1727_0<1)))&&((QueueJobB_39<1)||(P_1727_0<1)))&&((QueueJobB_24<1)||(P_1727_0<1)))&&((QueueJobB_5<1)||(P_1727_0<1)))&&((QueueJobB_0<1)||(P_1727_0<1)))&&((QueueJobB_19<1)||(P_1727_0<1)))&&((QueueJobB_9<1)||(P_1727_0<1)))&&((QueueJobB_20<1)||(P_1727_0<1)))&&((QueueJobB_15<1)||(P_1
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_STOP 1589804013895

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="PolyORBLF-COL-S02J06T06"
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"

# 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 PolyORBLF-COL-S02J06T06, 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 r126-tajo-158961390100292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 ;