Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167600001.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 gold2020
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167600001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-COL-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620893333808

[2021-05-13 08:08:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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]
[2021-05-13 08:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:08:55] [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.
[2021-05-13 08:08:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2021-05-13 08:08:56] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2021-05-13 08:08:56] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 45 ms.
[2021-05-13 08:08:56] [INFO ] Computed order based on color domains.
[2021-05-13 08:08:56] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 8 ms.
[2021-05-13 08:08:56] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Incomplete random walk after 100000 steps, including 2299 resets, run finished after 1965 ms. (steps per millisecond=50 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0]
[2021-05-13 08:08:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-13 08:08:58] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 08:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-13 08:08:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 08:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 08:08:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 08:08:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:08:58] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2021-05-13 08:08:58] [INFO ] Deduced a trap composed of 9 places in 22 ms
[2021-05-13 08:08:58] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2021-05-13 08:08:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2021-05-13 08:08:58] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 9 ms.
[2021-05-13 08:08:58] [INFO ] Added : 28 causal constraints over 7 iterations in 53 ms. Result :sat
[2021-05-13 08:08:58] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 08:08:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 08:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 6 ms.
[2021-05-13 08:08:59] [INFO ] Added : 28 causal constraints over 6 iterations in 38 ms. Result :sat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2021-05-13 08:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2021-05-13 08:08:59] [INFO ] Added : 24 causal constraints over 5 iterations in 29 ms. Result :sat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 08:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2021-05-13 08:08:59] [INFO ] Added : 23 causal constraints over 5 iterations in 23 ms. Result :sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 7 places in 15 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[2021-05-13 08:08:59] [INFO ] Added : 28 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:08:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:08:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 7 places in 13 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-13 08:08:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 9 ms.
[2021-05-13 08:08:59] [INFO ] Added : 25 causal constraints over 5 iterations in 43 ms. Result :sat
[2021-05-13 08:08:59] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2021-05-13 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-13 08:09:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:09:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:09:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 54 atomic propositions for a total of 54 simplifications.
[2021-05-13 08:09:00] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 08:09:00] [INFO ] Flatten gal took : 24 ms
[2021-05-13 08:09:00] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 08:09:00] [INFO ] Flatten gal took : 10 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:09:00] [INFO ] Applying decomposition
[2021-05-13 08:09:00] [INFO ] Flatten gal took : 5 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/graph12195921874615078474.txt, -o, /tmp/graph12195921874615078474.bin, -w, /tmp/graph12195921874615078474.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/graph12195921874615078474.bin, -l, -1, -v, -w, /tmp/graph12195921874615078474.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 08:09:00] [INFO ] Decomposing Gal with order
[2021-05-13 08:09:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 08:09:00] [INFO ] Removed a total of 91 redundant transitions.
[2021-05-13 08:09:00] [INFO ] Flatten gal took : 34 ms
[2021-05-13 08:09:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2021-05-13 08:09:00] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 2 ms
[2021-05-13 08:09:00] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 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,2874,0.0313,5400,2,941,5,7157,6,0,163,4485,0


