fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897698700174
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15714.870 148226.00 328296.00 174.70 TTTFTFTFFTFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698700174.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V20P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698700174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:54 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 39K 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 BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589210940617

[2020-05-11 15:29:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-11 15:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 15:29:02] [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-11 15:29:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2020-05-11 15:29:03] [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,

[2020-05-11 15:29:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 46 ms.
[2020-05-11 15:29:03] [INFO ] Computed order based on color domains.
[2020-05-11 15:29:03] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions in 23 ms.
[2020-05-11 15:29:03] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0]
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-05-11 15:29:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 15:29:03] [INFO ] Computed 7 place invariants in 20 ms
[2020-05-11 15:29:03] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-05-11 15:29:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-11 15:29:04] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned unsat
[2020-05-11 15:29:04] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-05-11 15:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:04] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-11 15:29:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:29:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2020-05-11 15:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:04] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-11 15:29:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:29:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-11 15:29:04] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 28 ms.
[2020-05-11 15:29:05] [INFO ] Added : 118 causal constraints over 24 iterations in 1289 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-11 15:29:05] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-05-11 15:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:05] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-11 15:29:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:29:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 15:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-05-11 15:29:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2020-05-11 15:29:05] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-05-11 15:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-05-11 15:29:05] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 23 ms.
[2020-05-11 15:29:06] [INFO ] Added : 125 causal constraints over 25 iterations in 870 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-11 15:29:06] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 44400 steps, including 1103 resets, run finished after 154 ms. (steps per millisecond=288 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 333 resets, run finished after 29 ms. (steps per millisecond=513 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 79 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-05-11 15:29:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 15:29:07] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 15:29:08] [INFO ] Dead Transitions using invariants and state equation in 996 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5631 resets, run finished after 2232 ms. (steps per millisecond=448 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2044 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1939 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 17927752 steps, run timeout after 30001 ms. (steps per millisecond=597 ) properties seen :[0, 0]
Probabilistic random walk after 17927752 steps, saw 4025576 distinct states, run finished after 30003 ms. (steps per millisecond=597 ) properties seen :[0, 0]
[2020-05-11 15:29:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 15:29:41] [INFO ] Computed 7 place invariants in 8 ms
[2020-05-11 15:29:41] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned sat
[2020-05-11 15:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:42] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2020-05-11 15:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:29:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 77 ms returned sat
[2020-05-11 15:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:43] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2020-05-11 15:29:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:29:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 26 ms returned sat
[2020-05-11 15:29:43] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 26 ms.
[2020-05-11 15:29:44] [INFO ] Added : 118 causal constraints over 24 iterations in 1253 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-11 15:29:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 15:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-11 15:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:29:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 15:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:29:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-11 15:29:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2020-05-11 15:29:44] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-11 15:29:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-05-11 15:29:44] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 26 ms.
[2020-05-11 15:29:45] [INFO ] Added : 125 causal constraints over 25 iterations in 735 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
Incomplete Parikh walk after 44400 steps, including 1100 resets, run finished after 110 ms. (steps per millisecond=403 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 335 resets, run finished after 28 ms. (steps per millisecond=532 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 35 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-05-11 15:29:45] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 15:29:45] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-11 15:29:46] [INFO ] Implicit Places using invariants in 157 ms returned []
[2020-05-11 15:29:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 15:29:46] [INFO ] Computed 7 place invariants in 2 ms
[2020-05-11 15:29:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:29:46] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 463 ms to find 2 implicit places.
[2020-05-11 15:29:46] [INFO ] Redundant transitions in 25 ms returned []
[2020-05-11 15:29:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:29:46] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:29:46] [INFO ] Dead Transitions using invariants and state equation in 329 ms returned []
Starting structural reductions, iteration 1 : 66/68 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-05-11 15:29:46] [INFO ] Redundant transitions in 7 ms returned []
[2020-05-11 15:29:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:29:46] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:29:47] [INFO ] Dead Transitions using invariants and state equation in 492 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5631 resets, run finished after 1763 ms. (steps per millisecond=567 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2042 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1940 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 17262447 steps, run timeout after 30001 ms. (steps per millisecond=575 ) properties seen :[0, 0]
Probabilistic random walk after 17262447 steps, saw 3879219 distinct states, run finished after 30004 ms. (steps per millisecond=575 ) properties seen :[0, 0]
[2020-05-11 15:30:20] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:20] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:30:20] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-11 15:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:20] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-11 15:30:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 38 ms returned sat
[2020-05-11 15:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:20] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-11 15:30:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:30:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-11 15:30:20] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 22 ms.
[2020-05-11 15:30:21] [INFO ] Added : 117 causal constraints over 24 iterations in 769 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-11 15:30:21] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-11 15:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:21] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-05-11 15:30:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-11 15:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:21] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-05-11 15:30:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2020-05-11 15:30:21] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 18 ms.
[2020-05-11 15:30:22] [INFO ] Added : 123 causal constraints over 25 iterations in 1029 ms. Result :sat
[2020-05-11 15:30:22] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-11 15:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
Attempting to minimize the solution found.
Minimization took 50 ms.
Incomplete Parikh walk after 38800 steps, including 1013 resets, run finished after 191 ms. (steps per millisecond=203 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 22200 steps, including 784 resets, run finished after 77 ms. (steps per millisecond=288 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 25 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-05-11 15:30:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:23] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:30:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2020-05-11 15:30:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:23] [INFO ] Computed 5 place invariants in 4 ms
[2020-05-11 15:30:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:30:23] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2020-05-11 15:30:23] [INFO ] Redundant transitions in 3 ms returned []
[2020-05-11 15:30:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:23] [INFO ] Computed 5 place invariants in 0 ms
[2020-05-11 15:30:24] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[0, 0]
[2020-05-11 15:30:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:24] [INFO ] Computed 5 place invariants in 0 ms
[2020-05-11 15:30:24] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-11 15:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:24] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-11 15:30:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-11 15:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:24] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2020-05-11 15:30:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 15:30:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-11 15:30:24] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 19 ms.
[2020-05-11 15:30:25] [INFO ] Added : 117 causal constraints over 24 iterations in 671 ms. Result :sat
[2020-05-11 15:30:25] [INFO ] [Real]Absence check using 5 positive place invariants in 31 ms returned sat
[2020-05-11 15:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:25] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-05-11 15:30:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-11 15:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:25] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-11 15:30:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-05-11 15:30:25] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 17 ms.
[2020-05-11 15:30:26] [INFO ] Added : 123 causal constraints over 25 iterations in 718 ms. Result :sat
[2020-05-11 15:30:26] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-11 15:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 66 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 64 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 64 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 63 transition count 127
Applied a total of 424 rules in 15 ms. Remains 63 /66 variables (removed 3) and now considering 127/548 (removed 421) transitions.
// Phase 1: matrix 127 rows 63 cols
[2020-05-11 15:30:26] [INFO ] Computed 5 place invariants in 0 ms
[2020-05-11 15:30:26] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-11 15:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:26] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-11 15:30:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-11 15:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:26] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-11 15:30:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-11 15:30:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-05-11 15:30:26] [INFO ] Computed and/alt/rep : 124/1245/124 causal constraints in 5 ms.
[2020-05-11 15:30:27] [INFO ] Added : 110 causal constraints over 22 iterations in 500 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-11 15:30:27] [INFO ] [Real]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-11 15:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:27] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-05-11 15:30:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 15:30:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-11 15:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 15:30:27] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-05-11 15:30:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 67 ms returned sat
[2020-05-11 15:30:27] [INFO ] Computed and/alt/rep : 124/1245/124 causal constraints in 9 ms.
[2020-05-11 15:30:27] [INFO ] Added : 107 causal constraints over 22 iterations in 331 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-05-11 15:30:28] [INFO ] Flatten gal took : 95 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 15:30:28] [INFO ] Flatten gal took : 54 ms
[2020-05-11 15:30:28] [INFO ] Applying decomposition
[2020-05-11 15:30:28] [INFO ] Input system was already deterministic with 548 transitions.
[2020-05-11 15:30:28] [INFO ] Flatten gal took : 166 ms
[2020-05-11 15:30:28] [INFO ] Input system was already deterministic with 548 transitions.
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/graph5858980966682307933.txt, -o, /tmp/graph5858980966682307933.bin, -w, /tmp/graph5858980966682307933.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/graph5858980966682307933.bin, -l, -1, -v, -w, /tmp/graph5858980966682307933.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:28] [INFO ] Computed 5 place invariants in 1 ms
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 = 1
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : CAPACITE_0 + SUR_PONT_A_0 + SUR_PONT_B_0 = 20
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 = 1
inv : CONTROLEUR_0 + CONTROLEUR_1 + CHOIX_0 + CHOIX_1 + VIDANGE_0 + VIDANGE_1 = 1
Total of 5 invariants.
[2020-05-11 15:30:28] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:30:28] [INFO ] Decomposing Gal with order
[2020-05-11 15:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 15:30:28] [INFO ] Ran tautology test, simplified 0 / 2 in 573 ms.
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=0 took 39 ms
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=0 took 3 ms
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=1 took 8 ms
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=1 took 1 ms
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=2 took 33 ms
[2020-05-11 15:30:28] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=2 took 23 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 66 cols
[2020-05-11 15:30:29] [INFO ] Computed 5 place invariants in 1 ms
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 = 1
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : CAPACITE_0 + SUR_PONT_A_0 + SUR_PONT_B_0 = 20
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 = 1
inv : CONTROLEUR_0 + CONTROLEUR_1 + CHOIX_0 + CHOIX_1 + VIDANGE_0 + VIDANGE_1 = 1
Total of 5 invariants.
[2020-05-11 15:30:29] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 15:30:29] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=3 took 102 ms
[2020-05-11 15:30:29] [INFO ] Removed a total of 514 redundant transitions.
[2020-05-11 15:30:29] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=3 took 138 ms
[2020-05-11 15:30:29] [INFO ] Flatten gal took : 516 ms
[2020-05-11 15:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 28 ms.
[2020-05-11 15:30:29] [INFO ] Proved 66 variables to be positive in 703 ms
[2020-05-11 15:30:29] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2020-05-11 15:30:29] [INFO ] Computation of disable matrix completed :0/548 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 15:30:29] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=4 took 282 ms
[2020-05-11 15:30:29] [INFO ] Computation of Complete disable matrix. took 95 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 15:30:29] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 4 ms
[2020-05-11 15:30:29] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2020-05-11 15:30:29] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-11 15:30:29] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09 with value :(gi1.gu0.CAPACITE_0>=3)
Read [reachable] property : BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 with value :(((gi1.gu0.CAPACITE_0<3)&&(gi1.gu0.SUR_PONT_A_0<1))&&((gi1.gu0.SORTI_A_0>1)||(gu1.ROUTE_B_0>gu1.SORTI_B_0)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-11 15:30:29] [INFO ] Proved 66 variables to be positive in 965 ms
[2020-05-11 15:30:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:29] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=0 took 9 ms
[2020-05-11 15:30:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:29] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=0 took 9 ms
[2020-05-11 15:30:30] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=4 took 550 ms
SDD proceeding with computation, new max is 4096
[2020-05-11 15:30:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:30] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=1 took 62 ms
[2020-05-11 15:30:30] [INFO ] Computing symmetric co enabling matrix : 548 transitions.
SDD proceeding with computation, new max is 8192
[2020-05-11 15:30:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:30] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=1 took 555 ms
SDD proceeding with computation, new max is 16384
[2020-05-11 15:30:32] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=5 took 2066 ms
[2020-05-11 15:30:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:32] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=2 took 1401 ms
[2020-05-11 15:30:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:32] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=2 took 211 ms
SDD proceeding with computation, new max is 32768
[2020-05-11 15:30:33] [INFO ] Computation of co-enabling matrix(2/548) took 3325 ms. Total solver calls (SAT/UNSAT): 1437(244/1193)
[2020-05-11 15:30:34] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=5 took 2027 ms
[2020-05-11 15:30:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:34] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=3 took 2023 ms
[2020-05-11 15:30:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:34] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=3 took 289 ms
[2020-05-11 15:30:36] [INFO ] Computation of co-enabling matrix(23/548) took 6339 ms. Total solver calls (SAT/UNSAT): 10962(505/10457)
[2020-05-11 15:30:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:37] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=4 took 3037 ms
SDD proceeding with computation, new max is 65536
[2020-05-11 15:30:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:38] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=4 took 624 ms
[2020-05-11 15:30:38] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=6 took 4280 ms
[2020-05-11 15:30:39] [INFO ] Computation of co-enabling matrix(48/548) took 9356 ms. Total solver calls (SAT/UNSAT): 23044(814/22230)
[2020-05-11 15:30:42] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=6 took 4258 ms
[2020-05-11 15:30:42] [INFO ] Computation of co-enabling matrix(72/548) took 12416 ms. Total solver calls (SAT/UNSAT): 34006(1001/33005)
[2020-05-11 15:30:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:30:44] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=5 took 6204 ms
[2020-05-11 15:30:45] [INFO ] Computation of co-enabling matrix(101/548) took 15484 ms. Total solver calls (SAT/UNSAT): 47346(1001/46345)
[2020-05-11 15:30:48] [INFO ] Computation of co-enabling matrix(132/548) took 18521 ms. Total solver calls (SAT/UNSAT): 60676(1001/59675)
SDD proceeding with computation, new max is 131072
[2020-05-11 15:30:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:30:49] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=5 took 4992 ms
[2020-05-11 15:30:49] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=7 took 6852 ms
[2020-05-11 15:30:52] [INFO ] Computation of co-enabling matrix(157/548) took 21652 ms. Total solver calls (SAT/UNSAT): 70726(1001/69725)
[2020-05-11 15:30:55] [INFO ] Computation of co-enabling matrix(172/548) took 24672 ms. Total solver calls (SAT/UNSAT): 76456(1001/75455)
[2020-05-11 15:30:55] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=7 took 5733 ms
[2020-05-11 15:30:58] [INFO ] Computation of co-enabling matrix(186/548) took 27783 ms. Total solver calls (SAT/UNSAT): 81601(1001/80600)
[2020-05-11 15:31:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:31:00] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=6 took 10892 ms
[2020-05-11 15:31:02] [INFO ] Computation of co-enabling matrix(191/548) took 31961 ms. Total solver calls (SAT/UNSAT): 83391(1001/82390)
[2020-05-11 15:31:03] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=8 took 8081 ms
[2020-05-11 15:31:05] [INFO ] Computation of co-enabling matrix(195/548) took 35514 ms. Total solver calls (SAT/UNSAT): 84805(1001/83804)
[2020-05-11 15:31:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
[2020-05-11 15:31:06] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(SAT) depth K=6 took 5854 ms
[2020-05-11 15:31:09] [INFO ] Computation of co-enabling matrix(200/548) took 39432 ms. Total solver calls (SAT/UNSAT): 86550(1001/85549)
[2020-05-11 15:31:11] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10(UNSAT) depth K=8 took 8204 ms
[2020-05-11 15:31:13] [INFO ] Computation of co-enabling matrix(204/548) took 42882 ms. Total solver calls (SAT/UNSAT): 87928(1001/86927)
[2020-05-11 15:31:16] [INFO ] Computation of co-enabling matrix(208/548) took 46342 ms. Total solver calls (SAT/UNSAT): 89290(1001/88289)
[2020-05-11 15:31:20] [INFO ] BMC solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(UNSAT) depth K=9 took 8440 ms
[2020-05-11 15:31:20] [INFO ] Computation of co-enabling matrix(211/548) took 50018 ms. Total solver calls (SAT/UNSAT): 90301(1001/89300)
[2020-05-11 15:31:23] [INFO ] Computation of co-enabling matrix(215/548) took 53286 ms. Total solver calls (SAT/UNSAT): 91635(1001/90634)
[2020-05-11 15:31:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
[2020-05-11 15:31:25] [INFO ] KInduction solution for property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09(SAT) depth K=7 took 19326 ms
[2020-05-11 15:31:27] [INFO ] Computation of co-enabling matrix(220/548) took 56771 ms. Total solver calls (SAT/UNSAT): 93280(1001/92279)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,6.73257e+06,57.9732,893012,2,207712,26,3.30643e+06,8,0,635,2.97843e+06,0
Total reachable state count : 6732570

Verifying 2 reachability properties.
Invariant property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09 is true.
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09,0,58.1189,893012,1,0,26,3.30643e+06,8,0,636,2.97843e+06,0
Reachability property BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 does not hold.
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10,0,58.2976,893012,1,0,26,3.30643e+06,8,0,642,2.97843e+06,0
[2020-05-11 15:31:28] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 15:31:28] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 SMT depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-11 15:31:28] [INFO ] During BMC, SMT solver timed out at depth 9
[2020-05-11 15:31:28] [INFO ] BMC solving timed out (3600000 secs) at depth 9
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 15:31:28] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 K-induction depth 7
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-11 15:31:28] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
[2020-05-11 15:31:28] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 2) 1) (>= (select s0 25) 1)) (>= (select s0 50) 1)) (>= (select s0 55) 1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 15:31:28] [INFO ] Built C files in 60328ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589211088843

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

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

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