Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 PolyORBNT-COL-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S05J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621211222600

Running Version 0
[2021-05-17 00:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 00:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:27:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 00:27:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 00:27:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 694 ms
[2021-05-17 00:27:07] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 00:27:07] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 00:27:07] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 00:27:07] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 00:27:07] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 00:27:07] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 00:27:07] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 00:27:07] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 16 ms.
[2021-05-17 00:27:07] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_13288619349241209725.dot
Incomplete random walk after 100004 steps, including 7988 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 16) seen :3
Running SMT prover for 13 properties.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:27:07] [INFO ] Computed 13 place invariants in 6 ms
[2021-05-17 00:27:07] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2021-05-17 00:27:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 00:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:07] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-17 00:27:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 64 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 53 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:08] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-17 00:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:27:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:27:08] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2021-05-17 00:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2021-05-17 00:27:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:27:08] [INFO ] Added : 20 causal constraints over 4 iterations in 131 ms. Result :sat
[2021-05-17 00:27:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 00:27:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 44 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:08] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-17 00:27:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-17 00:27:08] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2021-05-17 00:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2021-05-17 00:27:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 00:27:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2021-05-17 00:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-17 00:27:09] [INFO ] Added : 33 causal constraints over 7 iterations in 348 ms. Result :sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 00:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:09] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:27:09] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 29 ms to minimize.
[2021-05-17 00:27:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
[2021-05-17 00:27:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2021-05-17 00:27:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 00:27:09] [INFO ] Added : 33 causal constraints over 7 iterations in 45 ms. Result :sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-17 00:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-17 00:27:09] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned unsat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:27:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:10] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:27:10] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2021-05-17 00:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-17 00:27:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 00:27:10] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2021-05-17 00:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-17 00:27:10] [INFO ] Added : 36 causal constraints over 8 iterations in 111 ms. Result :sat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned unsat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:27:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 00:27:10] [INFO ] Flatten gal took : 51 ms
[2021-05-17 00:27:10] [INFO ] Flatten gal took : 23 ms
[2021-05-17 00:27:10] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 40 ms.
[2021-05-17 00:27:10] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8249138391444087171.dot
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :5
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-17 00:27:10] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-17 00:27:10] [INFO ] Computed 62 place invariants in 44 ms
[2021-05-17 00:27:11] [INFO ] [Real]Absence check using 55 positive place invariants in 58 ms returned sat
[2021-05-17 00:27:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 00:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:11] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2021-05-17 00:27:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:27:11] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 00:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:12] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2021-05-17 00:27:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:27:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2021-05-17 00:27:12] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 93 ms.
[2021-05-17 00:27:12] [INFO ] Deduced a trap composed of 109 places in 265 ms of which 1 ms to minimize.
[2021-05-17 00:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2021-05-17 00:27:12] [INFO ] Added : 17 causal constraints over 4 iterations in 750 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-17 00:27:13] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-17 00:27:13] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:13] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2021-05-17 00:27:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:27:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-17 00:27:13] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-17 00:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:27:13] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-17 00:27:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:27:14] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 69 ms.
[2021-05-17 00:27:14] [INFO ] Added : 34 causal constraints over 7 iterations in 430 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 3900 steps, including 220 resets, run finished after 15 ms. (steps per millisecond=260 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13100 steps, including 834 resets, run finished after 57 ms. (steps per millisecond=229 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 91 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 344 transition count 552
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 341 transition count 552
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 341 transition count 549
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 338 transition count 549
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 2 with 4 rules applied. Total rules applied 21 place count 336 transition count 547
Applied a total of 21 rules in 112 ms. Remains 336 /349 variables (removed 13) and now considering 547/555 (removed 8) transitions.
[2021-05-17 00:27:14] [INFO ] Flow matrix only has 543 transitions (discarded 4 similar events)
// Phase 1: matrix 543 rows 336 cols
[2021-05-17 00:27:14] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-17 00:27:15] [INFO ] Dead Transitions using invariants and state equation in 500 ms returned [416, 417, 418, 419, 421, 424, 428, 433, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 480, 481, 482, 483, 484, 486, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 515, 516, 517, 518, 519, 521, 524, 525, 526, 527, 528, 529, 531, 534, 538, 539, 540]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[540, 539, 538, 534, 531, 529, 528, 527, 526, 525, 524, 521, 519, 518, 517, 516, 515, 513, 512, 511, 510, 509, 508, 507, 506, 505, 504, 503, 502, 501, 500, 499, 498, 497, 496, 495, 494, 493, 492, 491, 490, 489, 486, 484, 483, 482, 481, 480, 478, 477, 476, 475, 474, 473, 472, 471, 470, 469, 468, 467, 466, 465, 464, 463, 462, 461, 460, 458, 457, 456, 455, 454, 453, 452, 451, 450, 449, 448, 447, 446, 445, 444, 443, 442, 441, 440, 439, 433, 428, 424, 421, 419, 418, 417, 416]
Starting structural reductions, iteration 1 : 336/349 places, 452/555 transitions.
Applied a total of 0 rules in 49 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 336/349 places, 452/555 transitions.
[2021-05-17 00:27:15] [INFO ] Flatten gal took : 67 ms
[2021-05-17 00:27:15] [INFO ] Flatten gal took : 105 ms
[2021-05-17 00:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15664421444896554682.gal : 41 ms
[2021-05-17 00:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8297491833745729749.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15664421444896554682.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8297491833745729749.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15664421444896554682.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8297491833745729749.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8297491833745729749.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 32
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32 after 43
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :43 after 66
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :66 after 232
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :232 after 574
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :574 after 1338
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1338 after 5214
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5214 after 22500
Detected timeout of ITS tools.
[2021-05-17 00:27:30] [INFO ] Flatten gal took : 34 ms
[2021-05-17 00:27:30] [INFO ] Applying decomposition
[2021-05-17 00:27:30] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12207542972251028899.txt, -o, /tmp/graph12207542972251028899.bin, -w, /tmp/graph12207542972251028899.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12207542972251028899.bin, -l, -1, -v, -w, /tmp/graph12207542972251028899.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:27:30] [INFO ] Decomposing Gal with order
[2021-05-17 00:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:27:31] [INFO ] Removed a total of 574 redundant transitions.
[2021-05-17 00:27:31] [INFO ] Flatten gal took : 206 ms
[2021-05-17 00:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 17 ms.
[2021-05-17 00:27:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11006961528536775109.gal : 13 ms
[2021-05-17 00:27:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1600067447897877399.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11006961528536775109.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1600067447897877399.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11006961528536775109.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1600067447897877399.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1600067447897877399.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 23
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :23 after 28
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :37 after 62
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :62 after 161
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :161 after 436
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :436 after 784
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :784 after 2022
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2022 after 9769
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :9769 after 36727
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :36727 after 323230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10345460696515347386
[2021-05-17 00:27:46] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10345460696515347386
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10345460696515347386]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10345460696515347386] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10345460696515347386] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 74503 resets, run finished after 2359 ms. (steps per millisecond=423 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 26210 resets, run finished after 1223 ms. (steps per millisecond=817 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14731 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 11047605 steps, run timeout after 30001 ms. (steps per millisecond=368 ) properties seen :{}
Probabilistic random walk after 11047605 steps, saw 3063085 distinct states, run finished after 30008 ms. (steps per millisecond=368 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-17 00:28:22] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:28:22] [INFO ] Computed 57 place invariants in 29 ms
[2021-05-17 00:28:22] [INFO ] [Real]Absence check using 51 positive place invariants in 11 ms returned sat
[2021-05-17 00:28:22] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 00:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:28:22] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-17 00:28:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:28:22] [INFO ] [Nat]Absence check using 51 positive place invariants in 17 ms returned sat
[2021-05-17 00:28:22] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-17 00:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:28:22] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2021-05-17 00:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:28:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 0 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 10 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 1 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 135 places in 83 ms of which 0 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 135 places in 91 ms of which 0 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 1 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 0 ms to minimize.
[2021-05-17 00:28:23] [INFO ] Deduced a trap composed of 135 places in 95 ms of which 1 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 1 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 0 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 150 places in 92 ms of which 0 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 138 places in 103 ms of which 0 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 1 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 1 ms to minimize.
[2021-05-17 00:28:24] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 0 ms to minimize.
[2021-05-17 00:28:25] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2021-05-17 00:28:25] [INFO ] Deduced a trap composed of 145 places in 102 ms of which 1 ms to minimize.
[2021-05-17 00:28:25] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 1 ms to minimize.
[2021-05-17 00:28:25] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 0 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 141 places in 76 ms of which 1 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 1 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 1 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 132 places in 83 ms of which 1 ms to minimize.
[2021-05-17 00:28:26] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 0 ms to minimize.
[2021-05-17 00:28:27] [INFO ] Deduced a trap composed of 133 places in 197 ms of which 0 ms to minimize.
[2021-05-17 00:28:28] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
[2021-05-17 00:28:28] [INFO ] Deduced a trap composed of 135 places in 91 ms of which 0 ms to minimize.
[2021-05-17 00:29:07] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2021-05-17 00:29:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-17 00:29:07] [INFO ] [Real]Absence check using 51 positive place invariants in 13 ms returned sat
[2021-05-17 00:29:07] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-17 00:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:07] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-17 00:29:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:29:08] [INFO ] [Nat]Absence check using 51 positive place invariants in 10 ms returned sat
[2021-05-17 00:29:08] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:08] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-17 00:29:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:29:08] [INFO ] Computed and/alt/rep : 246/573/246 causal constraints (skipped 196 transitions) in 24 ms.
[2021-05-17 00:29:09] [INFO ] Added : 27 causal constraints over 6 iterations in 1531 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 10500 steps, including 919 resets, run finished after 38 ms. (steps per millisecond=276 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 91 out of 336 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 336/336 places, 452/452 transitions.
Applied a total of 0 rules in 11 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 452/452 transitions.
Starting structural reductions, iteration 0 : 336/336 places, 452/452 transitions.
Applied a total of 0 rules in 10 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2021-05-17 00:29:09] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:29:09] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-17 00:29:10] [INFO ] Implicit Places using invariants in 264 ms returned []
[2021-05-17 00:29:10] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:29:10] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-17 00:29:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:29:10] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2021-05-17 00:29:10] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-17 00:29:10] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:29:10] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-17 00:29:11] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 452/452 transitions.
Incomplete random walk after 100000 steps, including 7460 resets, run finished after 216 ms. (steps per millisecond=462 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-17 00:29:11] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:29:11] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-17 00:29:11] [INFO ] [Real]Absence check using 51 positive place invariants in 13 ms returned sat
[2021-05-17 00:29:11] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 00:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:11] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-17 00:29:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:29:11] [INFO ] [Nat]Absence check using 51 positive place invariants in 10 ms returned sat
[2021-05-17 00:29:11] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 00:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:11] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-17 00:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:29:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2021-05-17 00:29:11] [INFO ] Deduced a trap composed of 138 places in 71 ms of which 0 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 144 places in 97 ms of which 1 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 1 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 135 places in 81 ms of which 0 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 1 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 1 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 135 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:29:12] [INFO ] Deduced a trap composed of 138 places in 82 ms of which 1 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 150 places in 94 ms of which 1 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 138 places in 101 ms of which 0 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 144 places in 95 ms of which 0 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 129 places in 102 ms of which 0 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 135 places in 79 ms of which 0 ms to minimize.
[2021-05-17 00:29:13] [INFO ] Deduced a trap composed of 138 places in 78 ms of which 0 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 145 places in 87 ms of which 1 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 138 places in 77 ms of which 0 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 129 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 1 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 141 places in 65 ms of which 0 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 132 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:29:14] [INFO ] Deduced a trap composed of 136 places in 100 ms of which 4 ms to minimize.
[2021-05-17 00:29:15] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 0 ms to minimize.
[2021-05-17 00:29:15] [INFO ] Deduced a trap composed of 135 places in 306 ms of which 0 ms to minimize.
[2021-05-17 00:29:16] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 2 ms to minimize.
[2021-05-17 00:29:16] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 19 ms to minimize.
[2021-05-17 00:29:17] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 1 ms to minimize.
[2021-05-17 00:29:31] [INFO ] Deduced a trap composed of 2 places in 213 ms of which 1 ms to minimize.
[2021-05-17 00:29:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-17 00:29:31] [INFO ] [Real]Absence check using 51 positive place invariants in 10 ms returned sat
[2021-05-17 00:29:31] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:31] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-17 00:29:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:29:31] [INFO ] [Nat]Absence check using 51 positive place invariants in 17 ms returned sat
[2021-05-17 00:29:32] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:29:32] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2021-05-17 00:29:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:29:32] [INFO ] Computed and/alt/rep : 246/573/246 causal constraints (skipped 196 transitions) in 20 ms.
[2021-05-17 00:29:33] [INFO ] Added : 27 causal constraints over 6 iterations in 1549 ms. Result :sat
[2021-05-17 00:29:33] [INFO ] Flatten gal took : 32 ms
[2021-05-17 00:29:33] [INFO ] Flatten gal took : 49 ms
[2021-05-17 00:29:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10058187431491042112.gal : 18 ms
[2021-05-17 00:29:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6233787768592685303.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10058187431491042112.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6233787768592685303.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10058187431491042112.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6233787768592685303.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6233787768592685303.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 32
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32 after 43
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :43 after 66
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :66 after 232
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :232 after 574
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :574 after 1338
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1338 after 5214
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5214 after 22500
Detected timeout of ITS tools.
[2021-05-17 00:29:49] [INFO ] Flatten gal took : 52 ms
[2021-05-17 00:29:49] [INFO ] Applying decomposition
[2021-05-17 00:29:49] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16886969349001620991.txt, -o, /tmp/graph16886969349001620991.bin, -w, /tmp/graph16886969349001620991.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16886969349001620991.bin, -l, -1, -v, -w, /tmp/graph16886969349001620991.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:29:49] [INFO ] Decomposing Gal with order
[2021-05-17 00:29:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:29:49] [INFO ] Removed a total of 592 redundant transitions.
[2021-05-17 00:29:49] [INFO ] Flatten gal took : 92 ms
[2021-05-17 00:29:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 24 ms.
[2021-05-17 00:29:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13431380294090403881.gal : 3 ms
[2021-05-17 00:29:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16976801430830454841.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13431380294090403881.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16976801430830454841.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13431380294090403881.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16976801430830454841.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16976801430830454841.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 47
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :47 after 60
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60 after 82
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :82 after 134
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :134 after 1097
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1097 after 1415
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1415 after 2653
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2653 after 25827
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :25827 after 35579
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :35579 after 94762
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6411220850607913831
[2021-05-17 00:30:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6411220850607913831
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6411220850607913831]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6411220850607913831] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6411220850607913831] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 336 transition count 448
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 336 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 335 transition count 447
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 335 transition count 442
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 16 place count 330 transition count 442
Applied a total of 16 rules in 34 ms. Remains 330 /336 variables (removed 6) and now considering 442/452 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 442 rows 330 cols
[2021-05-17 00:30:05] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-17 00:30:05] [INFO ] [Real]Absence check using 51 positive place invariants in 9 ms returned sat
[2021-05-17 00:30:05] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 00:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:05] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-17 00:30:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:30:05] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2021-05-17 00:30:05] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:05] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 134 places in 59 ms of which 1 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 149 places in 83 ms of which 1 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 131 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 134 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 131 places in 63 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 128 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 137 places in 80 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 137 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 12 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 134 places in 89 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 131 places in 75 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 128 places in 96 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 137 places in 101 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 134 places in 77 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 143 places in 75 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 134 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 134 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 134 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 134 places in 79 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 1 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 122 places in 76 ms of which 1 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 134 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 0 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 134 places in 323 ms of which 1 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 137 places in 82 ms of which 0 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 68 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 137 places in 65 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 65 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 0 ms to minimize.
[2021-05-17 00:30:11] [INFO ] Deduced a trap composed of 143 places in 64 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 128 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 1 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 140 places in 93 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 131 places in 93 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 0 ms to minimize.
[2021-05-17 00:30:12] [INFO ] Deduced a trap composed of 134 places in 80 ms of which 0 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 0 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 143 places in 77 ms of which 1 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:30:13] [INFO ] Deduced a trap composed of 134 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:14] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 1 ms to minimize.
[2021-05-17 00:30:14] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 1 ms to minimize.
[2021-05-17 00:30:14] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2021-05-17 00:30:14] [INFO ] Deduced a trap composed of 125 places in 86 ms of which 0 ms to minimize.
[2021-05-17 00:30:14] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2021-05-17 00:30:16] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2021-05-17 00:30:50] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 0 ms to minimize.
[2021-05-17 00:30:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-17 00:30:50] [INFO ] [Real]Absence check using 51 positive place invariants in 9 ms returned sat
[2021-05-17 00:30:50] [INFO ] [Real]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:50] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-17 00:30:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:30:50] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2021-05-17 00:30:51] [INFO ] [Nat]Absence check using 51 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 00:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:51] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-17 00:30:51] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2021-05-17 00:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2021-05-17 00:30:51] [INFO ] Computed and/alt/rep : 246/498/246 causal constraints (skipped 195 transitions) in 23 ms.
[2021-05-17 00:30:51] [INFO ] Added : 26 causal constraints over 6 iterations in 664 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-17 00:30:51] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17856878943402545609
[2021-05-17 00:30:52] [INFO ] Applying decomposition
[2021-05-17 00:30:52] [INFO ] Flatten gal took : 38 ms
[2021-05-17 00:30:52] [INFO ] Computing symmetric may disable matrix : 452 transitions.
[2021-05-17 00:30:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:30:52] [INFO ] Computing symmetric may enable matrix : 452 transitions.
[2021-05-17 00:30:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:30:52] [INFO ] Flatten gal took : 130 ms
[2021-05-17 00:30:52] [INFO ] Input system was already deterministic with 452 transitions.
[2021-05-17 00:30:52] [INFO ] Computing Do-Not-Accords matrix : 452 transitions.
[2021-05-17 00:30:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:30:52] [INFO ] Built C files in 321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17856878943402545609
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17856878943402545609]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14437595569015176354.txt, -o, /tmp/graph14437595569015176354.bin, -w, /tmp/graph14437595569015176354.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14437595569015176354.bin, -l, -1, -v, -w, /tmp/graph14437595569015176354.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:30:52] [INFO ] Decomposing Gal with order
[2021-05-17 00:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:30:52] [INFO ] Removed a total of 581 redundant transitions.
[2021-05-17 00:30:52] [INFO ] Flatten gal took : 134 ms
[2021-05-17 00:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 26 ms.
[2021-05-17 00:30:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality928056752107560866.gal : 3 ms
[2021-05-17 00:30:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12295466638196683019.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality928056752107560866.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12295466638196683019.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality928056752107560866.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12295466638196683019.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12295466638196683019.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :43 after 137
[2021-05-17 00:30:53] [INFO ] Ran tautology test, simplified 0 / 2 in 1232 ms.
[2021-05-17 00:30:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(UNSAT) depth K=0 took 26 ms
[2021-05-17 00:30:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=0 took 19 ms
[2021-05-17 00:30:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(UNSAT) depth K=1 took 10 ms
[2021-05-17 00:30:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :137 after 278
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 448 out of 452 initially.
// Phase 1: matrix 448 rows 336 cols
[2021-05-17 00:30:53] [INFO ] Computed 57 place invariants in 6 ms
inv : mi3_0 + mi2_0 + mi1_0 = 1
inv : CreatedJobs_65 + CreatedJobs_66 + CreatedJobs_67 + CreatedJobs_68 + CreatedJobs_69 + AvailableJobId_13 = 1
inv : FetchJobE_2 + QueueJobB_2 + f3_2 + f2_2 + f1_2 + NotifyEventJobQueuedB_2 + AvailableJobId_2 + Perform_Work_B_2 + Schedule_Task_E_2 = 1
inv : FetchJobE_3 + QueueJobB_3 + f3_3 + f2_3 + f1_3 + NotifyEventJobQueuedB_3 + AvailableJobId_3 + Perform_Work_B_3 + Schedule_Task_E_3 = 1
inv : FetchJobE_6 + QueueJobB_6 + f3_6 + f2_6 + f1_6 + NotifyEventJobQueuedB_6 + AvailableJobId_6 + Perform_Work_B_6 + Schedule_Task_E_6 = 1
inv : FetchJobE_4 + QueueJobB_4 + f3_4 + f2_4 + f1_4 + NotifyEventJobQueuedB_4 + AvailableJobId_4 + Perform_Work_B_4 + Schedule_Task_E_4 = 1
inv : FetchJobE_9 + QueueJobB_9 + f3_9 + f2_9 + f1_9 + NotifyEventJobQueuedB_9 + AvailableJobId_9 + Perform_Work_B_9 + Schedule_Task_E_9 = 1
inv : CreatedJobs_60 + CreatedJobs_61 + CreatedJobs_62 + CreatedJobs_63 + CreatedJobs_64 + AvailableJobId_12 = 1
inv : CreatedJobs_70 + CreatedJobs_71 + CreatedJobs_72 + CreatedJobs_73 + CreatedJobs_74 + AvailableJobId_14 = 1
inv : FetchJobB_0 - QueueJobB_0 - QueueJobB_1 - QueueJobB_2 - QueueJobB_3 - QueueJobB_4 - QueueJobB_5 - QueueJobB_6 - QueueJobB_7 - QueueJobB_8 - QueueJobB_9 - QueueJobB_10 - QueueJobB_11 - QueueJobB_12 - QueueJobB_13 - QueueJobB_14 - QueueJobB_15 - QueueJobB_16 - QueueJobB_17 - QueueJobB_18 - QueueJobB_19 - QueueJobB_20 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - cJobCnt_0 = -10
inv : FetchJobE_11 + QueueJobB_11 + f3_11 + f2_11 + f1_11 + NotifyEventJobQueuedB_11 + AvailableJobId_11 + Perform_Work_B_11 + Schedule_Task_E_11 = 1
inv : FetchJobE_1 + QueueJobB_1 + f3_1 + f2_1 + f1_1 + NotifyEventJobQueuedB_1 + AvailableJobId_1 + Perform_Work_B_1 + Schedule_Task_E_1 = 1
inv : mo2_0 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 - mi2_0 = 0
inv : FetchJobE_15 + QueueJobB_15 + f3_15 + f2_15 + f1_15 + NotifyEventJobQueuedB_15 + AvailableJobId_15 + Perform_Work_B_15 + Schedule_Task_E_15 = 1
inv : FetchJobE_16 + QueueJobB_16 + f3_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_16 + AvailableJobId_16 + Perform_Work_B_16 + Schedule_Task_E_16 = 1
inv : FetchJobE_14 + QueueJobB_14 + f3_14 + f2_14 + f1_14 + NotifyEventJobQueuedB_14 + AvailableJobId_14 + Perform_Work_B_14 + Schedule_Task_E_14 = 1
inv : FetchJobE_19 + QueueJobB_19 + f3_19 + f2_19 + f1_19 + NotifyEventJobQueuedB_19 + AvailableJobId_19 + Perform_Work_B_19 + Schedule_Task_E_19 = 1
inv : ModifiedSrc_0 - CreatedJobs_1 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_6 - CreatedJobs_7 - CreatedJobs_8 - CreatedJobs_9 - CreatedJobs_11 - CreatedJobs_12 - CreatedJobs_13 - CreatedJobs_14 - CreatedJobs_16 - CreatedJobs_17 - CreatedJobs_18 - CreatedJobs_19 - CreatedJobs_21 - CreatedJobs_22 - CreatedJobs_23 - CreatedJobs_24 - CreatedJobs_26 - CreatedJobs_27 - CreatedJobs_28 - CreatedJobs_29 - CreatedJobs_31 - CreatedJobs_32 - CreatedJobs_33 - CreatedJobs_34 - CreatedJobs_36 - CreatedJobs_37 - CreatedJobs_38 - CreatedJobs_39 - CreatedJobs_41 - CreatedJobs_42 - CreatedJobs_43 - CreatedJobs_44 - CreatedJobs_46 - CreatedJobs_47 - CreatedJobs_48 - CreatedJobs_49 - CreatedJobs_51 - CreatedJobs_52 - CreatedJobs_53 - CreatedJobs_54 - CreatedJobs_56 - CreatedJobs_57 - CreatedJobs_58 - CreatedJobs_59 - CreatedJobs_61 - CreatedJobs_62 - CreatedJobs_63 - CreatedJobs_64 - CreatedJobs_66 - CreatedJobs_67 - CreatedJobs_68 - CreatedJobs_69 - CreatedJobs_71 - CreatedJobs_72 - CreatedJobs_73 - CreatedJobs_74 - CreatedJobs_76 - CreatedJobs_77 - CreatedJobs_78 - CreatedJobs_79 - CreatedJobs_81 - CreatedJobs_82 - CreatedJobs_83 - CreatedJobs_84 - CreatedJobs_86 - CreatedJobs_87 - CreatedJobs_88 - CreatedJobs_89 - CreatedJobs_91 - CreatedJobs_92 - CreatedJobs_93 - CreatedJobs_94 - CreatedJobs_96 - CreatedJobs_97 - CreatedJobs_98 - CreatedJobs_99 - CreatedJobs_101 - CreatedJobs_102 - CreatedJobs_103 - CreatedJobs_104 + place_482_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 + TheSour_0 = -20
inv : FetchJobE_5 + QueueJobB_5 + f3_5 + f2_5 + f1_5 + NotifyEventJobQueuedB_5 + AvailableJobId_5 + Perform_Work_B_5 + Schedule_Task_E_5 = 1
inv : 12*FetchJobE_0 + 12*FetchJobE_1 + 12*FetchJobE_2 + 12*FetchJobE_3 + 12*FetchJobE_4 + 12*FetchJobE_5 + 12*FetchJobE_6 + 12*FetchJobE_7 + 12*FetchJobE_8 + 12*FetchJobE_9 + 12*FetchJobE_10 + 12*FetchJobE_11 + 12*FetchJobE_12 + 12*FetchJobE_13 + 12*FetchJobE_14 + 12*FetchJobE_15 + 12*FetchJobE_16 + 12*FetchJobE_17 + 12*FetchJobE_18 + 12*FetchJobE_19 + 12*FetchJobE_20 + 12*QueueJobB_0 + 12*QueueJobB_1 + 12*QueueJobB_2 + 12*QueueJobB_3 + 12*QueueJobB_4 + 12*QueueJobB_5 + 12*QueueJobB_6 + 12*QueueJobB_7 + 12*QueueJobB_8 + 12*QueueJobB_9 + 12*QueueJobB_10 + 12*QueueJobB_11 + 12*QueueJobB_12 + 12*QueueJobB_13 + 12*QueueJobB_14 + 12*QueueJobB_15 + 12*QueueJobB_16 + 12*QueueJobB_17 + 12*QueueJobB_18 + 12*QueueJobB_19 + 12*QueueJobB_20 + 12*f3_0 + 12*f3_1 + 12*f3_2 + 12*f3_3 + 12*f3_4 + 12*f3_5 + 12*f3_6 + 12*f3_7 + 12*f3_8 + 12*f3_9 + 12*f3_10 + 12*f3_11 + 12*f3_12 + 12*f3_13 + 12*f3_14 + 12*f3_15 + 12*f3_16 + 12*f3_17 + 12*f3_18 + 12*f3_19 + 12*f3_20 + 12*f2_0 + 12*f2_1 + 12*f2_2 + 12*f2_3 + 12*f2_4 + 12*f2_5 + 12*f2_6 + 12*f2_7 + 12*f2_8 + 12*f2_9 + 12*f2_10 + 12*f2_11 + 12*f2_12 + 12*f2_13 + 12*f2_14 + 12*f2_15 + 12*f2_16 + 12*f2_17 + 12*f2_18 + 12*f2_19 + 12*f2_20 + 12*f1_0 + 12*f1_1 + 12*f1_2 + 12*f1_3 + 12*f1_4 + 12*f1_5 + 12*f1_6 + 12*f1_7 + 12*f1_8 + 12*f1_9 + 12*f1_10 + 12*f1_11 + 12*f1_12 + 12*f1_13 + 12*f1_14 + 12*f1_15 + 12*f1_16 + 12*f1_17 + 12*f1_18 + 12*f1_19 + 12*f1_20 + 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*Check_Sources_B_0 + 12*place_787_0 + 12*Perform_Work_E_0 + 12*Perform_Work_B_0 + 12*Perform_Work_B_1 + 12*Perform_Work_B_2 + 12*Perform_Work_B_3 + 12*Perform_Work_B_4 + 12*Perform_Work_B_5 + 12*Perform_Work_B_6 + 12*Perform_Work_B_7 + 12*Perform_Work_B_8 + 12*Perform_Work_B_9 + 12*Perform_Work_B_10 + 12*Perform_Work_B_11 + 12*Perform_Work_B_12 + 12*Perform_Work_B_13 + 12*Perform_Work_B_14 + 12*Perform_Work_B_15 + 12*Perform_Work_B_16 + 12*Perform_Work_B_17 + 12*Perform_Work_B_18 + 12*Perform_Work_B_19 + 12*Perform_Work_B_20 + 12*Schedule_Task_E_0 + 12*Schedule_Task_E_1 + 12*Schedule_Task_E_2 + 12*Schedule_Task_E_3 + 12*Schedule_Task_E_4 + 12*Schedule_Task_E_5 + 12*Schedule_Task_E_6 + 12*Schedule_Task_E_7 + 12*Schedule_Task_E_8 + 12*Schedule_Task_E_9 + 12*Schedule_Task_E_10 + 12*Schedule_Task_E_11 + 12*Schedule_Task_E_12 + 12*Schedule_Task_E_13 + 12*Schedule_Task_E_14 + 12*Schedule_Task_E_15 + 12*Schedule_Task_E_16 + 12*Schedule_Task_E_17 + 12*Schedule_Task_E_18 + 12*Schedule_Task_E_19 + 12*Schedule_Task_E_20 + 12*Schedule_Task_E_21 + 12*Schedule_Task_B_0 + 12*cJobCnt_0 + 12*Try_Check_Sources_B_0 = 132
inv : FetchJobE_20 + QueueJobB_20 + f3_20 + f2_20 + f1_20 + NotifyEventJobQueuedB_20 + AvailableJobId_20 + Perform_Work_B_20 + Schedule_Task_E_20 = 1
inv : ModifiedSrc_3 + CreatedJobs_3 + CreatedJobs_8 + CreatedJobs_13 + CreatedJobs_18 + CreatedJobs_23 + CreatedJobs_28 + CreatedJobs_33 + CreatedJobs_38 + CreatedJobs_43 + CreatedJobs_48 + CreatedJobs_53 + CreatedJobs_58 + CreatedJobs_63 + CreatedJobs_68 + CreatedJobs_73 + CreatedJobs_78 + CreatedJobs_83 + CreatedJobs_88 + CreatedJobs_93 + CreatedJobs_98 + CreatedJobs_103 + place_482_3 + TheSour_3 = 1
inv : FetchJobE_10 + QueueJobB_10 + f3_10 + f2_10 + f1_10 + NotifyEventJobQueuedB_10 + AvailableJobId_10 + Perform_Work_B_10 + Schedule_Task_E_10 = 1
inv : FetchJobE_0 + QueueJobB_0 + f3_0 + f2_0 + f1_0 + NotifyEventJobQueuedB_0 + AvailableJobId_0 + Perform_Work_B_0 + Schedule_Task_E_0 = 1
inv : CreatedJobs_45 + CreatedJobs_46 + CreatedJobs_47 + CreatedJobs_48 + CreatedJobs_49 + AvailableJobId_9 = 1
inv : ModifiedSrc_4 + CreatedJobs_4 + CreatedJobs_9 + CreatedJobs_14 + CreatedJobs_19 + CreatedJobs_24 + CreatedJobs_29 + CreatedJobs_34 + CreatedJobs_39 + CreatedJobs_44 + CreatedJobs_49 + CreatedJobs_54 + CreatedJobs_59 + CreatedJobs_64 + CreatedJobs_69 + CreatedJobs_74 + CreatedJobs_79 + CreatedJobs_84 + CreatedJobs_89 + CreatedJobs_94 + CreatedJobs_99 + CreatedJobs_104 + place_482_4 + TheSour_4 = 1
inv : CreatedJobs_15 + CreatedJobs_16 + CreatedJobs_17 + CreatedJobs_18 + CreatedJobs_19 + AvailableJobId_3 = 1
inv : CreatedJobs_85 + CreatedJobs_86 + CreatedJobs_87 + CreatedJobs_88 + CreatedJobs_89 + AvailableJobId_17 = 1
inv : JobCnt_0 + cJobCnt_0 = 10
inv : CreatedJobs_55 + CreatedJobs_56 + CreatedJobs_57 + CreatedJobs_58 + CreatedJobs_59 + AvailableJobId_11 = 1
inv : CreatedJobs_75 + CreatedJobs_76 + CreatedJobs_77 + CreatedJobs_78 + CreatedJobs_79 + AvailableJobId_15 = 1
inv : CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 + AvailableJobId_1 = 1
inv : FetchJobE_13 + QueueJobB_13 + f3_13 + f2_13 + f1_13 + NotifyEventJobQueuedB_13 + AvailableJobId_13 + Perform_Work_B_13 + Schedule_Task_E_13 = 1
inv : CreatedJobs_35 + CreatedJobs_36 + CreatedJobs_37 + CreatedJobs_38 + CreatedJobs_39 + AvailableJobId_7 = 1
inv : FetchJobE_18 + QueueJobB_18 + f3_18 + f2_18 + f1_18 + NotifyEventJobQueuedB_18 + AvailableJobId_18 + Perform_Work_B_18 + Schedule_Task_E_18 = 1
inv : FetchJobE_8 + QueueJobB_8 + f3_8 + f2_8 + f1_8 + NotifyEventJobQueuedB_8 + AvailableJobId_8 + Perform_Work_B_8 + Schedule_Task_E_8 = 1
inv : CreatedJobs_100 + CreatedJobs_101 + CreatedJobs_102 + CreatedJobs_103 + CreatedJobs_104 + AvailableJobId_20 = 1
inv : CreatedJobs_30 + CreatedJobs_31 + CreatedJobs_32 + CreatedJobs_33 + CreatedJobs_34 + AvailableJobId_6 = 1
inv : 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*CanInjectEvent_0 = 12
inv : ModifiedSrc_1 + CreatedJobs_1 + CreatedJobs_6 + CreatedJobs_11 + CreatedJobs_16 + CreatedJobs_21 + CreatedJobs_26 + CreatedJobs_31 + CreatedJobs_36 + CreatedJobs_41 + CreatedJobs_46 + CreatedJobs_51 + CreatedJobs_56 + CreatedJobs_61 + CreatedJobs_66 + CreatedJobs_71 + CreatedJobs_76 + CreatedJobs_81 + CreatedJobs_86 + CreatedJobs_91 + CreatedJobs_96 + CreatedJobs_101 + place_482_1 + TheSour_1 = 1
inv : CreatedJobs_25 + CreatedJobs_26 + CreatedJobs_27 + CreatedJobs_28 + CreatedJobs_29 + AvailableJobId_5 = 1
inv : CreatedJobs_95 + CreatedJobs_96 + CreatedJobs_97 + CreatedJobs_98 + CreatedJobs_99 + AvailableJobId_19 = 1
inv : ModifiedSrc_2 + CreatedJobs_2 + CreatedJobs_7 + CreatedJobs_12 + CreatedJobs_17 + CreatedJobs_22 + CreatedJobs_27 + CreatedJobs_32 + CreatedJobs_37 + CreatedJobs_42 + CreatedJobs_47 + CreatedJobs_52 + CreatedJobs_57 + CreatedJobs_62 + CreatedJobs_67 + CreatedJobs_72 + CreatedJobs_77 + CreatedJobs_82 + CreatedJobs_87 + CreatedJobs_92 + CreatedJobs_97 + CreatedJobs_102 + place_482_2 + TheSour_2 = 1
inv : CreatedJobs_10 + CreatedJobs_11 + CreatedJobs_12 + CreatedJobs_13 + CreatedJobs_14 + AvailableJobId_2 = 1
inv : CreatedJobs_50 + CreatedJobs_51 + CreatedJobs_52 + CreatedJobs_53 + CreatedJobs_54 + AvailableJobId_10 = 1
inv : -FetchJobE_0 - FetchJobE_1 - FetchJobE_2 - FetchJobE_3 - FetchJobE_4 - FetchJobE_5 - FetchJobE_6 - FetchJobE_7 - FetchJobE_8 - FetchJobE_9 - FetchJobE_10 - FetchJobE_11 - FetchJobE_12 - FetchJobE_13 - FetchJobE_14 - FetchJobE_15 - FetchJobE_16 - FetchJobE_17 - FetchJobE_18 - FetchJobE_19 - FetchJobE_20 + QueueJobE_0 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 + place_482_0 + place_482_1 + place_482_2 + place_482_3 + place_482_4 - place_462_0 - place_460_0 - place_458_0 - place_456_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 - Perform_Work_B_0 - Perform_Work_B_1 - Perform_Work_B_2 - Perform_Work_B_3 - Perform_Work_B_4 - Perform_Work_B_5 - Perform_Work_B_6 - Perform_Work_B_7 - Perform_Work_B_8 - Perform_Work_B_9 - Perform_Work_B_10 - Perform_Work_B_11 - Perform_Work_B_12 - Perform_Work_B_13 - Perform_Work_B_14 - Perform_Work_B_15 - Perform_Work_B_16 - Perform_Work_B_17 - Perform_Work_B_18 - Perform_Work_B_19 - Perform_Work_B_20 - Schedule_Task_E_0 - Schedule_Task_E_1 - Schedule_Task_E_2 - Schedule_Task_E_3 - Schedule_Task_E_4 - Schedule_Task_E_5 - Schedule_Task_E_6 - Schedule_Task_E_7 - Schedule_Task_E_8 - Schedule_Task_E_9 - Schedule_Task_E_10 - Schedule_Task_E_11 - Schedule_Task_E_12 - Schedule_Task_E_13 - Schedule_Task_E_14 - Schedule_Task_E_15 - Schedule_Task_E_16 - Schedule_Task_E_17 - Schedule_Task_E_18 - Schedule_Task_E_19 - Schedule_Task_E_20 = -21
inv : -f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 + mo3_0 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + mi2_0 + mi1_0 = 1
inv : CreatedJobs_80 + CreatedJobs_81 + CreatedJobs_82 + CreatedJobs_83 + CreatedJobs_84 + AvailableJobId_16 = 1
inv : CreatedJobs_90 + CreatedJobs_91 + CreatedJobs_92 + CreatedJobs_93 + CreatedJobs_94 + AvailableJobId_18 = 1
inv : FetchJobE_12 + QueueJobB_12 + f3_12 + f2_12 + f1_12 + NotifyEventJobQueuedB_12 + AvailableJobId_12 + Perform_Work_B_12 + Schedule_Task_E_12 = 1
inv : FetchJobE_17 + QueueJobB_17 + f3_17 + f2_17 + f1_17 + NotifyEventJobQueuedB_17 + AvailableJobId_17 + Perform_Work_B_17 + Schedule_Task_E_17 = 1
inv : CreatedJobs_40 + CreatedJobs_41 + CreatedJobs_42 + CreatedJobs_43 + CreatedJobs_44 + AvailableJobId_8 = 1
inv : CreatedJobs_0 + CreatedJobs_1 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + AvailableJobId_0 = 1
inv : CreatedJobs_20 + CreatedJobs_21 + CreatedJobs_22 + CreatedJobs_23 + CreatedJobs_24 + AvailableJobId_4 = 1
inv : FetchJobE_7 + QueueJobB_7 + f3_7 + f2_7 + f1_7 + NotifyEventJobQueuedB_7 + AvailableJobId_7 + Perform_Work_B_7 + Schedule_Task_E_7 = 1
inv : f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + mo1_0 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - mi1_0 = 0
inv : block_0 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 = 3
Total of 57 invariants.
[2021-05-17 00:30:53] [INFO ] Computed 57 place invariants in 24 ms
[2021-05-17 00:30:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(UNSAT) depth K=2 took 353 ms
[2021-05-17 00:30:54] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=2 took 226 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :278 after 610
[2021-05-17 00:30:54] [INFO ] Proved 336 variables to be positive in 942 ms
[2021-05-17 00:30:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-01
[2021-05-17 00:30:54] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(SAT) depth K=0 took 56 ms
[2021-05-17 00:30:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-02
[2021-05-17 00:30:54] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(SAT) depth K=0 took 23 ms
[2021-05-17 00:30:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-01
[2021-05-17 00:30:54] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(SAT) depth K=1 took 133 ms
[2021-05-17 00:30:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-02
[2021-05-17 00:30:54] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(SAT) depth K=1 took 81 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :610 after 2742
Compilation finished in 3463 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17856878943402545609]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J20ReachabilityCardinality01==true], workingDir=/tmp/ltsmin17856878943402545609]
[2021-05-17 00:30:59] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(UNSAT) depth K=3 took 5188 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2742 after 8175
[2021-05-17 00:31:13] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=3 took 14233 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8175 after 48563
[2021-05-17 00:32:57] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(UNSAT) depth K=4 took 103660 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :48563 after 305878
[2021-05-17 00:33:36] [INFO ] Induction result is UNSAT, proved invariant PolyORBNT-COL-S05J20-ReachabilityCardinality-01
[2021-05-17 00:33:36] [INFO ] Induction result is UNSAT, successfully proved induction at step 2 for PolyORBNT-COL-S05J20-ReachabilityCardinality-01
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-01 TRUE TECHNIQUES SAT_SMT K_INDUCTION(2)
[2021-05-17 00:33:36] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-01(TRUE) depth K=2 took 161683 ms
[2021-05-17 00:33:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-02
[2021-05-17 00:33:54] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(SAT) depth K=2 took 17734 ms
[2021-05-17 00:34:43] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=4 took 106017 ms
[2021-05-17 00:35:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-02
[2021-05-17 00:35:41] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(SAT) depth K=3 took 106941 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :305878 after 1.00229e+06
[2021-05-17 00:44:31] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=5 took 587867 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.00229e+06 after 1.56638e+06
[2021-05-17 00:49:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityCardinality-02
[2021-05-17 00:49:39] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(SAT) depth K=4 took 837877 ms
[2021-05-17 00:51:40] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=6 took 429816 ms
Detected timeout of ITS tools.
[2021-05-17 00:52:08] [INFO ] Applying decomposition
[2021-05-17 00:52:08] [INFO ] Flatten gal took : 79 ms
[2021-05-17 00:52:08] [INFO ] Decomposing Gal with order
[2021-05-17 00:52:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:52:08] [INFO ] Removed a total of 1504 redundant transitions.
[2021-05-17 00:52:08] [INFO ] Flatten gal took : 185 ms
[2021-05-17 00:52:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 36 ms.
[2021-05-17 00:52:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6116186474461049936.gal : 14 ms
[2021-05-17 00:52:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5084313520324975413.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6116186474461049936.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5084313520324975413.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6116186474461049936.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5084313520324975413.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5084313520324975413.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19 after 26
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :26 after 34
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :34 after 48
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48 after 78
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :78 after 257
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :257 after 916
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :916 after 2196
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2196 after 4953
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4953 after 53273
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :53273 after 149641
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :149641 after 1.46709e+06
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J20ReachabilityCardinality01==true], workingDir=/tmp/ltsmin17856878943402545609]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J20ReachabilityCardinality02==true], workingDir=/tmp/ltsmin17856878943402545609]
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.46709e+06 after 9.14119e+06
Detected timeout of ITS tools.
[2021-05-17 01:13:24] [INFO ] Flatten gal took : 125 ms
[2021-05-17 01:13:24] [INFO ] Input system was already deterministic with 452 transitions.
[2021-05-17 01:13:24] [INFO ] Transformed 336 places.
[2021-05-17 01:13:24] [INFO ] Transformed 452 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 01:13:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6334192929474167498.gal : 14 ms
[2021-05-17 01:13:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3137754312947421905.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6334192929474167498.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3137754312947421905.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6334192929474167498.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3137754312947421905.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality3137754312947421905.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 128
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :191 after 244
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :244 after 250
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :250 after 258
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :258 after 268
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :268 after 282
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :282 after 2199
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2199 after 2598
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2598 after 3630
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3630 after 4926
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4926 after 10380
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10380 after 173468
[2021-05-17 01:19:54] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityCardinality-02(UNSAT) depth K=7 took 1694000 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :173468 after 265580

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J20"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J20, 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 r159-oct2-162089268300366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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