Converting to forward existential form...Done !
original formula: E(AF(((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.ATTENTE_A_0)<=(((((((((((((((((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu0.ROUTE_B_0)+gu2.SORTI_B_0)+gu2.ROUTE_A_0)+gu0.SORTI_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4))) U (EX((((((((((((((gu2.CAPACITE_0+gu0.SUR_PONT_A_0)+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A_0)+gu2.SORTI_B_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu2.CAPACITE_0)+gu0.SORTI_A_0))) * A(((((((((((((((((((gu0.SUR_PONT_A_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.SORTI_B_0)+gu1.ATTENTE_A_0)>1)&&(((((((((((((((gu1.SUR_PONT_B_0+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)>2)) U AG(((((((((((((((((((gu0.ROUTE_B_0+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))))))
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.ATTENTE_A_0)<=(((((((((((((((((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu0.ROUTE_B_0)+gu2.SORTI_B_0)+gu2.ROUTE_A_0)+gu0.SORTI_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)))))) * EX((((((((((((((gu2.CAPACITE_0+gu0.SUR_PONT_A_0)+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A_0)+gu2.SORTI_B_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu2.CAPACITE_0)+gu0.SORTI_A_0)))) * !(EG(!(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B_0+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))))))))) * !(E(!(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B_0+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)))))) U (!(((((((((((((((((((gu0.SUR_PONT_A_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.SORTI_B_0)+gu1.ATTENTE_A_0)>1)&&(((((((((((((((gu1.SUR_PONT_B_0+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)>2))) * !(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B_0+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions enregistrement_AcA0, liberation_A, basculements0, basculements1, liberation_B, enregistrement_BcB4, altern_cpts0cpt2, altern_cpts1cpt2, timeout_As0cpt0cA0cB4, timeout_As0cpt2cA0cB4, timeout_Bs1cpt0cA4cB0, timeout_Bs1cpt2cA4cB0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/12/15
(forward)formula 0,0,0.600082,30676,1,0,224,145070,56,80,3751,120346,244
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 1,1,0.611129,31204,1,0,224,146833,57,81,3770,122587,246
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(EF((A(((gu0.ROUTE_B_0+gu1.SUR_PONT_B_0)<=((((((((((((((gu0.SUR_PONT_A_0+gu1.SUR_PONT_B_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CHOIX_0)+gu1.CHOIX_1)) U ((((((((gu2.ATTENTE_B_0+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.ATTENTE_A_0)<=(((((((((((((gu2.CAPACITE_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.SORTI_B_0)+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))) + !(EG(((((gu2.ROUTE_A_0+gu2.ATTENTE_B_0)+gu0.SUR_PONT_A_0)+gu1.ATTENTE_A_0)<=(((((gu2.ROUTE_A_0+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B_0)+gu2.CAPACITE_0))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!((E(!(((((((((gu2.ATTENTE_B_0+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.ATTENTE_A_0)<=(((((((((((((gu2.CAPACITE_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.SORTI_B_0)+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))) U (!(((gu0.ROUTE_B_0+gu1.SUR_PONT_B_0)<=((((((((((((((gu0.SUR_PONT_A_0+gu1.SUR_PONT_B_0)+gu0.SORTI_A_0)+gu2.ROUTE_A_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CHOIX_0)+gu1.CHOIX_1))) * !(((((((((gu2.ATTENTE_B_0+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.ATTENTE_A_0)<=(((((((((((((gu2.CAPACITE_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.SORTI_B_0)+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1))))) + EG(!(((((((((gu2.ATTENTE_B_0+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.ATTENTE_A_0)<=(((((((((((((gu2.CAPACITE_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.SUR_PONT_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.SORTI_B_0)+gu2.ATTENTE_B_0)+gu0.SORTI_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)))))) + !(EG(((((gu2.ROUTE_A_0+gu2.ATTENTE_B_0)+gu0.SUR_PONT_A_0)+gu1.ATTENTE_A_0)<=(((((gu2.ROUTE_A_0+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B_0)+gu2.CAPACITE_0))))))))] != FALSE
(forward)formula 2,0,1.08029,44932,1,0,452,225087,70,209,5076,215293,501
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AG(AX(EF(((gu1.SUR_PONT_B_0+gu1.ATTENTE_A_0)>((((((((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EX(!(E(TRUE U ((gu1.SUR_PONT_B_0+gu1.ATTENTE_A_0)>((((((((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu2.CAPACITE_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0))))))))))] != FALSE
(forward)formula 3,0,1.13977,47824,1,0,526,238060,74,250,5400,228894,597
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AG(AF((((((((((((((((((gu0.SORTI_A_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.ATTENTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)>=41)||(((gu0.SORTI_A_0+gu1.CHOIX_0)+gu1.CHOIX_1)<=((gu2.CAPACITE_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)))||((((((((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu0.SUR_PONT_A_0)+gu2.CAPACITE_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=5)&&(((((((((((((gu2.SORTI_B_0+gu0.SORTI_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu0.SUR_PONT_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)<=16))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!((((((((((((((((((gu0.SORTI_A_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.ATTENTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)>=41)||(((gu0.SORTI_A_0+gu1.CHOIX_0)+gu1.CHOIX_1)<=((gu2.CAPACITE_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)))||((((((((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu0.SUR_PONT_A_0)+gu2.CAPACITE_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=5)&&(((((((((((((gu2.SORTI_B_0+gu0.SORTI_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B_0)+gu0.ROUTE_B_0)+gu0.SUR_PONT_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)<=16))))))))))] != FALSE
(forward)formula 4,1,1.15339,48088,1,0,528,238132,79,252,5705,228953,599
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AG(!(AX(FALSE))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(!(EX(!(FALSE))))))) * EX(TRUE)))] != FALSE
dead was empty
(forward)formula 5,0,1.15408,48088,1,0,529,238273,79,253,5705,229198,601
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(AF(AG(((((((((((((((((gu2.ATTENTE_B_0+gu2.ROUTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)<=(((((gu0.SUR_PONT_A_0+gu0.SORTI_A_0)+gu0.ROUTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)))) U AX(EG(AX(FALSE))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EG(!(EX(!(FALSE))))))))))) * !(E(!(!(EX(!(EG(!(EX(!(FALSE)))))))) U (!(!(EG(!(!(E(TRUE U !(((((((((((((((((gu2.ATTENTE_B_0+gu2.ROUTE_A_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.ATTENTE_A_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)<=(((((gu0.SUR_PONT_A_0+gu0.SORTI_A_0)+gu0.ROUTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2))))))))) * !(!(EX(!(EG(!(EX(!(FALSE))))))))))))] != FALSE
(forward)formula 6,0,1.22747,50728,1,0,548,251496,87,272,6496,242021,632
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(EF(EX((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.SORTI_A_0)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)>(((((((((((((((((gu2.ROUTE_A_0+gu1.ATTENTE_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu0.SUR_PONT_A_0)+gu0.ROUTE_B_0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EX((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.SORTI_A_0)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)>(((((((((((((((((gu2.ROUTE_A_0+gu1.ATTENTE_A_0)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu2.SORTI_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu0.SUR_PONT_A_0)+gu0.ROUTE_B_0))))))] != FALSE
(forward)formula 7,0,1.39315,55088,1,0,634,264849,88,318,10353,256283,742
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(TRUE))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),TRUE)] != FALSE
(forward)formula 8,1,1.39329,55088,1,0,634,264849,88,318,10353,256283,744
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EF(!(EX(TRUE)))) + !(AF(!(EX((((((((((gu0.VIDANGE_0+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.ROUTE_B_0)+gu1.SUR_PONT_B_0)+gu2.CAPACITE_0)+gu2.ATTENTE_B_0)+gu1.ATTENTE_A_0)<=13))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!(EG(!(!(EX((((((((((gu0.VIDANGE_0+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.ROUTE_B_0)+gu1.SUR_PONT_B_0)+gu2.CAPACITE_0)+gu2.ATTENTE_B_0)+gu1.ATTENTE_A_0)<=13))))))))),TRUE) * !(EX(TRUE)))] = FALSE
(forward)formula 9,0,1.40596,55352,1,0,638,265449,92,321,10610,256872,749
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EF(AX((((((((gu2.ROUTE_A_0+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B_0)<=5)&&((((((((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu2.ROUTE_A_0)+gu2.SORTI_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.ATTENTE_B_0)<=16)))) U EG((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)<=((((((((((((gu2.SORTI_B_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.ATTENTE_A_0)+gu2.CAPACITE_0)+gu0.ROUTE_B_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)) * AG(((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.SORTI_A_0)<=((((((((((gu2.ATTENTE_B_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)<=((((((((((((gu2.SORTI_B_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.ATTENTE_A_0)+gu2.CAPACITE_0)+gu0.ROUTE_B_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)) * !(E(TRUE U !(((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.SORTI_A_0)<=((((((((((gu2.ATTENTE_B_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4))))))))))) * !(E(!(EG((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)<=((((((((((((gu2.SORTI_B_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.ATTENTE_A_0)+gu2.CAPACITE_0)+gu0.ROUTE_B_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)) * !(E(TRUE U !(((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.SORTI_A_0)<=((((((((((gu2.ATTENTE_B_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)))))))) U (!(E(TRUE U !(EX(!((((((((gu2.ROUTE_A_0+gu2.ATTENTE_B_0)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B_0)<=5)&&((((((((((((gu1.CHOIX_0+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu2.ROUTE_A_0)+gu2.SORTI_B_0)+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu2.ATTENTE_B_0)<=16))))))) * !(EG((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu1.SUR_PONT_B_0)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)<=((((((((((((gu2.SORTI_B_0+gu1.CHOIX_0)+gu1.CHOIX_1)+gu1.ATTENTE_A_0)+gu2.CAPACITE_0)+gu0.ROUTE_B_0)+gu1.CONTROLEUR_0)+gu1.CONTROLEUR_1)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)) * !(E(TRUE U !(((((((((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.SORTI_A_0)<=((((((((((gu2.ATTENTE_B_0+gu0.VIDANGE_0)+gu0.VIDANGE_1)+gu1.CHOIX_0)+gu1.CHOIX_1)+gu0.SUR_PONT_A_0)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4))))))))))))] != FALSE
(forward)formula 10,0,1.65534,65896,1,0,697,321232,100,352,11340,312464,825
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620893342295

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167600001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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