Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100591.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K 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 94K 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.5K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 46K 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 Peterson-COL-6-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621014863055

Running Version 0
[2021-05-14 17:54:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-14 17:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 17:54:24] [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-14 17:54:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 17:54:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2021-05-14 17:54:25] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 17:54:25] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 17:54:25] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1483384680253691976.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-14 17:54:25] [INFO ] Flatten gal took : 26 ms
[2021-05-14 17:54:25] [INFO ] Flatten gal took : 2 ms
[2021-05-14 17:54:25] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 37 ms.
[2021-05-14 17:54:25] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10432097492266819667.dot
Deduced a syphon composed of 42 places in 16 ms
Reduce places removed 42 places and 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 14) seen :8
FORMULA Peterson-COL-6-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 6) seen :1
FORMULA Peterson-COL-6-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2021-05-14 17:54:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 17:54:27] [INFO ] Computed 27 place invariants in 40 ms
[2021-05-14 17:54:27] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2021-05-14 17:54:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2021-05-14 17:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:29] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2021-05-14 17:54:31] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 17:54:31] [INFO ] [Real]Added 366 Read/Feed constraints in 104 ms returned sat
[2021-05-14 17:54:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:54:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 17:54:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-14 17:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:32] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2021-05-14 17:54:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 87 ms returned sat
[2021-05-14 17:54:35] [INFO ] Deduced a trap composed of 49 places in 2443 ms of which 1822 ms to minimize.
[2021-05-14 17:54:35] [INFO ] Deduced a trap composed of 16 places in 658 ms of which 14 ms to minimize.
[2021-05-14 17:54:36] [INFO ] Deduced a trap composed of 32 places in 523 ms of which 2 ms to minimize.
[2021-05-14 17:54:36] [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-14 17:54:36] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 17:54:36] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-14 17:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:37] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2021-05-14 17:54:37] [INFO ] [Real]Added 366 Read/Feed constraints in 105 ms returned sat
[2021-05-14 17:54:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:54:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 17:54:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-14 17:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:38] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2021-05-14 17:54:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 131 ms returned sat
[2021-05-14 17:54:39] [INFO ] Deduced a trap composed of 177 places in 456 ms of which 1 ms to minimize.
[2021-05-14 17:54:39] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 2 ms to minimize.
[2021-05-14 17:54:40] [INFO ] Deduced a trap composed of 252 places in 422 ms of which 1 ms to minimize.
[2021-05-14 17:54:40] [INFO ] Deduced a trap composed of 206 places in 384 ms of which 1 ms to minimize.
[2021-05-14 17:54:41] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 2 ms to minimize.
[2021-05-14 17:54:41] [INFO ] Deduced a trap composed of 79 places in 362 ms of which 1 ms to minimize.
[2021-05-14 17:54:42] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 1 ms to minimize.
[2021-05-14 17:54:42] [INFO ] Deduced a trap composed of 221 places in 415 ms of which 0 ms to minimize.
[2021-05-14 17:54:43] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 1 ms to minimize.
[2021-05-14 17:54:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 17:54:43] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2021-05-14 17:54:43] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-14 17:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:44] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2021-05-14 17:54:44] [INFO ] [Real]Added 366 Read/Feed constraints in 105 ms returned sat
[2021-05-14 17:54:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:54:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2021-05-14 17:54:44] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-14 17:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:45] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2021-05-14 17:54:45] [INFO ] [Nat]Added 366 Read/Feed constraints in 126 ms returned sat
[2021-05-14 17:54:45] [INFO ] Deduced a trap composed of 177 places in 416 ms of which 1 ms to minimize.
[2021-05-14 17:54:46] [INFO ] Deduced a trap composed of 20 places in 410 ms of which 1 ms to minimize.
[2021-05-14 17:54:46] [INFO ] Deduced a trap composed of 252 places in 410 ms of which 1 ms to minimize.
[2021-05-14 17:54:47] [INFO ] Deduced a trap composed of 206 places in 395 ms of which 1 ms to minimize.
[2021-05-14 17:54:47] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 1 ms to minimize.
[2021-05-14 17:54:48] [INFO ] Deduced a trap composed of 79 places in 388 ms of which 1 ms to minimize.
[2021-05-14 17:54:48] [INFO ] Deduced a trap composed of 75 places in 351 ms of which 1 ms to minimize.
[2021-05-14 17:54:49] [INFO ] Deduced a trap composed of 221 places in 404 ms of which 1 ms to minimize.
[2021-05-14 17:54:49] [INFO ] Deduced a trap composed of 20 places in 355 ms of which 0 ms to minimize.
[2021-05-14 17:54:49] [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 2
[2021-05-14 17:54:49] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2021-05-14 17:54:49] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2021-05-14 17:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:53] [INFO ] [Real]Absence check using state equation in 3614 ms returned sat
[2021-05-14 17:54:53] [INFO ] [Real]Added 366 Read/Feed constraints in 97 ms returned sat
[2021-05-14 17:54:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:54:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 49 ms returned sat
[2021-05-14 17:54:53] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-14 17:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:54:57] [INFO ] [Nat]Absence check using state equation in 3681 ms returned sat
[2021-05-14 17:54:57] [INFO ] [Nat]Added 366 Read/Feed constraints in 102 ms returned sat
[2021-05-14 17:54:58] [INFO ] Deduced a trap composed of 177 places in 487 ms of which 1 ms to minimize.
[2021-05-14 17:54:58] [INFO ] Deduced a trap composed of 183 places in 491 ms of which 1 ms to minimize.
[2021-05-14 17:54:58] [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 3
[2021-05-14 17:54:59] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned sat
[2021-05-14 17:54:59] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-14 17:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:55:03] [INFO ] [Real]Absence check using state equation in 4028 ms returned sat
[2021-05-14 17:55:03] [INFO ] [Real]Added 366 Read/Feed constraints in 92 ms returned sat
[2021-05-14 17:55:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:55:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 47 ms returned sat
[2021-05-14 17:55:03] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-14 17:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:55:07] [INFO ] [Nat]Absence check using state equation in 4271 ms returned sat
[2021-05-14 17:55:07] [INFO ] [Nat]Added 366 Read/Feed constraints in 110 ms returned sat
[2021-05-14 17:55:08] [INFO ] Deduced a trap composed of 147 places in 474 ms of which 1 ms to minimize.
[2021-05-14 17:55:08] [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 4
Fused 5 Parikh solutions to 1 different solutions.
Support contains 1029 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 95 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
[2021-05-14 17:55:08] [INFO ] Flatten gal took : 144 ms
[2021-05-14 17:55:08] [INFO ] Flatten gal took : 127 ms
[2021-05-14 17:55:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17392042934550474331.gal : 22 ms
[2021-05-14 17:55:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10177162250578201214.prop : 6 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/ReachabilityCardinality17392042934550474331.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10177162250578201214.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/ReachabilityCardinality17392042934550474331.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10177162250578201214.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10177162250578201214.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :10 after 21
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :21 after 22
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :22 after 42
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :42 after 53
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :53 after 283
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :283 after 325
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :325 after 880
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :880 after 2314
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2314 after 13770
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :13770 after 44060
Detected timeout of ITS tools.
[2021-05-14 17:55:24] [INFO ] Flatten gal took : 97 ms
[2021-05-14 17:55:24] [INFO ] Applying decomposition
[2021-05-14 17:55:24] [INFO ] Flatten gal took : 89 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/graph5971707186356255457.txt, -o, /tmp/graph5971707186356255457.bin, -w, /tmp/graph5971707186356255457.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/graph5971707186356255457.bin, -l, -1, -v, -w, /tmp/graph5971707186356255457.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 17:55:24] [INFO ] Decomposing Gal with order
[2021-05-14 17:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:55:24] [INFO ] Removed a total of 1788 redundant transitions.
[2021-05-14 17:55:24] [INFO ] Flatten gal took : 174 ms
[2021-05-14 17:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-14 17:55:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality927165189528094875.gal : 17 ms
[2021-05-14 17:55:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4450021287136615168.prop : 6 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/ReachabilityCardinality927165189528094875.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4450021287136615168.prop, --nowitness], 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/ReachabilityCardinality927165189528094875.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4450021287136615168.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4450021287136615168.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 138
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :138 after 12497
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8586061384151594588
[2021-05-14 17:55:47] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8586061384151594588
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/ltsmin8586061384151594588]
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/ltsmin8586061384151594588] 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/ltsmin8586061384151594588] 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 2 resets, run finished after 22041 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 251176 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3951 ms. (steps per millisecond=253 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3859 ms. (steps per millisecond=259 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 104704 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=20 ) properties seen :{}
Interrupted Best-First random walk after 380129 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted probabilistic random walk after 2107928 steps, run timeout after 30001 ms. (steps per millisecond=70 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 2107928 steps, saw 946013 distinct states, run finished after 30001 ms. (steps per millisecond=70 ) properties seen :{1=1, 2=1}
FORMULA Peterson-COL-6-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2021-05-14 17:57:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 17:57:02] [INFO ] Computed 27 place invariants in 12 ms
[2021-05-14 17:57:03] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 17:57:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-14 17:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:57:04] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2021-05-14 17:57:04] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 17:57:04] [INFO ] [Real]Added 366 Read/Feed constraints in 86 ms returned sat
[2021-05-14 17:57:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:57:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 17:57:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2021-05-14 17:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:57:06] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2021-05-14 17:57:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 83 ms returned sat
[2021-05-14 17:57:06] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 0 ms to minimize.
[2021-05-14 17:57:07] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 1 ms to minimize.
[2021-05-14 17:57:07] [INFO ] Deduced a trap composed of 32 places in 456 ms of which 2 ms to minimize.
[2021-05-14 17:57:08] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 1 ms to minimize.
[2021-05-14 17:57:08] [INFO ] Deduced a trap composed of 86 places in 503 ms of which 1 ms to minimize.
[2021-05-14 17:57:09] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 1 ms to minimize.
[2021-05-14 17:57:09] [INFO ] Deduced a trap composed of 111 places in 462 ms of which 1 ms to minimize.
[2021-05-14 17:57:10] [INFO ] Deduced a trap composed of 19 places in 468 ms of which 4 ms to minimize.
[2021-05-14 17:57:10] [INFO ] Deduced a trap composed of 50 places in 423 ms of which 1 ms to minimize.
[2021-05-14 17:57:11] [INFO ] Deduced a trap composed of 246 places in 420 ms of which 5 ms to minimize.
[2021-05-14 17:57:12] [INFO ] Deduced a trap composed of 78 places in 443 ms of which 1 ms to minimize.
[2021-05-14 17:57:12] [INFO ] Deduced a trap composed of 218 places in 462 ms of which 1 ms to minimize.
[2021-05-14 17:57:13] [INFO ] Deduced a trap composed of 106 places in 438 ms of which 1 ms to minimize.
[2021-05-14 17:57:13] [INFO ] Deduced a trap composed of 106 places in 427 ms of which 8 ms to minimize.
[2021-05-14 17:57:14] [INFO ] Deduced a trap composed of 71 places in 444 ms of which 1 ms to minimize.
[2021-05-14 17:57:14] [INFO ] Deduced a trap composed of 100 places in 447 ms of which 1 ms to minimize.
[2021-05-14 17:57:15] [INFO ] Deduced a trap composed of 169 places in 464 ms of which 1 ms to minimize.
[2021-05-14 17:57:15] [INFO ] Deduced a trap composed of 46 places in 423 ms of which 1 ms to minimize.
[2021-05-14 17:57:16] [INFO ] Deduced a trap composed of 46 places in 436 ms of which 0 ms to minimize.
[2021-05-14 17:57:16] [INFO ] Deduced a trap composed of 66 places in 490 ms of which 1 ms to minimize.
[2021-05-14 17:57:17] [INFO ] Deduced a trap composed of 185 places in 473 ms of which 1 ms to minimize.
[2021-05-14 17:57:17] [INFO ] Deduced a trap composed of 178 places in 479 ms of which 1 ms to minimize.
[2021-05-14 17:57:18] [INFO ] Deduced a trap composed of 67 places in 485 ms of which 1 ms to minimize.
[2021-05-14 17:57:19] [INFO ] Deduced a trap composed of 65 places in 479 ms of which 1 ms to minimize.
[2021-05-14 17:57:19] [INFO ] Deduced a trap composed of 185 places in 493 ms of which 1 ms to minimize.
[2021-05-14 17:57:20] [INFO ] Deduced a trap composed of 62 places in 483 ms of which 1 ms to minimize.
[2021-05-14 17:57:20] [INFO ] Deduced a trap composed of 185 places in 478 ms of which 1 ms to minimize.
[2021-05-14 17:57:21] [INFO ] Deduced a trap composed of 232 places in 461 ms of which 1 ms to minimize.
[2021-05-14 17:57:21] [INFO ] Deduced a trap composed of 158 places in 499 ms of which 1 ms to minimize.
[2021-05-14 17:57:22] [INFO ] Deduced a trap composed of 242 places in 468 ms of which 1 ms to minimize.
[2021-05-14 17:57:22] [INFO ] Deduced a trap composed of 64 places in 442 ms of which 1 ms to minimize.
[2021-05-14 17:57:23] [INFO ] Deduced a trap composed of 80 places in 493 ms of which 8 ms to minimize.
[2021-05-14 17:57:24] [INFO ] Deduced a trap composed of 140 places in 498 ms of which 1 ms to minimize.
[2021-05-14 17:57:24] [INFO ] Deduced a trap composed of 46 places in 472 ms of which 1 ms to minimize.
[2021-05-14 17:57:25] [INFO ] Deduced a trap composed of 76 places in 529 ms of which 1 ms to minimize.
[2021-05-14 17:57:25] [INFO ] Deduced a trap composed of 113 places in 487 ms of which 1 ms to minimize.
[2021-05-14 17:57:26] [INFO ] Deduced a trap composed of 194 places in 460 ms of which 1 ms to minimize.
[2021-05-14 17:57:26] [INFO ] Deduced a trap composed of 99 places in 484 ms of which 2 ms to minimize.
[2021-05-14 17:57:27] [INFO ] Deduced a trap composed of 163 places in 442 ms of which 1 ms to minimize.
[2021-05-14 17:57:28] [INFO ] Deduced a trap composed of 198 places in 467 ms of which 1 ms to minimize.
[2021-05-14 17:57:28] [INFO ] Deduced a trap composed of 185 places in 484 ms of which 1 ms to minimize.
[2021-05-14 17:57:29] [INFO ] Deduced a trap composed of 114 places in 469 ms of which 1 ms to minimize.
[2021-05-14 17:57:29] [INFO ] Deduced a trap composed of 133 places in 481 ms of which 1 ms to minimize.
[2021-05-14 17:57:30] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 2 ms to minimize.
[2021-05-14 17:57:31] [INFO ] Deduced a trap composed of 45 places in 473 ms of which 1 ms to minimize.
[2021-05-14 17:57:31] [INFO ] Deduced a trap composed of 125 places in 388 ms of which 1 ms to minimize.
[2021-05-14 17:57:32] [INFO ] Deduced a trap composed of 80 places in 429 ms of which 1 ms to minimize.
[2021-05-14 17:57:32] [INFO ] Deduced a trap composed of 103 places in 434 ms of which 1 ms to minimize.
[2021-05-14 17:57:33] [INFO ] Deduced a trap composed of 79 places in 422 ms of which 1 ms to minimize.
[2021-05-14 17:57:33] [INFO ] Deduced a trap composed of 106 places in 414 ms of which 1 ms to minimize.
[2021-05-14 17:57:34] [INFO ] Deduced a trap composed of 161 places in 373 ms of which 1 ms to minimize.
[2021-05-14 17:57:34] [INFO ] Deduced a trap composed of 106 places in 398 ms of which 1 ms to minimize.
[2021-05-14 17:57:35] [INFO ] Deduced a trap composed of 75 places in 392 ms of which 1 ms to minimize.
[2021-05-14 17:57:35] [INFO ] Deduced a trap composed of 124 places in 391 ms of which 1 ms to minimize.
[2021-05-14 17:57:36] [INFO ] Deduced a trap composed of 155 places in 313 ms of which 1 ms to minimize.
[2021-05-14 17:57:36] [INFO ] Deduced a trap composed of 125 places in 427 ms of which 1 ms to minimize.
[2021-05-14 17:57:37] [INFO ] Deduced a trap composed of 106 places in 301 ms of which 0 ms to minimize.
[2021-05-14 17:57:37] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 1 ms to minimize.
[2021-05-14 17:57:37] [INFO ] Deduced a trap composed of 155 places in 311 ms of which 1 ms to minimize.
[2021-05-14 17:57:38] [INFO ] Deduced a trap composed of 125 places in 313 ms of which 1 ms to minimize.
[2021-05-14 17:57:38] [INFO ] Deduced a trap composed of 155 places in 377 ms of which 1 ms to minimize.
[2021-05-14 17:57:39] [INFO ] Deduced a trap composed of 250 places in 378 ms of which 1 ms to minimize.
[2021-05-14 17:57:39] [INFO ] Deduced a trap composed of 95 places in 390 ms of which 1 ms to minimize.
[2021-05-14 17:57:40] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2021-05-14 17:57:40] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 1 ms to minimize.
[2021-05-14 17:57:41] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2021-05-14 17:57:41] [INFO ] Deduced a trap composed of 144 places in 413 ms of which 1 ms to minimize.
[2021-05-14 17:57:41] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2021-05-14 17:57:42] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 0 ms to minimize.
[2021-05-14 17:57:42] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 0 ms to minimize.
[2021-05-14 17:57:43] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
[2021-05-14 17:57:43] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 1 ms to minimize.
[2021-05-14 17:57:44] [INFO ] Deduced a trap composed of 191 places in 213 ms of which 1 ms to minimize.
[2021-05-14 17:57:44] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 38033 ms
[2021-05-14 17:57:44] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 113 ms.
[2021-05-14 17:57:49] [INFO ] Added : 255 causal constraints over 51 iterations in 5620 ms. Result :unknown
[2021-05-14 17:57:49] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2021-05-14 17:57:49] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2021-05-14 17:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:57:53] [INFO ] [Real]Absence check using state equation in 3578 ms returned sat
[2021-05-14 17:57:53] [INFO ] [Real]Added 366 Read/Feed constraints in 97 ms returned sat
[2021-05-14 17:57:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:57:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 51 ms returned sat
[2021-05-14 17:57:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-14 17:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:57:57] [INFO ] [Nat]Absence check using state equation in 3747 ms returned sat
[2021-05-14 17:57:57] [INFO ] [Nat]Added 366 Read/Feed constraints in 109 ms returned sat
[2021-05-14 17:57:58] [INFO ] Deduced a trap composed of 177 places in 534 ms of which 1 ms to minimize.
[2021-05-14 17:57:59] [INFO ] Deduced a trap composed of 183 places in 497 ms of which 1 ms to minimize.
[2021-05-14 17:57:59] [INFO ] Deduced a trap composed of 82 places in 540 ms of which 1 ms to minimize.
[2021-05-14 17:58:00] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 1 ms to minimize.
[2021-05-14 17:58:00] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 1 ms to minimize.
[2021-05-14 17:58:01] [INFO ] Deduced a trap composed of 22 places in 503 ms of which 1 ms to minimize.
[2021-05-14 17:58:02] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 1 ms to minimize.
[2021-05-14 17:58:02] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 1 ms to minimize.
[2021-05-14 17:58:03] [INFO ] Deduced a trap composed of 65 places in 435 ms of which 1 ms to minimize.
[2021-05-14 17:58:03] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 1 ms to minimize.
[2021-05-14 17:58:04] [INFO ] Deduced a trap composed of 65 places in 460 ms of which 1 ms to minimize.
[2021-05-14 17:58:04] [INFO ] Deduced a trap composed of 124 places in 476 ms of which 1 ms to minimize.
[2021-05-14 17:58:05] [INFO ] Deduced a trap composed of 359 places in 457 ms of which 1 ms to minimize.
[2021-05-14 17:58:05] [INFO ] Deduced a trap composed of 187 places in 491 ms of which 1 ms to minimize.
[2021-05-14 17:58:06] [INFO ] Deduced a trap composed of 65 places in 466 ms of which 1 ms to minimize.
[2021-05-14 17:58:07] [INFO ] Deduced a trap composed of 51 places in 505 ms of which 1 ms to minimize.
[2021-05-14 17:58:07] [INFO ] Deduced a trap composed of 61 places in 469 ms of which 1 ms to minimize.
[2021-05-14 17:58:08] [INFO ] Deduced a trap composed of 182 places in 476 ms of which 1 ms to minimize.
[2021-05-14 17:58:08] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 1 ms to minimize.
[2021-05-14 17:58:09] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 0 ms to minimize.
[2021-05-14 17:58:09] [INFO ] Deduced a trap composed of 57 places in 447 ms of which 1 ms to minimize.
[2021-05-14 17:58:10] [INFO ] Deduced a trap composed of 69 places in 433 ms of which 1 ms to minimize.
[2021-05-14 17:58:10] [INFO ] Deduced a trap composed of 271 places in 431 ms of which 1 ms to minimize.
[2021-05-14 17:58:11] [INFO ] Deduced a trap composed of 283 places in 475 ms of which 1 ms to minimize.
[2021-05-14 17:58:12] [INFO ] Deduced a trap composed of 109 places in 405 ms of which 1 ms to minimize.
[2021-05-14 17:58:12] [INFO ] Deduced a trap composed of 60 places in 465 ms of which 1 ms to minimize.
[2021-05-14 17:58:13] [INFO ] Deduced a trap composed of 218 places in 402 ms of which 1 ms to minimize.
[2021-05-14 17:58:13] [INFO ] Deduced a trap composed of 79 places in 408 ms of which 0 ms to minimize.
[2021-05-14 17:58:14] [INFO ] Deduced a trap composed of 98 places in 443 ms of which 1 ms to minimize.
[2021-05-14 17:58:14] [INFO ] Deduced a trap composed of 80 places in 435 ms of which 1 ms to minimize.
[2021-05-14 17:58:15] [INFO ] Deduced a trap composed of 79 places in 474 ms of which 0 ms to minimize.
[2021-05-14 17:58:15] [INFO ] Deduced a trap composed of 100 places in 445 ms of which 1 ms to minimize.
[2021-05-14 17:58:16] [INFO ] Deduced a trap composed of 98 places in 440 ms of which 1 ms to minimize.
[2021-05-14 17:58:16] [INFO ] Deduced a trap composed of 128 places in 442 ms of which 1 ms to minimize.
[2021-05-14 17:58:17] [INFO ] Deduced a trap composed of 52 places in 412 ms of which 1 ms to minimize.
[2021-05-14 17:58:17] [INFO ] Deduced a trap composed of 95 places in 411 ms of which 1 ms to minimize.
[2021-05-14 17:58:18] [INFO ] Deduced a trap composed of 142 places in 441 ms of which 1 ms to minimize.
[2021-05-14 17:58:18] [INFO ] Deduced a trap composed of 176 places in 456 ms of which 1 ms to minimize.
[2021-05-14 17:58:19] [INFO ] Deduced a trap composed of 140 places in 453 ms of which 1 ms to minimize.
[2021-05-14 17:58:19] [INFO ] Deduced a trap composed of 283 places in 450 ms of which 1 ms to minimize.
[2021-05-14 17:58:20] [INFO ] Deduced a trap composed of 62 places in 422 ms of which 1 ms to minimize.
[2021-05-14 17:58:21] [INFO ] Deduced a trap composed of 250 places in 450 ms of which 1 ms to minimize.
[2021-05-14 17:58:21] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 1 ms to minimize.
[2021-05-14 17:58:22] [INFO ] Deduced a trap composed of 140 places in 415 ms of which 1 ms to minimize.
[2021-05-14 17:58:22] [INFO ] Deduced a trap composed of 282 places in 416 ms of which 1 ms to minimize.
[2021-05-14 17:58:23] [INFO ] Deduced a trap composed of 52 places in 450 ms of which 1 ms to minimize.
[2021-05-14 17:58:25] [INFO ] Deduced a trap composed of 160 places in 370 ms of which 1 ms to minimize.
[2021-05-14 17:58:25] [INFO ] Deduced a trap composed of 190 places in 381 ms of which 0 ms to minimize.
[2021-05-14 17:58:26] [INFO ] Deduced a trap composed of 153 places in 402 ms of which 0 ms to minimize.
[2021-05-14 17:58:26] [INFO ] Deduced a trap composed of 190 places in 416 ms of which 0 ms to minimize.
[2021-05-14 17:58:27] [INFO ] Deduced a trap composed of 73 places in 416 ms of which 1 ms to minimize.
[2021-05-14 17:58:27] [INFO ] Deduced a trap composed of 257 places in 415 ms of which 1 ms to minimize.
[2021-05-14 17:58:28] [INFO ] Deduced a trap composed of 117 places in 444 ms of which 1 ms to minimize.
[2021-05-14 17:58:28] [INFO ] Deduced a trap composed of 190 places in 417 ms of which 0 ms to minimize.
[2021-05-14 17:58:29] [INFO ] Deduced a trap composed of 102 places in 403 ms of which 1 ms to minimize.
[2021-05-14 17:58:29] [INFO ] Deduced a trap composed of 274 places in 382 ms of which 1 ms to minimize.
[2021-05-14 17:58:30] [INFO ] Deduced a trap composed of 148 places in 385 ms of which 1 ms to minimize.
[2021-05-14 17:58:30] [INFO ] Deduced a trap composed of 218 places in 387 ms of which 1 ms to minimize.
[2021-05-14 17:58:31] [INFO ] Deduced a trap composed of 108 places in 418 ms of which 1 ms to minimize.
[2021-05-14 17:58:31] [INFO ] Deduced a trap composed of 115 places in 418 ms of which 1 ms to minimize.
[2021-05-14 17:58:32] [INFO ] Deduced a trap composed of 137 places in 518 ms of which 1 ms to minimize.
[2021-05-14 17:58:35] [INFO ] Deduced a trap composed of 123 places in 420 ms of which 1 ms to minimize.
[2021-05-14 17:58:35] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 1 ms to minimize.
[2021-05-14 17:58:37] [INFO ] Deduced a trap composed of 180 places in 411 ms of which 1 ms to minimize.
[2021-05-14 17:58:37] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 1 ms to minimize.
[2021-05-14 17:58:38] [INFO ] Deduced a trap composed of 106 places in 433 ms of which 1 ms to minimize.
[2021-05-14 17:58:38] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 1 ms to minimize.
[2021-05-14 17:58:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 17:58:39] [INFO ] [Real]Absence check using 20 positive place invariants in 65 ms returned sat
[2021-05-14 17:58:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 39 ms returned sat
[2021-05-14 17:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:58:43] [INFO ] [Real]Absence check using state equation in 4065 ms returned sat
[2021-05-14 17:58:43] [INFO ] [Real]Added 366 Read/Feed constraints in 90 ms returned sat
[2021-05-14 17:58:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:58:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2021-05-14 17:58:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2021-05-14 17:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:58:47] [INFO ] [Nat]Absence check using state equation in 4189 ms returned sat
[2021-05-14 17:58:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 101 ms returned sat
[2021-05-14 17:58:48] [INFO ] Deduced a trap composed of 147 places in 440 ms of which 1 ms to minimize.
[2021-05-14 17:58:48] [INFO ] Deduced a trap composed of 64 places in 423 ms of which 1 ms to minimize.
[2021-05-14 17:58:49] [INFO ] Deduced a trap composed of 89 places in 433 ms of which 1 ms to minimize.
[2021-05-14 17:58:49] [INFO ] Deduced a trap composed of 114 places in 422 ms of which 1 ms to minimize.
[2021-05-14 17:58:50] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 1 ms to minimize.
[2021-05-14 17:58:51] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 1 ms to minimize.
[2021-05-14 17:58:51] [INFO ] Deduced a trap composed of 16 places in 429 ms of which 1 ms to minimize.
[2021-05-14 17:58:52] [INFO ] Deduced a trap composed of 172 places in 424 ms of which 1 ms to minimize.
[2021-05-14 17:58:52] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 1 ms to minimize.
[2021-05-14 17:58:53] [INFO ] Deduced a trap composed of 50 places in 420 ms of which 1 ms to minimize.
[2021-05-14 17:58:53] [INFO ] Deduced a trap composed of 62 places in 478 ms of which 1 ms to minimize.
[2021-05-14 17:58:54] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 1 ms to minimize.
[2021-05-14 17:58:54] [INFO ] Deduced a trap composed of 116 places in 436 ms of which 1 ms to minimize.
[2021-05-14 17:58:55] [INFO ] Deduced a trap composed of 121 places in 329 ms of which 0 ms to minimize.
[2021-05-14 17:58:55] [INFO ] Deduced a trap composed of 113 places in 257 ms of which 0 ms to minimize.
[2021-05-14 17:58:56] [INFO ] Deduced a trap composed of 99 places in 409 ms of which 0 ms to minimize.
[2021-05-14 17:58:56] [INFO ] Deduced a trap composed of 118 places in 254 ms of which 0 ms to minimize.
[2021-05-14 17:58:56] [INFO ] Deduced a trap composed of 109 places in 295 ms of which 1 ms to minimize.
[2021-05-14 17:58:57] [INFO ] Deduced a trap composed of 82 places in 442 ms of which 1 ms to minimize.
[2021-05-14 17:58:57] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 1 ms to minimize.
[2021-05-14 17:58:58] [INFO ] Deduced a trap composed of 30 places in 452 ms of which 0 ms to minimize.
[2021-05-14 17:58:58] [INFO ] Deduced a trap composed of 87 places in 340 ms of which 0 ms to minimize.
[2021-05-14 17:58:59] [INFO ] Deduced a trap composed of 147 places in 279 ms of which 1 ms to minimize.
[2021-05-14 17:58:59] [INFO ] Deduced a trap composed of 147 places in 286 ms of which 1 ms to minimize.
[2021-05-14 17:59:00] [INFO ] Deduced a trap composed of 117 places in 278 ms of which 1 ms to minimize.
[2021-05-14 17:59:00] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 12261 ms
[2021-05-14 17:59:00] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 120 ms.
[2021-05-14 17:59:20] [INFO ] Added : 710 causal constraints over 142 iterations in 20176 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 62 ms.
Incomplete Parikh walk after 857200 steps, including 1000 resets, run finished after 13029 ms. (steps per millisecond=65 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Peterson-COL-6-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 819100 steps, including 1000 resets, run finished after 15342 ms. (steps per millisecond=53 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 945 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1324 transition count 2024
Applied a total of 12 rules in 4218 ms. Remains 1324 /1330 variables (removed 6) and now considering 2024/2030 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 1324/1330 places, 2024/2030 transitions.
[2021-05-14 17:59:53] [INFO ] Flatten gal took : 73 ms
[2021-05-14 17:59:53] [INFO ] Flatten gal took : 83 ms
[2021-05-14 17:59:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16952056381865270593.gal : 8 ms
[2021-05-14 17:59:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6817906312289355936.prop : 3 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/ReachabilityCardinality16952056381865270593.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6817906312289355936.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/ReachabilityCardinality16952056381865270593.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6817906312289355936.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6817906312289355936.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 36
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :36 after 70
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :70 after 228
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :228 after 406
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :406 after 1054
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1054 after 2087
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2087 after 12443
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12443 after 37646
Detected timeout of ITS tools.
[2021-05-14 18:00:08] [INFO ] Flatten gal took : 66 ms
[2021-05-14 18:00:08] [INFO ] Applying decomposition
[2021-05-14 18:00:08] [INFO ] Flatten gal took : 73 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/graph18002434659843371241.txt, -o, /tmp/graph18002434659843371241.bin, -w, /tmp/graph18002434659843371241.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/graph18002434659843371241.bin, -l, -1, -v, -w, /tmp/graph18002434659843371241.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 18:00:08] [INFO ] Decomposing Gal with order
[2021-05-14 18:00:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:00:09] [INFO ] Removed a total of 1786 redundant transitions.
[2021-05-14 18:00:09] [INFO ] Flatten gal took : 224 ms
[2021-05-14 18:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-14 18:00:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7517724887296068116.gal : 252 ms
[2021-05-14 18:00:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14509350978439654595.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7517724887296068116.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14509350978439654595.prop, --nowitness], 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/ReachabilityCardinality7517724887296068116.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14509350978439654595.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14509350978439654595.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 100
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :100 after 3.88298e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin493785133967630783
[2021-05-14 18:00:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin493785133967630783
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/ltsmin493785133967630783]
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/ltsmin493785133967630783] 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/ltsmin493785133967630783] 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 2 resets, run finished after 19636 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 239144 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=47 ) properties seen :{}
Interrupted Best-First random walk after 103376 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=20 ) properties seen :{}
Interrupted probabilistic random walk after 2218672 steps, run timeout after 30001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 2218672 steps, saw 986163 distinct states, run finished after 30001 ms. (steps per millisecond=73 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 18:01:25] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1324 cols
[2021-05-14 18:01:25] [INFO ] Computed 27 place invariants in 9 ms
[2021-05-14 18:01:25] [INFO ] [Real]Absence check using 20 positive place invariants in 71 ms returned sat
[2021-05-14 18:01:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 23 ms returned sat
[2021-05-14 18:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:01:26] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2021-05-14 18:01:26] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 18:01:26] [INFO ] [Real]Added 366 Read/Feed constraints in 94 ms returned sat
[2021-05-14 18:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:01:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 18:01:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-14 18:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:01:28] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2021-05-14 18:01:28] [INFO ] [Nat]Added 366 Read/Feed constraints in 92 ms returned sat
[2021-05-14 18:01:28] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:01:29] [INFO ] Deduced a trap composed of 24 places in 496 ms of which 1 ms to minimize.
[2021-05-14 18:01:29] [INFO ] Deduced a trap composed of 32 places in 473 ms of which 1 ms to minimize.
[2021-05-14 18:01:30] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:01:31] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:01:31] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:01:32] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:01:32] [INFO ] Deduced a trap composed of 73 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:01:33] [INFO ] Deduced a trap composed of 45 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:01:33] [INFO ] Deduced a trap composed of 35 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:01:34] [INFO ] Deduced a trap composed of 46 places in 508 ms of which 1 ms to minimize.
[2021-05-14 18:01:35] [INFO ] Deduced a trap composed of 76 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:01:35] [INFO ] Deduced a trap composed of 76 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:01:36] [INFO ] Deduced a trap composed of 165 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:01:36] [INFO ] Deduced a trap composed of 195 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:01:37] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 0 ms to minimize.
[2021-05-14 18:01:37] [INFO ] Deduced a trap composed of 86 places in 420 ms of which 1 ms to minimize.
[2021-05-14 18:01:38] [INFO ] Deduced a trap composed of 81 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:01:38] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:01:39] [INFO ] Deduced a trap composed of 302 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:01:39] [INFO ] Deduced a trap composed of 16 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:01:40] [INFO ] Deduced a trap composed of 57 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:01:40] [INFO ] Deduced a trap composed of 46 places in 425 ms of which 1 ms to minimize.
[2021-05-14 18:01:41] [INFO ] Deduced a trap composed of 64 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:01:41] [INFO ] Deduced a trap composed of 106 places in 378 ms of which 1 ms to minimize.
[2021-05-14 18:01:42] [INFO ] Deduced a trap composed of 93 places in 368 ms of which 1 ms to minimize.
[2021-05-14 18:01:42] [INFO ] Deduced a trap composed of 105 places in 282 ms of which 1 ms to minimize.
[2021-05-14 18:01:42] [INFO ] Deduced a trap composed of 106 places in 279 ms of which 0 ms to minimize.
[2021-05-14 18:01:43] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 1 ms to minimize.
[2021-05-14 18:01:43] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 1 ms to minimize.
[2021-05-14 18:01:43] [INFO ] Deduced a trap composed of 135 places in 273 ms of which 1 ms to minimize.
[2021-05-14 18:01:44] [INFO ] Deduced a trap composed of 120 places in 282 ms of which 1 ms to minimize.
[2021-05-14 18:01:44] [INFO ] Deduced a trap composed of 136 places in 288 ms of which 0 ms to minimize.
[2021-05-14 18:01:45] [INFO ] Deduced a trap composed of 140 places in 286 ms of which 1 ms to minimize.
[2021-05-14 18:01:45] [INFO ] Deduced a trap composed of 138 places in 286 ms of which 0 ms to minimize.
[2021-05-14 18:01:45] [INFO ] Deduced a trap composed of 106 places in 287 ms of which 1 ms to minimize.
[2021-05-14 18:01:46] [INFO ] Deduced a trap composed of 136 places in 272 ms of which 1 ms to minimize.
[2021-05-14 18:01:46] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 1 ms to minimize.
[2021-05-14 18:01:46] [INFO ] Deduced a trap composed of 157 places in 281 ms of which 1 ms to minimize.
[2021-05-14 18:01:47] [INFO ] Deduced a trap composed of 167 places in 294 ms of which 1 ms to minimize.
[2021-05-14 18:01:47] [INFO ] Deduced a trap composed of 172 places in 307 ms of which 1 ms to minimize.
[2021-05-14 18:01:47] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 1 ms to minimize.
[2021-05-14 18:01:48] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2021-05-14 18:01:48] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 19989 ms
[2021-05-14 18:01:48] [INFO ] Computed and/alt/rep : 1723/3536/1723 causal constraints (skipped 84 transitions) in 102 ms.
[2021-05-14 18:02:08] [INFO ] Added : 795 causal constraints over 159 iterations in 20174 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
[2021-05-14 18:02:08] [INFO ] [Real]Absence check using 20 positive place invariants in 55 ms returned sat
[2021-05-14 18:02:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 26 ms returned sat
[2021-05-14 18:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:02:14] [INFO ] [Real]Absence check using state equation in 5776 ms returned sat
[2021-05-14 18:02:14] [INFO ] [Real]Added 366 Read/Feed constraints in 86 ms returned sat
[2021-05-14 18:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:02:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 54 ms returned sat
[2021-05-14 18:02:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2021-05-14 18:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:02:20] [INFO ] [Nat]Absence check using state equation in 5044 ms returned sat
[2021-05-14 18:02:20] [INFO ] [Nat]Added 366 Read/Feed constraints in 111 ms returned sat
[2021-05-14 18:02:20] [INFO ] Deduced a trap composed of 42 places in 545 ms of which 1 ms to minimize.
[2021-05-14 18:02:21] [INFO ] Deduced a trap composed of 22 places in 532 ms of which 1 ms to minimize.
[2021-05-14 18:02:21] [INFO ] Deduced a trap composed of 58 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:02:22] [INFO ] Deduced a trap composed of 68 places in 445 ms of which 1 ms to minimize.
[2021-05-14 18:02:22] [INFO ] Deduced a trap composed of 163 places in 396 ms of which 1 ms to minimize.
[2021-05-14 18:02:23] [INFO ] Deduced a trap composed of 62 places in 436 ms of which 0 ms to minimize.
[2021-05-14 18:02:24] [INFO ] Deduced a trap composed of 110 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:02:24] [INFO ] Deduced a trap composed of 157 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:02:25] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:02:25] [INFO ] Deduced a trap composed of 28 places in 496 ms of which 1 ms to minimize.
[2021-05-14 18:02:26] [INFO ] Deduced a trap composed of 102 places in 518 ms of which 1 ms to minimize.
[2021-05-14 18:02:26] [INFO ] Deduced a trap composed of 108 places in 487 ms of which 2 ms to minimize.
[2021-05-14 18:02:27] [INFO ] Deduced a trap composed of 78 places in 508 ms of which 1 ms to minimize.
[2021-05-14 18:02:28] [INFO ] Deduced a trap composed of 60 places in 514 ms of which 1 ms to minimize.
[2021-05-14 18:02:28] [INFO ] Deduced a trap composed of 110 places in 541 ms of which 2 ms to minimize.
[2021-05-14 18:02:29] [INFO ] Deduced a trap composed of 138 places in 533 ms of which 1 ms to minimize.
[2021-05-14 18:02:30] [INFO ] Deduced a trap composed of 152 places in 542 ms of which 1 ms to minimize.
[2021-05-14 18:02:31] [INFO ] Deduced a trap composed of 199 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:02:31] [INFO ] Deduced a trap composed of 76 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:02:32] [INFO ] Deduced a trap composed of 33 places in 493 ms of which 1 ms to minimize.
[2021-05-14 18:02:32] [INFO ] Deduced a trap composed of 69 places in 494 ms of which 4 ms to minimize.
[2021-05-14 18:02:33] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:02:34] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:02:34] [INFO ] Deduced a trap composed of 60 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:02:35] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:02:35] [INFO ] Deduced a trap composed of 111 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:02:36] [INFO ] Deduced a trap composed of 16 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:02:37] [INFO ] Deduced a trap composed of 63 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:02:37] [INFO ] Deduced a trap composed of 35 places in 451 ms of which 0 ms to minimize.
[2021-05-14 18:02:38] [INFO ] Deduced a trap composed of 68 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:02:38] [INFO ] Deduced a trap composed of 231 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:02:39] [INFO ] Deduced a trap composed of 93 places in 402 ms of which 1 ms to minimize.
[2021-05-14 18:02:39] [INFO ] Deduced a trap composed of 93 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:02:40] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:02:40] [INFO ] Deduced a trap composed of 30 places in 507 ms of which 1 ms to minimize.
[2021-05-14 18:02:41] [INFO ] Deduced a trap composed of 93 places in 469 ms of which 1 ms to minimize.
[2021-05-14 18:02:42] [INFO ] Deduced a trap composed of 186 places in 462 ms of which 1 ms to minimize.
[2021-05-14 18:02:42] [INFO ] Deduced a trap composed of 151 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:02:43] [INFO ] Deduced a trap composed of 157 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:02:43] [INFO ] Deduced a trap composed of 163 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:02:44] [INFO ] Deduced a trap composed of 122 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:02:44] [INFO ] Deduced a trap composed of 180 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:02:45] [INFO ] Deduced a trap composed of 122 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:02:45] [INFO ] Deduced a trap composed of 151 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:02:46] [INFO ] Deduced a trap composed of 93 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:02:46] [INFO ] Deduced a trap composed of 180 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:02:47] [INFO ] Deduced a trap composed of 180 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:02:47] [INFO ] Deduced a trap composed of 151 places in 316 ms of which 0 ms to minimize.
[2021-05-14 18:02:48] [INFO ] Deduced a trap composed of 151 places in 309 ms of which 1 ms to minimize.
[2021-05-14 18:02:48] [INFO ] Deduced a trap composed of 163 places in 353 ms of which 0 ms to minimize.
[2021-05-14 18:02:48] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 28701 ms
[2021-05-14 18:02:48] [INFO ] Computed and/alt/rep : 1723/3536/1723 causal constraints (skipped 84 transitions) in 105 ms.
[2021-05-14 18:03:00] [INFO ] Deduced a trap composed of 2 places in 600 ms of which 1 ms to minimize.
[2021-05-14 18:03:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Incomplete Parikh walk after 1019300 steps, including 1000 resets, run finished after 19079 ms. (steps per millisecond=53 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 945 out of 1324 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1324/1324 places, 2024/2024 transitions.
Applied a total of 0 rules in 50 ms. Remains 1324 /1324 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1324/1324 places, 2024/2024 transitions.
Starting structural reductions, iteration 0 : 1324/1324 places, 2024/2024 transitions.
Applied a total of 0 rules in 43 ms. Remains 1324 /1324 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2021-05-14 18:03:19] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1324 cols
[2021-05-14 18:03:19] [INFO ] Computed 27 place invariants in 29 ms
[2021-05-14 18:03:19] [INFO ] Implicit Places using invariants in 331 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 334 ms to find 7 implicit places.
[2021-05-14 18:03:20] [INFO ] Redundant transitions in 165 ms returned []
[2021-05-14 18:03:20] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:03:20] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-14 18:03:20] [INFO ] Dead Transitions using invariants and state equation in 896 ms returned []
Starting structural reductions, iteration 1 : 1317/1324 places, 2024/2024 transitions.
Applied a total of 0 rules in 35 ms. Remains 1317 /1317 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2021-05-14 18:03:21] [INFO ] Redundant transitions in 248 ms returned []
[2021-05-14 18:03:21] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:03:21] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-14 18:03:22] [INFO ] Dead Transitions using invariants and state equation in 871 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1317/1324 places, 2024/2024 transitions.
[2021-05-14 18:03:22] [INFO ] Flatten gal took : 133 ms
[2021-05-14 18:03:22] [INFO ] Flatten gal took : 115 ms
[2021-05-14 18:03:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14649440309967637033.gal : 11 ms
[2021-05-14 18:03:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17186374117946909183.prop : 193 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/ReachabilityCardinality14649440309967637033.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17186374117946909183.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/ReachabilityCardinality14649440309967637033.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17186374117946909183.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17186374117946909183.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :41 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 251
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :251 after 314
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :314 after 941
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :941 after 2044
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2044 after 12904
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12904 after 43636
Detected timeout of ITS tools.
[2021-05-14 18:03:41] [INFO ] Flatten gal took : 55 ms
[2021-05-14 18:03:41] [INFO ] Applying decomposition
[2021-05-14 18:03:41] [INFO ] Flatten gal took : 63 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/graph6922723334255562416.txt, -o, /tmp/graph6922723334255562416.bin, -w, /tmp/graph6922723334255562416.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/graph6922723334255562416.bin, -l, -1, -v, -w, /tmp/graph6922723334255562416.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 18:03:42] [INFO ] Decomposing Gal with order
[2021-05-14 18:03:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:03:42] [INFO ] Removed a total of 1792 redundant transitions.
[2021-05-14 18:03:42] [INFO ] Flatten gal took : 100 ms
[2021-05-14 18:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-14 18:03:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4001222454494138177.gal : 13 ms
[2021-05-14 18:03:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16871489978129999958.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4001222454494138177.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16871489978129999958.prop, --nowitness], 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/ReachabilityCardinality4001222454494138177.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16871489978129999958.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16871489978129999958.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7336653147147449768
[2021-05-14 18:03:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7336653147147449768
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/ltsmin7336653147147449768]
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/ltsmin7336653147147449768] 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/ltsmin7336653147147449768] 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 2 resets, run finished after 18703 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 239344 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=47 ) properties seen :{}
Interrupted Best-First random walk after 105800 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=21 ) properties seen :{}
Interrupted probabilistic random walk after 2258088 steps, run timeout after 30001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 2258088 steps, saw 998634 distinct states, run finished after 30001 ms. (steps per millisecond=75 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 18:04:57] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:04:57] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-14 18:04:57] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2021-05-14 18:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:04:58] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2021-05-14 18:04:58] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 18:04:58] [INFO ] [Real]Added 366 Read/Feed constraints in 83 ms returned sat
[2021-05-14 18:04:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:04:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 39 ms returned sat
[2021-05-14 18:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:05:00] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2021-05-14 18:05:00] [INFO ] [Nat]Added 366 Read/Feed constraints in 95 ms returned sat
[2021-05-14 18:05:00] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:05:01] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:05:02] [INFO ] Deduced a trap composed of 53 places in 446 ms of which 1 ms to minimize.
[2021-05-14 18:05:02] [INFO ] Deduced a trap composed of 54 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:05:03] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:05:03] [INFO ] Deduced a trap composed of 64 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:05:04] [INFO ] Deduced a trap composed of 166 places in 392 ms of which 0 ms to minimize.
[2021-05-14 18:05:04] [INFO ] Deduced a trap composed of 80 places in 421 ms of which 0 ms to minimize.
[2021-05-14 18:05:05] [INFO ] Deduced a trap composed of 45 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:05:05] [INFO ] Deduced a trap composed of 43 places in 407 ms of which 0 ms to minimize.
[2021-05-14 18:05:05] [INFO ] Deduced a trap composed of 58 places in 403 ms of which 1 ms to minimize.
[2021-05-14 18:05:06] [INFO ] Deduced a trap composed of 68 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:05:06] [INFO ] Deduced a trap composed of 68 places in 394 ms of which 1 ms to minimize.
[2021-05-14 18:05:07] [INFO ] Deduced a trap composed of 127 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:05:07] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 1 ms to minimize.
[2021-05-14 18:05:08] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:05:08] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 1 ms to minimize.
[2021-05-14 18:05:09] [INFO ] Deduced a trap composed of 127 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:05:09] [INFO ] Deduced a trap composed of 141 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:05:10] [INFO ] Deduced a trap composed of 88 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:05:11] [INFO ] Deduced a trap composed of 16 places in 435 ms of which 0 ms to minimize.
[2021-05-14 18:05:11] [INFO ] Deduced a trap composed of 16 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:05:12] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:05:12] [INFO ] Deduced a trap composed of 76 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:05:13] [INFO ] Deduced a trap composed of 64 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:05:13] [INFO ] Deduced a trap composed of 91 places in 475 ms of which 0 ms to minimize.
[2021-05-14 18:05:14] [INFO ] Deduced a trap composed of 91 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:05:14] [INFO ] Deduced a trap composed of 104 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:05:15] [INFO ] Deduced a trap composed of 91 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:05:20] [INFO ] Deduced a trap composed of 30 places in 5420 ms of which 1 ms to minimize.
[2021-05-14 18:05:21] [INFO ] Deduced a trap composed of 91 places in 459 ms of which 1 ms to minimize.
[2021-05-14 18:05:21] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 1 ms to minimize.
[2021-05-14 18:05:22] [INFO ] Deduced a trap composed of 88 places in 467 ms of which 1 ms to minimize.
[2021-05-14 18:05:23] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 1 ms to minimize.
[2021-05-14 18:05:23] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:05:24] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:05:24] [INFO ] Deduced a trap composed of 111 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:05:25] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:05:25] [INFO ] Deduced a trap composed of 105 places in 303 ms of which 1 ms to minimize.
[2021-05-14 18:05:26] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:05:26] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:05:27] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:05:27] [INFO ] Deduced a trap composed of 106 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:05:28] [INFO ] Deduced a trap composed of 85 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:05:28] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:05:29] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:05:30] [INFO ] Deduced a trap composed of 169 places in 406 ms of which 0 ms to minimize.
[2021-05-14 18:05:30] [INFO ] Deduced a trap composed of 41 places in 501 ms of which 1 ms to minimize.
[2021-05-14 18:05:31] [INFO ] Deduced a trap composed of 76 places in 381 ms of which 1 ms to minimize.
[2021-05-14 18:05:31] [INFO ] Deduced a trap composed of 142 places in 484 ms of which 1 ms to minimize.
[2021-05-14 18:05:32] [INFO ] Deduced a trap composed of 112 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:05:32] [INFO ] Deduced a trap composed of 59 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:05:33] [INFO ] Deduced a trap composed of 146 places in 494 ms of which 1 ms to minimize.
[2021-05-14 18:05:33] [INFO ] Deduced a trap composed of 97 places in 509 ms of which 1 ms to minimize.
[2021-05-14 18:05:34] [INFO ] Deduced a trap composed of 61 places in 487 ms of which 0 ms to minimize.
[2021-05-14 18:05:35] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2021-05-14 18:05:35] [INFO ] Deduced a trap composed of 120 places in 344 ms of which 1 ms to minimize.
[2021-05-14 18:05:35] [INFO ] Deduced a trap composed of 106 places in 368 ms of which 1 ms to minimize.
[2021-05-14 18:05:36] [INFO ] Deduced a trap composed of 120 places in 377 ms of which 0 ms to minimize.
[2021-05-14 18:05:36] [INFO ] Deduced a trap composed of 165 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:05:37] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 1 ms to minimize.
[2021-05-14 18:05:37] [INFO ] Deduced a trap composed of 30 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:05:38] [INFO ] Deduced a trap composed of 136 places in 282 ms of which 1 ms to minimize.
[2021-05-14 18:05:38] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2021-05-14 18:05:39] [INFO ] Deduced a trap composed of 106 places in 302 ms of which 1 ms to minimize.
[2021-05-14 18:05:39] [INFO ] Deduced a trap composed of 106 places in 276 ms of which 1 ms to minimize.
[2021-05-14 18:05:39] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 0 ms to minimize.
[2021-05-14 18:05:40] [INFO ] Deduced a trap composed of 136 places in 267 ms of which 1 ms to minimize.
[2021-05-14 18:05:40] [INFO ] Deduced a trap composed of 135 places in 288 ms of which 0 ms to minimize.
[2021-05-14 18:05:40] [INFO ] Deduced a trap composed of 138 places in 301 ms of which 0 ms to minimize.
[2021-05-14 18:05:41] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 0 ms to minimize.
[2021-05-14 18:05:41] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 1 ms to minimize.
[2021-05-14 18:05:42] [INFO ] Deduced a trap composed of 172 places in 287 ms of which 1 ms to minimize.
[2021-05-14 18:05:42] [INFO ] Deduced a trap composed of 177 places in 302 ms of which 1 ms to minimize.
[2021-05-14 18:05:42] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 1 ms to minimize.
[2021-05-14 18:05:43] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 1 ms to minimize.
[2021-05-14 18:05:43] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 42841 ms
[2021-05-14 18:05:43] [INFO ] Computed and/alt/rep : 1723/3536/1723 causal constraints (skipped 84 transitions) in 99 ms.
[2021-05-14 18:05:44] [INFO ] Deduced a trap composed of 2 places in 613 ms of which 1 ms to minimize.
[2021-05-14 18:05:44] [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-14 18:05:44] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned sat
[2021-05-14 18:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:05:49] [INFO ] [Real]Absence check using state equation in 4302 ms returned sat
[2021-05-14 18:05:49] [INFO ] [Real]Added 366 Read/Feed constraints in 101 ms returned sat
[2021-05-14 18:05:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:05:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2021-05-14 18:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:05:54] [INFO ] [Nat]Absence check using state equation in 4897 ms returned sat
[2021-05-14 18:05:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 105 ms returned sat
[2021-05-14 18:05:55] [INFO ] Deduced a trap composed of 41 places in 527 ms of which 1 ms to minimize.
[2021-05-14 18:05:55] [INFO ] Deduced a trap composed of 37 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:05:56] [INFO ] Deduced a trap composed of 151 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:05:56] [INFO ] Deduced a trap composed of 142 places in 408 ms of which 0 ms to minimize.
[2021-05-14 18:05:57] [INFO ] Deduced a trap composed of 115 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:05:57] [INFO ] Deduced a trap composed of 93 places in 456 ms of which 1 ms to minimize.
[2021-05-14 18:05:58] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:05:58] [INFO ] Deduced a trap composed of 107 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:05:59] [INFO ] Deduced a trap composed of 49 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:05:59] [INFO ] Deduced a trap composed of 93 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:06:00] [INFO ] Deduced a trap composed of 123 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:06:01] [INFO ] Deduced a trap composed of 151 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:06:01] [INFO ] Deduced a trap composed of 58 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:06:02] [INFO ] Deduced a trap composed of 58 places in 504 ms of which 1 ms to minimize.
[2021-05-14 18:06:02] [INFO ] Deduced a trap composed of 123 places in 504 ms of which 1 ms to minimize.
[2021-05-14 18:06:03] [INFO ] Deduced a trap composed of 56 places in 489 ms of which 1 ms to minimize.
[2021-05-14 18:06:03] [INFO ] Deduced a trap composed of 54 places in 459 ms of which 1 ms to minimize.
[2021-05-14 18:06:04] [INFO ] Deduced a trap composed of 74 places in 417 ms of which 1 ms to minimize.
[2021-05-14 18:06:04] [INFO ] Deduced a trap composed of 64 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:06:05] [INFO ] Deduced a trap composed of 101 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:06:05] [INFO ] Deduced a trap composed of 93 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:06:06] [INFO ] Deduced a trap composed of 88 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:06:07] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:06:07] [INFO ] Deduced a trap composed of 53 places in 448 ms of which 0 ms to minimize.
[2021-05-14 18:06:08] [INFO ] Deduced a trap composed of 197 places in 393 ms of which 1 ms to minimize.
[2021-05-14 18:06:08] [INFO ] Deduced a trap composed of 118 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:06:09] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:06:09] [INFO ] Deduced a trap composed of 153 places in 366 ms of which 1 ms to minimize.
[2021-05-14 18:06:10] [INFO ] Deduced a trap composed of 136 places in 345 ms of which 0 ms to minimize.
[2021-05-14 18:06:10] [INFO ] Deduced a trap composed of 111 places in 351 ms of which 1 ms to minimize.
[2021-05-14 18:06:11] [INFO ] Deduced a trap composed of 122 places in 361 ms of which 1 ms to minimize.
[2021-05-14 18:06:11] [INFO ] Deduced a trap composed of 122 places in 360 ms of which 1 ms to minimize.
[2021-05-14 18:06:11] [INFO ] Deduced a trap composed of 117 places in 357 ms of which 1 ms to minimize.
[2021-05-14 18:06:12] [INFO ] Deduced a trap composed of 106 places in 355 ms of which 1 ms to minimize.
[2021-05-14 18:06:12] [INFO ] Deduced a trap composed of 142 places in 304 ms of which 0 ms to minimize.
[2021-05-14 18:06:13] [INFO ] Deduced a trap composed of 153 places in 287 ms of which 1 ms to minimize.
[2021-05-14 18:06:13] [INFO ] Deduced a trap composed of 142 places in 303 ms of which 1 ms to minimize.
[2021-05-14 18:06:14] [INFO ] Deduced a trap composed of 117 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:06:14] [INFO ] Deduced a trap composed of 53 places in 403 ms of which 1 ms to minimize.
[2021-05-14 18:06:15] [INFO ] Deduced a trap composed of 93 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:06:16] [INFO ] Deduced a trap composed of 66 places in 391 ms of which 1 ms to minimize.
[2021-05-14 18:06:16] [INFO ] Deduced a trap composed of 126 places in 400 ms of which 1 ms to minimize.
[2021-05-14 18:06:17] [INFO ] Deduced a trap composed of 201 places in 401 ms of which 1 ms to minimize.
[2021-05-14 18:06:17] [INFO ] Deduced a trap composed of 50 places in 416 ms of which 1 ms to minimize.
[2021-05-14 18:06:18] [INFO ] Deduced a trap composed of 131 places in 406 ms of which 1 ms to minimize.
[2021-05-14 18:06:18] [INFO ] Deduced a trap composed of 180 places in 365 ms of which 1 ms to minimize.
[2021-05-14 18:06:19] [INFO ] Deduced a trap composed of 122 places in 413 ms of which 1 ms to minimize.
[2021-05-14 18:06:19] [INFO ] Deduced a trap composed of 129 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:06:20] [INFO ] Deduced a trap composed of 236 places in 394 ms of which 0 ms to minimize.
[2021-05-14 18:06:20] [INFO ] Deduced a trap composed of 100 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:06:21] [INFO ] Deduced a trap composed of 50 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:06:21] [INFO ] Deduced a trap composed of 118 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:06:22] [INFO ] Deduced a trap composed of 87 places in 426 ms of which 0 ms to minimize.
[2021-05-14 18:06:22] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 27826 ms
[2021-05-14 18:06:22] [INFO ] Computed and/alt/rep : 1723/3536/1723 causal constraints (skipped 84 transitions) in 112 ms.
[2021-05-14 18:06:34] [INFO ] Deduced a trap composed of 2 places in 586 ms of which 2 ms to minimize.
[2021-05-14 18:06:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Fused 2 Parikh solutions to 1 different solutions.
Support contains 945 out of 1317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1317/1317 places, 2024/2024 transitions.
Applied a total of 0 rules in 28 ms. Remains 1317 /1317 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1317/1317 places, 2024/2024 transitions.
Starting structural reductions, iteration 0 : 1317/1317 places, 2024/2024 transitions.
Applied a total of 0 rules in 30 ms. Remains 1317 /1317 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2021-05-14 18:06:34] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:06:34] [INFO ] Computed 20 place invariants in 9 ms
[2021-05-14 18:06:35] [INFO ] Implicit Places using invariants in 193 ms returned []
[2021-05-14 18:06:35] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:06:35] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-14 18:06:35] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 18:06:36] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2021-05-14 18:06:36] [INFO ] Redundant transitions in 31 ms returned []
[2021-05-14 18:06:36] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:06:36] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-14 18:06:37] [INFO ] Dead Transitions using invariants and state equation in 923 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1317/1317 places, 2024/2024 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1924 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-14 18:06:39] [INFO ] Flow matrix only has 1814 transitions (discarded 210 similar events)
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:06:39] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-14 18:06:39] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2021-05-14 18:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:06:40] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2021-05-14 18:06:40] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 18:06:40] [INFO ] [Real]Added 366 Read/Feed constraints in 86 ms returned sat
[2021-05-14 18:06:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:06:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2021-05-14 18:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:06:42] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2021-05-14 18:06:42] [INFO ] [Nat]Added 366 Read/Feed constraints in 98 ms returned sat
[2021-05-14 18:06:42] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 1 ms to minimize.
[2021-05-14 18:06:43] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:06:43] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 0 ms to minimize.
[2021-05-14 18:06:44] [INFO ] Deduced a trap composed of 54 places in 459 ms of which 0 ms to minimize.
[2021-05-14 18:06:44] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:06:45] [INFO ] Deduced a trap composed of 64 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:06:45] [INFO ] Deduced a trap composed of 166 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:06:46] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:06:46] [INFO ] Deduced a trap composed of 45 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:06:47] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:06:47] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 1 ms to minimize.
[2021-05-14 18:06:48] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 0 ms to minimize.
[2021-05-14 18:06:48] [INFO ] Deduced a trap composed of 68 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:06:49] [INFO ] Deduced a trap composed of 127 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:06:49] [INFO ] Deduced a trap composed of 61 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:06:50] [INFO ] Deduced a trap composed of 31 places in 475 ms of which 0 ms to minimize.
[2021-05-14 18:06:51] [INFO ] Deduced a trap composed of 16 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:06:51] [INFO ] Deduced a trap composed of 127 places in 425 ms of which 0 ms to minimize.
[2021-05-14 18:06:52] [INFO ] Deduced a trap composed of 141 places in 425 ms of which 1 ms to minimize.
[2021-05-14 18:06:52] [INFO ] Deduced a trap composed of 88 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:06:53] [INFO ] Deduced a trap composed of 16 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:06:53] [INFO ] Deduced a trap composed of 16 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:06:54] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 1 ms to minimize.
[2021-05-14 18:06:54] [INFO ] Deduced a trap composed of 76 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:06:55] [INFO ] Deduced a trap composed of 64 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:06:55] [INFO ] Deduced a trap composed of 91 places in 499 ms of which 1 ms to minimize.
[2021-05-14 18:06:56] [INFO ] Deduced a trap composed of 91 places in 452 ms of which 0 ms to minimize.
[2021-05-14 18:06:56] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:06:57] [INFO ] Deduced a trap composed of 91 places in 445 ms of which 1 ms to minimize.
[2021-05-14 18:06:57] [INFO ] Deduced a trap composed of 30 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:06:58] [INFO ] Deduced a trap composed of 91 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:06:59] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 0 ms to minimize.
[2021-05-14 18:06:59] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:07:00] [INFO ] Deduced a trap composed of 27 places in 516 ms of which 1 ms to minimize.
[2021-05-14 18:07:00] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:07:01] [INFO ] Deduced a trap composed of 2 places in 580 ms of which 1 ms to minimize.
[2021-05-14 18:07:01] [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-14 18:07:01] [INFO ] [Real]Absence check using 20 positive place invariants in 39 ms returned sat
[2021-05-14 18:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:07:06] [INFO ] [Real]Absence check using state equation in 4311 ms returned sat
[2021-05-14 18:07:06] [INFO ] [Real]Added 366 Read/Feed constraints in 99 ms returned sat
[2021-05-14 18:07:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:07:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 63 ms returned sat
[2021-05-14 18:07:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:07:11] [INFO ] [Nat]Absence check using state equation in 4862 ms returned sat
[2021-05-14 18:07:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 111 ms returned sat
[2021-05-14 18:07:11] [INFO ] Deduced a trap composed of 41 places in 530 ms of which 1 ms to minimize.
[2021-05-14 18:07:12] [INFO ] Deduced a trap composed of 37 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:07:13] [INFO ] Deduced a trap composed of 151 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:07:13] [INFO ] Deduced a trap composed of 142 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:07:14] [INFO ] Deduced a trap composed of 115 places in 452 ms of which 0 ms to minimize.
[2021-05-14 18:07:14] [INFO ] Deduced a trap composed of 93 places in 462 ms of which 0 ms to minimize.
[2021-05-14 18:07:15] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:07:15] [INFO ] Deduced a trap composed of 107 places in 439 ms of which 0 ms to minimize.
[2021-05-14 18:07:16] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:07:16] [INFO ] Deduced a trap composed of 93 places in 406 ms of which 1 ms to minimize.
[2021-05-14 18:07:17] [INFO ] Deduced a trap composed of 123 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:07:17] [INFO ] Deduced a trap composed of 151 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:07:18] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:07:19] [INFO ] Deduced a trap composed of 58 places in 507 ms of which 1 ms to minimize.
[2021-05-14 18:07:19] [INFO ] Deduced a trap composed of 123 places in 512 ms of which 1 ms to minimize.
[2021-05-14 18:07:20] [INFO ] Deduced a trap composed of 56 places in 511 ms of which 1 ms to minimize.
[2021-05-14 18:07:20] [INFO ] Deduced a trap composed of 54 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:07:21] [INFO ] Deduced a trap composed of 74 places in 412 ms of which 1 ms to minimize.
[2021-05-14 18:07:21] [INFO ] Deduced a trap composed of 64 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:07:22] [INFO ] Deduced a trap composed of 101 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:07:22] [INFO ] Deduced a trap composed of 93 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:07:23] [INFO ] Deduced a trap composed of 88 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:07:24] [INFO ] Deduced a trap composed of 57 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:07:24] [INFO ] Deduced a trap composed of 53 places in 421 ms of which 0 ms to minimize.
[2021-05-14 18:07:24] [INFO ] Deduced a trap composed of 197 places in 376 ms of which 1 ms to minimize.
[2021-05-14 18:07:25] [INFO ] Deduced a trap composed of 118 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:07:26] [INFO ] Deduced a trap composed of 46 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:07:26] [INFO ] Deduced a trap composed of 153 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:07:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 18:07:26] [INFO ] Flatten gal took : 49 ms
[2021-05-14 18:07:26] [INFO ] Flatten gal took : 50 ms
[2021-05-14 18:07:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2524813332224104911.gal : 6213 ms
[2021-05-14 18:07:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18139201089239875983.prop : 2 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/ReachabilityCardinality2524813332224104911.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18139201089239875983.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/ReachabilityCardinality2524813332224104911.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18139201089239875983.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18139201089239875983.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :41 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 251
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :251 after 314
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :314 after 941
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :941 after 2044
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2044 after 12904
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12904 after 43636
Detected timeout of ITS tools.
[2021-05-14 18:08:19] [INFO ] Flatten gal took : 49 ms
[2021-05-14 18:08:19] [INFO ] Applying decomposition
[2021-05-14 18:08:19] [INFO ] Flatten gal took : 48 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/graph14440737283020155556.txt, -o, /tmp/graph14440737283020155556.bin, -w, /tmp/graph14440737283020155556.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/graph14440737283020155556.bin, -l, -1, -v, -w, /tmp/graph14440737283020155556.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 18:08:19] [INFO ] Decomposing Gal with order
[2021-05-14 18:08:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:08:19] [INFO ] Removed a total of 1792 redundant transitions.
[2021-05-14 18:08:19] [INFO ] Flatten gal took : 103 ms
[2021-05-14 18:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-14 18:08:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8428298645463798359.gal : 15 ms
[2021-05-14 18:08:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5802383110514232455.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8428298645463798359.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5802383110514232455.prop, --nowitness], 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/ReachabilityCardinality8428298645463798359.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5802383110514232455.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5802383110514232455.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 96
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :96 after 2.73246e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14133134283552530921
[2021-05-14 18:08:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14133134283552530921
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/ltsmin14133134283552530921]
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/ltsmin14133134283552530921] killed by timeout after 2 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/ltsmin14133134283552530921] killed by timeout after 2 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 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1317 transition count 1814
Applied a total of 210 rules in 41 ms. Remains 1317 /1317 variables (removed 0) and now considering 1814/2024 (removed 210) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:08:42] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-14 18:08:42] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2021-05-14 18:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:08:43] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2021-05-14 18:08:44] [INFO ] Computed and/alt/rep : 1723/3068/1723 causal constraints (skipped 84 transitions) in 88 ms.
[2021-05-14 18:08:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:08:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2021-05-14 18:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:08:45] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2021-05-14 18:08:45] [INFO ] Computed and/alt/rep : 1723/3068/1723 causal constraints (skipped 84 transitions) in 93 ms.
[2021-05-14 18:09:05] [INFO ] Added : 985 causal constraints over 197 iterations in 20095 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-14 18:09:06] [INFO ] [Real]Absence check using 20 positive place invariants in 39 ms returned sat
[2021-05-14 18:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:09:10] [INFO ] [Real]Absence check using state equation in 4164 ms returned sat
[2021-05-14 18:09:10] [INFO ] Computed and/alt/rep : 1723/3068/1723 causal constraints (skipped 84 transitions) in 105 ms.
[2021-05-14 18:09:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:09:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2021-05-14 18:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:09:15] [INFO ] [Nat]Absence check using state equation in 4823 ms returned sat
[2021-05-14 18:09:15] [INFO ] Computed and/alt/rep : 1723/3068/1723 causal constraints (skipped 84 transitions) in 89 ms.
[2021-05-14 18:09:35] [INFO ] Added : 790 causal constraints over 158 iterations in 20115 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-14 18:09:36] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3822674131435168264
[2021-05-14 18:09:36] [INFO ] Too many transitions (2024) to apply POR reductions. Disabling POR matrices.
[2021-05-14 18:09:36] [INFO ] Flatten gal took : 75 ms
[2021-05-14 18:09:36] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3822674131435168264
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/ltsmin3822674131435168264]
[2021-05-14 18:09:36] [INFO ] Applying decomposition
[2021-05-14 18:09:36] [INFO ] Flatten gal took : 84 ms
[2021-05-14 18:09:36] [INFO ] Input system was already deterministic with 2024 transitions.
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/graph7160238633893469084.txt, -o, /tmp/graph7160238633893469084.bin, -w, /tmp/graph7160238633893469084.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/graph7160238633893469084.bin, -l, -1, -v, -w, /tmp/graph7160238633893469084.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 18:09:38] [INFO ] Decomposing Gal with order
[2021-05-14 18:09:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:09:38] [INFO ] Removed a total of 1792 redundant transitions.
[2021-05-14 18:09:38] [INFO ] Flatten gal took : 88 ms
[2021-05-14 18:09:38] [INFO ] Ran tautology test, simplified 0 / 2 in 2448 ms.
[2021-05-14 18:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2021-05-14 18:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11447318220244585859.gal : 9 ms
[2021-05-14 18:09:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16630045872796941383.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability11447318220244585859.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability16630045872796941383.prop, --nowitness], workingDir=/home/mcc/execution]
[2021-05-14 18:09:38] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-00(UNSAT) depth K=0 took 64 ms

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/ReachabilityFireability11447318220244585859.gal -t CGAL -reachable-file /tmp/ReachabilityFireability16630045872796941383.prop --nowitness
[2021-05-14 18:09:38] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-13(UNSAT) depth K=0 took 32 ms
[2021-05-14 18:09:38] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-00(UNSAT) depth K=1 took 63 ms
Loading property file /tmp/ReachabilityFireability16630045872796941383.prop.
[2021-05-14 18:09:39] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-13(UNSAT) depth K=1 took 368 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1814 out of 2024 initially.
// Phase 1: matrix 1814 rows 1317 cols
[2021-05-14 18:09:39] [INFO ] Computed 20 place invariants in 6 ms
inv : WantSection_4 + WantSection_5 = 1
inv : Turn_21 + Turn_22 + Turn_23 + Turn_24 + Turn_25 + Turn_26 + Turn_27 = 1
inv : WantSection_2 + AskForSection_6 + AskForSection_7 + AskForSection_8 + AskForSection_9 + AskForSection_10 + AskForSection_11 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + BeginLoop_42 + BeginLoop_43 + BeginLoop_44 + BeginLoop_45 + BeginLoop_46 + BeginLoop_47 + BeginLoop_48 + BeginLoop_49 + BeginLoop_50 + BeginLoop_51 + BeginLoop_52 + BeginLoop_53 + BeginLoop_54 + BeginLoop_55 + BeginLoop_56 + BeginLoop_57 + BeginLoop_58 + BeginLoop_59 + BeginLoop_60 + BeginLoop_61 + BeginLoop_62 + BeginLoop_63 + BeginLoop_64 + BeginLoop_65 + BeginLoop_66 + BeginLoop_67 + BeginLoop_68 + BeginLoop_69 + BeginLoop_70 + BeginLoop_71 + BeginLoop_72 + BeginLoop_73 + BeginLoop_74 + BeginLoop_75 + BeginLoop_76 + BeginLoop_77 + BeginLoop_78 + BeginLoop_79 + BeginLoop_80 + BeginLoop_81 + BeginLoop_82 + BeginLoop_83 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + CS_1 + TestIdentity_42 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_48 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_54 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestIdentity_60 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_66 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_72 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_78 + TestIdentity_79 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_49 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_55 + TestAlone_56 + TestAlone_58 + TestAlone_59 + TestAlone_60 + TestAlone_61 + TestAlone_62 + TestAlone_63 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_68 + TestAlone_69 + TestAlone_70 + TestAlone_72 + TestAlone_73 + TestAlone_74 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_79 + TestAlone_80 + TestAlone_81 + TestAlone_82 + TestAlone_83 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 = 1
inv : Turn_14 + Turn_15 + Turn_16 + Turn_17 + Turn_18 + Turn_19 + Turn_20 = 1
inv : WantSection_12 + AskForSection_36 + AskForSection_37 + AskForSection_38 + AskForSection_39 + AskForSection_40 + AskForSection_41 + TestTurn_36 + TestTurn_37 + TestTurn_38 + TestTurn_39 + TestTurn_40 + TestTurn_41 + BeginLoop_252 + BeginLoop_253 + BeginLoop_254 + BeginLoop_255 + BeginLoop_256 + BeginLoop_257 + BeginLoop_258 + BeginLoop_259 + BeginLoop_260 + BeginLoop_261 + BeginLoop_262 + BeginLoop_263 + BeginLoop_264 + BeginLoop_265 + BeginLoop_266 + BeginLoop_267 + BeginLoop_268 + BeginLoop_269 + BeginLoop_270 + BeginLoop_271 + BeginLoop_272 + BeginLoop_273 + BeginLoop_274 + BeginLoop_275 + BeginLoop_276 + BeginLoop_277 + BeginLoop_278 + BeginLoop_279 + BeginLoop_280 + BeginLoop_281 + BeginLoop_282 + BeginLoop_283 + BeginLoop_284 + BeginLoop_285 + BeginLoop_286 + BeginLoop_287 + BeginLoop_288 + BeginLoop_289 + BeginLoop_290 + BeginLoop_291 + BeginLoop_292 + BeginLoop_293 + EndTurn_36 + EndTurn_37 + EndTurn_38 + EndTurn_39 + EndTurn_40 + EndTurn_41 + CS_6 + TestIdentity_252 + TestIdentity_253 + TestIdentity_254 + TestIdentity_255 + TestIdentity_256 + TestIdentity_257 + TestIdentity_259 + TestIdentity_260 + TestIdentity_261 + TestIdentity_262 + TestIdentity_263 + TestIdentity_264 + TestIdentity_266 + TestIdentity_267 + TestIdentity_268 + TestIdentity_269 + TestIdentity_270 + TestIdentity_271 + TestIdentity_273 + TestIdentity_274 + TestIdentity_275 + TestIdentity_276 + TestIdentity_277 + TestIdentity_278 + TestIdentity_280 + TestIdentity_281 + TestIdentity_282 + TestIdentity_283 + TestIdentity_284 + TestIdentity_285 + TestIdentity_287 + TestIdentity_288 + TestIdentity_289 + TestIdentity_290 + TestIdentity_291 + TestIdentity_292 + TestAlone_252 + TestAlone_253 + TestAlone_254 + TestAlone_255 + TestAlone_256 + TestAlone_257 + TestAlone_259 + TestAlone_260 + TestAlone_261 + TestAlone_262 + TestAlone_263 + TestAlone_264 + TestAlone_266 + TestAlone_267 + TestAlone_268 + TestAlone_269 + TestAlone_270 + TestAlone_271 + TestAlone_273 + TestAlone_274 + TestAlone_275 + TestAlone_276 + TestAlone_277 + TestAlone_278 + TestAlone_280 + TestAlone_281 + TestAlone_282 + TestAlone_283 + TestAlone_284 + TestAlone_285 + TestAlone_287 + TestAlone_288 + TestAlone_289 + TestAlone_290 + TestAlone_291 + TestAlone_292 + IsEndLoop_252 + IsEndLoop_253 + IsEndLoop_254 + IsEndLoop_255 + IsEndLoop_256 + IsEndLoop_257 + IsEndLoop_258 + IsEndLoop_259 + IsEndLoop_260 + IsEndLoop_261 + IsEndLoop_262 + IsEndLoop_263 + IsEndLoop_264 + IsEndLoop_265 + IsEndLoop_266 + IsEndLoop_267 + IsEndLoop_268 + IsEndLoop_269 + IsEndLoop_270 + IsEndLoop_271 + IsEndLoop_272 + IsEndLoop_273 + IsEndLoop_274 + IsEndLoop_275 + IsEndLoop_276 + IsEndLoop_277 + IsEndLoop_278 + IsEndLoop_279 + IsEndLoop_280 + IsEndLoop_281 + IsEndLoop_282 + IsEndLoop_283 + IsEndLoop_284 + IsEndLoop_285 + IsEndLoop_286 + IsEndLoop_287 + IsEndLoop_288 + IsEndLoop_289 + IsEndLoop_290 + IsEndLoop_291 + IsEndLoop_292 + IsEndLoop_293 = 1
inv : Turn_35 + Turn_36 + Turn_37 + Turn_38 + Turn_39 + Turn_40 + Turn_41 = 1
inv : WantSection_0 + WantSection_1 = 1
inv : WantSection_8 + AskForSection_24 + AskForSection_25 + AskForSection_26 + AskForSection_27 + AskForSection_28 + AskForSection_29 + TestTurn_24 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_168 + BeginLoop_169 + BeginLoop_170 + BeginLoop_171 + BeginLoop_172 + BeginLoop_173 + BeginLoop_174 + BeginLoop_175 + BeginLoop_176 + BeginLoop_177 + BeginLoop_178 + BeginLoop_179 + BeginLoop_180 + BeginLoop_181 + BeginLoop_182 + BeginLoop_183 + BeginLoop_184 + BeginLoop_185 + BeginLoop_186 + BeginLoop_187 + BeginLoop_188 + BeginLoop_189 + BeginLoop_190 + BeginLoop_191 + BeginLoop_192 + BeginLoop_193 + BeginLoop_194 + BeginLoop_195 + BeginLoop_196 + BeginLoop_197 + BeginLoop_198 + BeginLoop_199 + BeginLoop_200 + BeginLoop_201 + BeginLoop_202 + BeginLoop_203 + BeginLoop_204 + BeginLoop_205 + BeginLoop_206 + BeginLoop_207 + BeginLoop_208 + BeginLoop_209 + EndTurn_24 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_4 + TestIdentity_168 + TestIdentity_169 + TestIdentity_170 + TestIdentity_171 + TestIdentity_172 + TestIdentity_173 + TestIdentity_174 + TestIdentity_175 + TestIdentity_176 + TestIdentity_177 + TestIdentity_178 + TestIdentity_179 + TestIdentity_180 + TestIdentity_181 + TestIdentity_182 + TestIdentity_183 + TestIdentity_184 + TestIdentity_185 + TestIdentity_186 + TestIdentity_187 + TestIdentity_188 + TestIdentity_189 + TestIdentity_190 + TestIdentity_191 + TestIdentity_192 + TestIdentity_193 + TestIdentity_194 + TestIdentity_195 + TestIdentity_196 + TestIdentity_197 + TestIdentity_198 + TestIdentity_199 + TestIdentity_200 + TestIdentity_201 + TestIdentity_202 + TestIdentity_203 + TestIdentity_204 + TestIdentity_205 + TestIdentity_206 + TestIdentity_207 + TestIdentity_208 + TestIdentity_209 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_173 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + TestAlone_180 + TestAlone_181 + TestAlone_182 + TestAlone_183 + TestAlone_184 + TestAlone_185 + TestAlone_187 + TestAlone_188 + TestAlone_189 + TestAlone_190 + TestAlone_191 + TestAlone_192 + TestAlone_194 + TestAlone_195 + TestAlone_196 + TestAlone_197 + TestAlone_198 + TestAlone_199 + TestAlone_201 + TestAlone_202 + TestAlone_203 + TestAlone_204 + TestAlone_205 + TestAlone_206 + TestAlone_208 + TestAlone_209 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_172 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_179 + IsEndLoop_180 + IsEndLoop_181 + IsEndLoop_182 + IsEndLoop_183 + IsEndLoop_184 + IsEndLoop_185 + IsEndLoop_186 + IsEndLoop_187 + IsEndLoop_188 + IsEndLoop_189 + IsEndLoop_190 + IsEndLoop_191 + IsEndLoop_192 + IsEndLoop_193 + IsEndLoop_194 + IsEndLoop_195 + IsEndLoop_196 + IsEndLoop_197 + IsEndLoop_198 + IsEndLoop_199 + IsEndLoop_200 + IsEndLoop_201 + IsEndLoop_202 + IsEndLoop_203 + IsEndLoop_204 + IsEndLoop_205 + IsEndLoop_206 + IsEndLoop_207 + IsEndLoop_208 + IsEndLoop_209 = 1
inv : Turn_28 + Turn_29 + Turn_30 + Turn_31 + Turn_32 + Turn_33 + Turn_34 = 1
inv : WantSection_10 + WantSection_11 = 1
inv : WantSection_12 + WantSection_13 = 1
inv : WantSection_6 + WantSection_7 = 1
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 + Turn_5 + Turn_6 = 1
inv : WantSection_2 + WantSection_3 = 1
inv : WantSection_4 + AskForSection_12 + AskForSection_13 + AskForSection_14 + AskForSection_15 + AskForSection_16 + AskForSection_17 + TestTurn_12 + TestTurn_13 + TestTurn_14 + TestTurn_15 + TestTurn_16 + TestTurn_17 + BeginLoop_84 + BeginLoop_85 + BeginLoop_86 + BeginLoop_87 + BeginLoop_88 + BeginLoop_89 + BeginLoop_90 + BeginLoop_91 + BeginLoop_92 + BeginLoop_93 + BeginLoop_94 + BeginLoop_95 + BeginLoop_96 + BeginLoop_97 + BeginLoop_98 + BeginLoop_99 + BeginLoop_100 + BeginLoop_101 + BeginLoop_102 + BeginLoop_103 + BeginLoop_104 + BeginLoop_105 + BeginLoop_106 + BeginLoop_107 + BeginLoop_108 + BeginLoop_109 + BeginLoop_110 + BeginLoop_111 + BeginLoop_112 + BeginLoop_113 + BeginLoop_114 + BeginLoop_115 + BeginLoop_116 + BeginLoop_117 + BeginLoop_118 + BeginLoop_119 + BeginLoop_120 + BeginLoop_121 + BeginLoop_122 + BeginLoop_123 + BeginLoop_124 + BeginLoop_125 + EndTurn_12 + EndTurn_13 + EndTurn_14 + EndTurn_15 + EndTurn_16 + EndTurn_17 + CS_2 + TestIdentity_84 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestIdentity_90 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_96 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestIdentity_100 + TestIdentity_101 + TestIdentity_102 + TestIdentity_103 + TestIdentity_104 + TestIdentity_105 + TestIdentity_106 + TestIdentity_107 + TestIdentity_108 + TestIdentity_109 + TestIdentity_110 + TestIdentity_111 + TestIdentity_112 + TestIdentity_113 + TestIdentity_114 + TestIdentity_115 + TestIdentity_116 + TestIdentity_117 + TestIdentity_118 + TestIdentity_119 + TestIdentity_120 + TestIdentity_121 + TestIdentity_122 + TestIdentity_123 + TestIdentity_124 + TestIdentity_125 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_99 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_105 + TestAlone_106 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_111 + TestAlone_112 + TestAlone_113 + TestAlone_115 + TestAlone_116 + TestAlone_117 + TestAlone_118 + TestAlone_119 + TestAlone_120 + TestAlone_122 + TestAlone_123 + TestAlone_124 + TestAlone_125 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_100 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_107 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_114 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 + IsEndLoop_120 + IsEndLoop_121 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 = 1
inv : WantSection_6 + AskForSection_18 + AskForSection_19 + AskForSection_20 + AskForSection_21 + AskForSection_22 + AskForSection_23 + TestTurn_18 + TestTurn_19 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + BeginLoop_126 + BeginLoop_127 + BeginLoop_128 + BeginLoop_129 + BeginLoop_130 + BeginLoop_131 + BeginLoop_132 + BeginLoop_133 + BeginLoop_134 + BeginLoop_135 + BeginLoop_136 + BeginLoop_137 + BeginLoop_138 + BeginLoop_139 + BeginLoop_140 + BeginLoop_141 + BeginLoop_142 + BeginLoop_143 + BeginLoop_144 + BeginLoop_145 + BeginLoop_146 + BeginLoop_147 + BeginLoop_148 + BeginLoop_149 + BeginLoop_150 + BeginLoop_151 + BeginLoop_152 + BeginLoop_153 + BeginLoop_154 + BeginLoop_155 + BeginLoop_156 + BeginLoop_157 + BeginLoop_158 + BeginLoop_159 + BeginLoop_160 + BeginLoop_161 + BeginLoop_162 + BeginLoop_163 + BeginLoop_164 + BeginLoop_165 + BeginLoop_166 + BeginLoop_167 + EndTurn_18 + EndTurn_19 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + CS_3 + TestIdentity_126 + TestIdentity_127 + TestIdentity_128 + TestIdentity_129 + TestIdentity_130 + TestIdentity_131 + TestIdentity_132 + TestIdentity_133 + TestIdentity_134 + TestIdentity_135 + TestIdentity_136 + TestIdentity_137 + TestIdentity_138 + TestIdentity_139 + TestIdentity_140 + TestIdentity_141 + TestIdentity_142 + TestIdentity_143 + TestIdentity_144 + TestIdentity_145 + TestIdentity_146 + TestIdentity_147 + TestIdentity_148 + TestIdentity_149 + TestIdentity_150 + TestIdentity_151 + TestIdentity_152 + TestIdentity_153 + TestIdentity_154 + TestIdentity_155 + TestIdentity_156 + TestIdentity_157 + TestIdentity_158 + TestIdentity_159 + TestIdentity_160 + TestIdentity_161 + TestIdentity_162 + TestIdentity_163 + TestIdentity_164 + TestIdentity_165 + TestIdentity_166 + TestIdentity_167 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_130 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_142 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_148 + TestAlone_149 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_155 + TestAlone_156 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_161 + TestAlone_162 + TestAlone_163 + TestAlone_165 + TestAlone_166 + TestAlone_167 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_129 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_136 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_143 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 + IsEndLoop_150 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_157 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_164 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 = 1
inv : WantSection_8 + WantSection_9 = 1
inv : Turn_7 + Turn_8 + Turn_9 + Turn_10 + Turn_11 + Turn_12 + Turn_13 = 1
inv : WantSection_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + AskForSection_4 + AskForSection_5 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + TestTurn_5 + BeginLoop_0 + BeginLoop_1 + BeginLoop_2 + BeginLoop_3 + BeginLoop_4 + BeginLoop_5 + BeginLoop_6 + BeginLoop_7 + BeginLoop_8 + BeginLoop_9 + BeginLoop_10 + BeginLoop_11 + BeginLoop_12 + BeginLoop_13 + BeginLoop_14 + BeginLoop_15 + BeginLoop_16 + BeginLoop_17 + BeginLoop_18 + BeginLoop_19 + BeginLoop_20 + BeginLoop_21 + BeginLoop_22 + BeginLoop_23 + BeginLoop_24 + BeginLoop_25 + BeginLoop_26 + BeginLoop_27 + BeginLoop_28 + BeginLoop_29 + BeginLoop_30 + BeginLoop_31 + BeginLoop_32 + BeginLoop_33 + BeginLoop_34 + BeginLoop_35 + BeginLoop_36 + BeginLoop_37 + BeginLoop_38 + BeginLoop_39 + BeginLoop_40 + BeginLoop_41 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + EndTurn_5 + CS_0 + TestIdentity_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_6 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_12 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_18 + TestIdentity_19 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_24 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestIdentity_30 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_36 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestIdentity_40 + TestIdentity_41 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_6 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_12 + TestAlone_13 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_18 + TestAlone_19 + TestAlone_20 + TestAlone_22 + TestAlone_23 + TestAlone_24 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_29 + TestAlone_30 + TestAlone_31 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_36 + TestAlone_37 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 = 1
inv : WantSection_10 + AskForSection_30 + AskForSection_31 + AskForSection_32 + AskForSection_33 + AskForSection_34 + AskForSection_35 + TestTurn_30 + TestTurn_31 + TestTurn_32 + TestTurn_33 + TestTurn_34 + TestTurn_35 + BeginLoop_210 + BeginLoop_211 + BeginLoop_212 + BeginLoop_213 + BeginLoop_214 + BeginLoop_215 + BeginLoop_216 + BeginLoop_217 + BeginLoop_218 + BeginLoop_219 + BeginLoop_220 + BeginLoop_221 + BeginLoop_222 + BeginLoop_223 + BeginLoop_224 + BeginLoop_225 + BeginLoop_226 + BeginLoop_227 + BeginLoop_228 + BeginLoop_229 + BeginLoop_230 + BeginLoop_231 + BeginLoop_232 + BeginLoop_233 + BeginLoop_234 + BeginLoop_235 + BeginLoop_236 + BeginLoop_237 + BeginLoop_238 + BeginLoop_239 + BeginLoop_240 + BeginLoop_241 + BeginLoop_242 + BeginLoop_243 + BeginLoop_244 + BeginLoop_245 + BeginLoop_246 + BeginLoop_247 + BeginLoop_248 + BeginLoop_249 + BeginLoop_250 + BeginLoop_251 + EndTurn_30 + EndTurn_31 + EndTurn_32 + EndTurn_33 + EndTurn_34 + EndTurn_35 + CS_5 + TestIdentity_210 + TestIdentity_211 + TestIdentity_212 + TestIdentity_213 + TestIdentity_214 + TestIdentity_215 + TestIdentity_216 + TestIdentity_217 + TestIdentity_218 + TestIdentity_219 + TestIdentity_220 + TestIdentity_221 + TestIdentity_222 + TestIdentity_223 + TestIdentity_224 + TestIdentity_225 + TestIdentity_226 + TestIdentity_227 + TestIdentity_228 + TestIdentity_229 + TestIdentity_230 + TestIdentity_231 + TestIdentity_232 + TestIdentity_233 + TestIdentity_234 + TestIdentity_235 + TestIdentity_236 + TestIdentity_237 + TestIdentity_238 + TestIdentity_239 + TestIdentity_240 + TestIdentity_241 + TestIdentity_242 + TestIdentity_243 + TestIdentity_244 + TestIdentity_245 + TestIdentity_246 + TestIdentity_247 + TestIdentity_248 + TestIdentity_249 + TestIdentity_250 + TestIdentity_251 + TestAlone_210 + TestAlone_211 + TestAlone_212 + TestAlone_213 + TestAlone_214 + TestAlone_216 + TestAlone_217 + TestAlone_218 + TestAlone_219 + TestAlone_220 + TestAlone_221 + TestAlone_223 + TestAlone_224 + TestAlone_225 + TestAlone_226 + TestAlone_227 + TestAlone_228 + TestAlone_230 + TestAlone_231 + TestAlone_232 + TestAlone_233 + TestAlone_234 + TestAlone_235 + TestAlone_237 + TestAlone_238 + TestAlone_239 + TestAlone_240 + TestAlone_241 + TestAlone_242 + TestAlone_244 + TestAlone_245 + TestAlone_246 + TestAlone_247 + TestAlone_248 + TestAlone_249 + TestAlone_251 + IsEndLoop_210 + IsEndLoop_211 + IsEndLoop_212 + IsEndLoop_213 + IsEndLoop_214 + IsEndLoop_215 + IsEndLoop_216 + IsEndLoop_217 + IsEndLoop_218 + IsEndLoop_219 + IsEndLoop_220 + IsEndLoop_221 + IsEndLoop_222 + IsEndLoop_223 + IsEndLoop_224 + IsEndLoop_225 + IsEndLoop_226 + IsEndLoop_227 + IsEndLoop_228 + IsEndLoop_229 + IsEndLoop_230 + IsEndLoop_231 + IsEndLoop_232 + IsEndLoop_233 + IsEndLoop_234 + IsEndLoop_235 + IsEndLoop_236 + IsEndLoop_237 + IsEndLoop_238 + IsEndLoop_239 + IsEndLoop_240 + IsEndLoop_241 + IsEndLoop_242 + IsEndLoop_243 + IsEndLoop_244 + IsEndLoop_245 + IsEndLoop_246 + IsEndLoop_247 + IsEndLoop_248 + IsEndLoop_249 + IsEndLoop_250 + IsEndLoop_251 = 1
Total of 20 invariants.
[2021-05-14 18:09:39] [INFO ] Computed 20 place invariants in 18 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2856
[2021-05-14 18:09:42] [INFO ] Proved 1317 variables to be positive in 2760 ms
[2021-05-14 18:09:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-00
[2021-05-14 18:09:42] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-00(SAT) depth K=0 took 333 ms
[2021-05-14 18:09:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-13
[2021-05-14 18:09:42] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-13(SAT) depth K=0 took 412 ms
[2021-05-14 18:09:43] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-00(UNSAT) depth K=2 took 4206 ms
[2021-05-14 18:09:46] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-13(UNSAT) depth K=2 took 2968 ms
[2021-05-14 18:09:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-00
[2021-05-14 18:09:47] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-00(SAT) depth K=1 took 4225 ms
[2021-05-14 18:09:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-13
[2021-05-14 18:09:50] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-13(SAT) depth K=1 took 2964 ms
Compilation finished in 43851 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3822674131435168264]
Link finished in 60 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, PetersonCOL6ReachabilityFireability00==true], workingDir=/tmp/ltsmin3822674131435168264]
[2021-05-14 18:10:24] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-00(UNSAT) depth K=3 took 37735 ms
[2021-05-14 18:11:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-00
[2021-05-14 18:11:34] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-00(SAT) depth K=2 took 104813 ms
[2021-05-14 18:11:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-13
[2021-05-14 18:11:47] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-13(SAT) depth K=2 took 12664 ms
[2021-05-14 18:13:55] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-13(UNSAT) depth K=3 took 211159 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2856 after 1.47046e+08
Detected timeout of ITS tools.
[2021-05-14 18:34:43] [INFO ] Applying decomposition
[2021-05-14 18:34:43] [INFO ] Flatten gal took : 461 ms
[2021-05-14 18:34:43] [INFO ] Decomposing Gal with order
[2021-05-14 18:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:34:44] [INFO ] Removed a total of 1876 redundant transitions.
[2021-05-14 18:34:45] [INFO ] Flatten gal took : 690 ms
[2021-05-14 18:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2021-05-14 18:34:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4377879937734655389.gal : 100 ms
[2021-05-14 18:34:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3774648349465757943.prop : 51 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/ReachabilityFireability4377879937734655389.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability3774648349465757943.prop, --nowitness], 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/ReachabilityFireability4377879937734655389.gal -t CGAL -reachable-file /tmp/ReachabilityFireability3774648349465757943.prop --nowitness
Loading property file /tmp/ReachabilityFireability3774648349465757943.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 169
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, PetersonCOL6ReachabilityFireability00==true], workingDir=/tmp/ltsmin3822674131435168264]
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, PetersonCOL6ReachabilityFireability13==true], workingDir=/tmp/ltsmin3822674131435168264]
[2021-05-14 18:44:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-00
[2021-05-14 18:44:11] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-00(SAT) depth K=3 took 1943729 ms

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="Peterson-COL-6"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-COL-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128100591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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