Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026700032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Peterson-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.7M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 483K Apr 30 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 30 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 30 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 30 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 877K May 10 09:34 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-PT-6-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655072136997

Running Version 0
[2022-06-12 22:15:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:15:39] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-12 22:15:39] [INFO ] Transformed 1330 places.
[2022-06-12 22:15:39] [INFO ] Transformed 2030 transitions.
[2022-06-12 22:15:39] [INFO ] Found NUPN structural information;
[2022-06-12 22:15:39] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-06-12 22:15:39] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 171 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 13) seen :3
FORMULA Peterson-PT-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-12 22:15:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-06-12 22:15:41] [INFO ] Computed 27 place invariants in 39 ms
[2022-06-12 22:15:41] [INFO ] [Real]Absence check using 20 positive place invariants in 48 ms returned unsat
[2022-06-12 22:15:41] [INFO ] [Real]Absence check using 20 positive place invariants in 37 ms returned unsat
[2022-06-12 22:15:42] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2022-06-12 22:15:42] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-06-12 22:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:42] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2022-06-12 22:15:42] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:15:43] [INFO ] [Real]Added 366 Read/Feed constraints in 89 ms returned sat
[2022-06-12 22:15:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:46] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned unsat
[2022-06-12 22:15:47] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2022-06-12 22:15:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2022-06-12 22:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:48] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2022-06-12 22:15:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 30 ms returned sat
[2022-06-12 22:15:48] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:49] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2022-06-12 22:15:49] [INFO ] [Nat]Added 366 Read/Feed constraints in 102 ms returned sat
[2022-06-12 22:15:50] [INFO ] Deduced a trap composed of 29 places in 657 ms of which 3 ms to minimize.
[2022-06-12 22:15:51] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 2 ms to minimize.
[2022-06-12 22:15:51] [INFO ] Deduced a trap composed of 59 places in 665 ms of which 2 ms to minimize.
[2022-06-12 22:15:52] [INFO ] Deduced a trap composed of 45 places in 586 ms of which 2 ms to minimize.
[2022-06-12 22:15:53] [INFO ] Deduced a trap composed of 39 places in 593 ms of which 6 ms to minimize.
[2022-06-12 22:15:53] [INFO ] Deduced a trap composed of 34 places in 604 ms of which 2 ms to minimize.
[2022-06-12 22:15:53] [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 5
[2022-06-12 22:15:53] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Real]Added 366 Read/Feed constraints in 87 ms returned sat
[2022-06-12 22:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:55] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-06-12 22:15:55] [INFO ] [Nat]Added 366 Read/Feed constraints in 101 ms returned sat
[2022-06-12 22:15:56] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 1 ms to minimize.
[2022-06-12 22:15:56] [INFO ] Deduced a trap composed of 42 places in 475 ms of which 1 ms to minimize.
[2022-06-12 22:15:57] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 1 ms to minimize.
[2022-06-12 22:15:57] [INFO ] Deduced a trap composed of 42 places in 441 ms of which 0 ms to minimize.
[2022-06-12 22:15:58] [INFO ] Deduced a trap composed of 42 places in 454 ms of which 1 ms to minimize.
[2022-06-12 22:15:58] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 1 ms to minimize.
[2022-06-12 22:15:59] [INFO ] Deduced a trap composed of 28 places in 425 ms of which 0 ms to minimize.
[2022-06-12 22:15:59] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:16:00] [INFO ] Deduced a trap composed of 2 places in 609 ms of which 1 ms to minimize.
[2022-06-12 22:16: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 6
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:01] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2022-06-12 22:16:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:16:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:02] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2022-06-12 22:16:02] [INFO ] [Nat]Added 366 Read/Feed constraints in 93 ms returned sat
[2022-06-12 22:16:03] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2022-06-12 22:16:03] [INFO ] Deduced a trap composed of 25 places in 520 ms of which 1 ms to minimize.
[2022-06-12 22:16:04] [INFO ] Deduced a trap composed of 22 places in 540 ms of which 1 ms to minimize.
[2022-06-12 22:16:04] [INFO ] Deduced a trap composed of 24 places in 554 ms of which 1 ms to minimize.
[2022-06-12 22:16:05] [INFO ] Deduced a trap composed of 24 places in 550 ms of which 1 ms to minimize.
[2022-06-12 22:16:06] [INFO ] Deduced a trap composed of 25 places in 554 ms of which 1 ms to minimize.
[2022-06-12 22:16:06] [INFO ] Deduced a trap composed of 98 places in 514 ms of which 2 ms to minimize.
[2022-06-12 22:16:06] [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 7
[2022-06-12 22:16:06] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:16:06] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:07] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2022-06-12 22:16:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:08] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:08] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-12 22:16:08] [INFO ] Solution in real domain found non-integer solution.
FORMULA Peterson-PT-6-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 1278 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 77 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.
[2022-06-12 22:16:09] [INFO ] Flatten gal took : 143 ms
[2022-06-12 22:16:09] [INFO ] Flatten gal took : 114 ms
[2022-06-12 22:16:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2205465955141902602.gal : 31 ms
[2022-06-12 22:16:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18393488026642449888.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/ReachabilityCardinality2205465955141902602.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18393488026642449888.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/ReachabilityCardinality2205465955141902602.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18393488026642449888.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18393488026642449888.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :12 after 46
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :46 after 74
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :74 after 103
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :103 after 249
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :249 after 793
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :793 after 3033
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3033 after 7792
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :7792 after 28905
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :28905 after 104553
Detected timeout of ITS tools.
[2022-06-12 22:16:24] [INFO ] Flatten gal took : 95 ms
[2022-06-12 22:16:24] [INFO ] Applying decomposition
[2022-06-12 22:16:24] [INFO ] Flatten gal took : 74 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/graph4682920235144873164.txt, -o, /tmp/graph4682920235144873164.bin, -w, /tmp/graph4682920235144873164.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/graph4682920235144873164.bin, -l, -1, -v, -w, /tmp/graph4682920235144873164.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:16:26] [INFO ] Decomposing Gal with order
[2022-06-12 22:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:16:28] [INFO ] Removed a total of 1134 redundant transitions.
[2022-06-12 22:16:28] [INFO ] Flatten gal took : 1991 ms
[2022-06-12 22:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 71 ms.
[2022-06-12 22:16:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1139055666833505317.gal : 18 ms
[2022-06-12 22:16:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10359735452489305577.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/ReachabilityCardinality1139055666833505317.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10359735452489305577.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/ReachabilityCardinality1139055666833505317.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10359735452489305577.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10359735452489305577.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20 after 25
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :25 after 82
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :82 after 743
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :743 after 1104
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1104 after 3224
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3224 after 6730
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :6730 after 31237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6741566605601718429
[2022-06-12 22:16:44] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6741566605601718429
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/ltsmin6741566605601718429]
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/ltsmin6741566605601718429] 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/ltsmin6741566605601718429] 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 5621 ms. (steps per millisecond=177 ) properties (out of 4) seen :1
FORMULA Peterson-PT-6-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 79288 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=15 ) properties seen :{0=1}
FORMULA Peterson-PT-6-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-12 22:16:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-06-12 22:16:57] [INFO ] Computed 27 place invariants in 14 ms
[2022-06-12 22:16:57] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:16:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:58] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2022-06-12 22:16:58] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:16:58] [INFO ] [Real]Added 366 Read/Feed constraints in 82 ms returned sat
[2022-06-12 22:16:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:16:58] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:59] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2022-06-12 22:16:59] [INFO ] [Nat]Added 366 Read/Feed constraints in 111 ms returned sat
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 42 places in 489 ms of which 2 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 1 ms to minimize.
[2022-06-12 22:17:01] [INFO ] Deduced a trap composed of 42 places in 461 ms of which 1 ms to minimize.
[2022-06-12 22:17:01] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 1 ms to minimize.
[2022-06-12 22:17:02] [INFO ] Deduced a trap composed of 42 places in 472 ms of which 0 ms to minimize.
[2022-06-12 22:17:02] [INFO ] Deduced a trap composed of 42 places in 458 ms of which 1 ms to minimize.
[2022-06-12 22:17:03] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2022-06-12 22:17:03] [INFO ] Deduced a trap composed of 12 places in 458 ms of which 1 ms to minimize.
[2022-06-12 22:17:04] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 1 ms to minimize.
[2022-06-12 22:17:04] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 1 ms to minimize.
[2022-06-12 22:17:05] [INFO ] Deduced a trap composed of 102 places in 460 ms of which 1 ms to minimize.
[2022-06-12 22:17:05] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
[2022-06-12 22:17:06] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 1 ms to minimize.
[2022-06-12 22:17:06] [INFO ] Deduced a trap composed of 68 places in 363 ms of which 1 ms to minimize.
[2022-06-12 22:17:07] [INFO ] Deduced a trap composed of 61 places in 409 ms of which 1 ms to minimize.
[2022-06-12 22:17:07] [INFO ] Deduced a trap composed of 57 places in 434 ms of which 1 ms to minimize.
[2022-06-12 22:17:08] [INFO ] Deduced a trap composed of 193 places in 438 ms of which 2 ms to minimize.
[2022-06-12 22:17:08] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 0 ms to minimize.
[2022-06-12 22:17:09] [INFO ] Deduced a trap composed of 58 places in 401 ms of which 0 ms to minimize.
[2022-06-12 22:17:09] [INFO ] Deduced a trap composed of 58 places in 426 ms of which 1 ms to minimize.
[2022-06-12 22:17:10] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 1 ms to minimize.
[2022-06-12 22:17:10] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 1 ms to minimize.
[2022-06-12 22:17:11] [INFO ] Deduced a trap composed of 117 places in 420 ms of which 1 ms to minimize.
[2022-06-12 22:17:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 11903 ms
[2022-06-12 22:17:11] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 102 ms.
[2022-06-12 22:17:31] [INFO ] Added : 925 causal constraints over 185 iterations in 20032 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-12 22:17:31] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:17:31] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:32] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2022-06-12 22:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:17:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:17:32] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:33] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2022-06-12 22:17:33] [INFO ] [Nat]Added 366 Read/Feed constraints in 99 ms returned sat
[2022-06-12 22:17:34] [INFO ] Deduced a trap composed of 25 places in 512 ms of which 1 ms to minimize.
[2022-06-12 22:17:34] [INFO ] Deduced a trap composed of 25 places in 545 ms of which 1 ms to minimize.
[2022-06-12 22:17:35] [INFO ] Deduced a trap composed of 22 places in 531 ms of which 1 ms to minimize.
[2022-06-12 22:17:36] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 1 ms to minimize.
[2022-06-12 22:17:36] [INFO ] Deduced a trap composed of 24 places in 519 ms of which 1 ms to minimize.
[2022-06-12 22:17:37] [INFO ] Deduced a trap composed of 25 places in 535 ms of which 1 ms to minimize.
[2022-06-12 22:17:37] [INFO ] Deduced a trap composed of 98 places in 464 ms of which 0 ms to minimize.
[2022-06-12 22:17:38] [INFO ] Deduced a trap composed of 146 places in 440 ms of which 1 ms to minimize.
[2022-06-12 22:17:38] [INFO ] Deduced a trap composed of 105 places in 508 ms of which 1 ms to minimize.
[2022-06-12 22:17:39] [INFO ] Deduced a trap composed of 80 places in 474 ms of which 1 ms to minimize.
[2022-06-12 22:17:40] [INFO ] Deduced a trap composed of 50 places in 438 ms of which 1 ms to minimize.
[2022-06-12 22:17:40] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 1 ms to minimize.
[2022-06-12 22:17:41] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 1 ms to minimize.
[2022-06-12 22:17:41] [INFO ] Deduced a trap composed of 45 places in 468 ms of which 1 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 1 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 219 places in 451 ms of which 1 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 219 places in 450 ms of which 1 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 65 places in 443 ms of which 5 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 210 places in 505 ms of which 1 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2022-06-12 22:17:45] [INFO ] Deduced a trap composed of 130 places in 345 ms of which 1 ms to minimize.
[2022-06-12 22:17:45] [INFO ] Deduced a trap composed of 130 places in 339 ms of which 1 ms to minimize.
[2022-06-12 22:17:46] [INFO ] Deduced a trap composed of 130 places in 346 ms of which 1 ms to minimize.
[2022-06-12 22:17:46] [INFO ] Deduced a trap composed of 223 places in 260 ms of which 1 ms to minimize.
[2022-06-12 22:17:46] [INFO ] Deduced a trap composed of 201 places in 266 ms of which 0 ms to minimize.
[2022-06-12 22:17:47] [INFO ] Deduced a trap composed of 184 places in 294 ms of which 0 ms to minimize.
[2022-06-12 22:17:47] [INFO ] Deduced a trap composed of 143 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:17:47] [INFO ] Deduced a trap composed of 130 places in 350 ms of which 1 ms to minimize.
[2022-06-12 22:17:48] [INFO ] Deduced a trap composed of 106 places in 347 ms of which 1 ms to minimize.
[2022-06-12 22:17:48] [INFO ] Deduced a trap composed of 130 places in 344 ms of which 1 ms to minimize.
[2022-06-12 22:17:49] [INFO ] Deduced a trap composed of 130 places in 338 ms of which 1 ms to minimize.
[2022-06-12 22:17:49] [INFO ] Deduced a trap composed of 182 places in 337 ms of which 1 ms to minimize.
[2022-06-12 22:17:50] [INFO ] Deduced a trap composed of 130 places in 345 ms of which 0 ms to minimize.
[2022-06-12 22:17:50] [INFO ] Deduced a trap composed of 130 places in 372 ms of which 1 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Deduced a trap composed of 106 places in 330 ms of which 1 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Deduced a trap composed of 99 places in 367 ms of which 1 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Deduced a trap composed of 152 places in 274 ms of which 0 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 18208 ms
[2022-06-12 22:17:52] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 83 ms.
[2022-06-12 22:18:12] [INFO ] Added : 915 causal constraints over 183 iterations in 20070 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 810000 steps, including 1000 resets, run finished after 1737 ms. (steps per millisecond=466 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 877200 steps, including 1000 resets, run finished after 1836 ms. (steps per millisecond=477 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 18 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 570 rules applied. Total rules applied 570 place count 1330 transition count 1460
Reduce places removed 570 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 577 rules applied. Total rules applied 1147 place count 760 transition count 1453
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1154 place count 753 transition count 1453
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 288 Pre rules applied. Total rules applied 1154 place count 753 transition count 1165
Deduced a syphon composed of 288 places in 1 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 3 with 576 rules applied. Total rules applied 1730 place count 465 transition count 1165
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1814 place count 423 transition count 1123
Applied a total of 1814 rules in 136 ms. Remains 423 /1330 variables (removed 907) and now considering 1123/2030 (removed 907) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/1330 places, 1123/2030 transitions.
[2022-06-12 22:18:15] [INFO ] Flatten gal took : 41 ms
[2022-06-12 22:18:15] [INFO ] Flatten gal took : 37 ms
[2022-06-12 22:18:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3537425513101884951.gal : 4 ms
[2022-06-12 22:18:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18340478954804457650.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3537425513101884951.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18340478954804457650.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/ReachabilityCardinality3537425513101884951.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18340478954804457650.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18340478954804457650.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :556 after 1795
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1795 after 4798
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4798 after 10034
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10034 after 43358
Detected timeout of ITS tools.
[2022-06-12 22:18:31] [INFO ] Flatten gal took : 36 ms
[2022-06-12 22:18:31] [INFO ] Applying decomposition
[2022-06-12 22:18:31] [INFO ] Flatten gal took : 35 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/graph9156656886315088628.txt, -o, /tmp/graph9156656886315088628.bin, -w, /tmp/graph9156656886315088628.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/graph9156656886315088628.bin, -l, -1, -v, -w, /tmp/graph9156656886315088628.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:18:31] [INFO ] Decomposing Gal with order
[2022-06-12 22:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:18:31] [INFO ] Removed a total of 1592 redundant transitions.
[2022-06-12 22:18:31] [INFO ] Flatten gal took : 70 ms
[2022-06-12 22:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 383 labels/synchronizations in 34 ms.
[2022-06-12 22:18:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1156197224693954330.gal : 10 ms
[2022-06-12 22:18:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1423371346107231154.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1156197224693954330.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1423371346107231154.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/ReachabilityCardinality1156197224693954330.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1423371346107231154.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1423371346107231154.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 6084
Reachability property Peterson-PT-6-ReachabilityCardinality-13 is true.
FORMULA Peterson-PT-6-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6.19818e+06 after 7.00395e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1624742634947675405
[2022-06-12 22:18:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1624742634947675405
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/ltsmin1624742634947675405]
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/ltsmin1624742634947675405] 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/ltsmin1624742634947675405] 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 1925 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9583432 steps, run timeout after 30001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 9583432 steps, saw 1203285 distinct states, run finished after 30001 ms. (steps per millisecond=319 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:19:19] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
// Phase 1: matrix 913 rows 423 cols
[2022-06-12 22:19:19] [INFO ] Computed 27 place invariants in 8 ms
[2022-06-12 22:19:19] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-12 22:19:19] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-12 22:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:20] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-12 22:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-06-12 22:19:20] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-12 22:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:20] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-06-12 22:19:20] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:19:20] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4371 ms
[2022-06-12 22:19:24] [INFO ] Computed and/alt/rep : 822/2845/822 causal constraints (skipped 84 transitions) in 47 ms.
[2022-06-12 22:19:31] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:19:33] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:19:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1296 ms
[2022-06-12 22:19:33] [INFO ] Added : 646 causal constraints over 130 iterations in 8390 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 244600 steps, including 1000 resets, run finished after 388 ms. (steps per millisecond=630 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1123/1123 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 423 transition count 1119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 419 transition count 1119
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 8 place count 419 transition count 1108
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 30 place count 408 transition count 1108
Applied a total of 30 rules in 32 ms. Remains 408 /423 variables (removed 15) and now considering 1108/1123 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 408/423 places, 1108/1123 transitions.
[2022-06-12 22:19:33] [INFO ] Flatten gal took : 31 ms
[2022-06-12 22:19:33] [INFO ] Flatten gal took : 30 ms
[2022-06-12 22:19:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8161969565337181621.gal : 4 ms
[2022-06-12 22:19:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5773036365451188793.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8161969565337181621.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5773036365451188793.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/ReachabilityCardinality8161969565337181621.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5773036365451188793.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5773036365451188793.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :140 after 310
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :310 after 560
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :560 after 1985
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1985 after 5482
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5482 after 10089
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10089 after 44012
Detected timeout of ITS tools.
[2022-06-12 22:19:48] [INFO ] Flatten gal took : 33 ms
[2022-06-12 22:19:48] [INFO ] Applying decomposition
[2022-06-12 22:19:48] [INFO ] Flatten gal took : 31 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/graph16442365053554055213.txt, -o, /tmp/graph16442365053554055213.bin, -w, /tmp/graph16442365053554055213.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/graph16442365053554055213.bin, -l, -1, -v, -w, /tmp/graph16442365053554055213.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:19:48] [INFO ] Decomposing Gal with order
[2022-06-12 22:19:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:19:49] [INFO ] Removed a total of 1578 redundant transitions.
[2022-06-12 22:19:49] [INFO ] Flatten gal took : 80 ms
[2022-06-12 22:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 407 labels/synchronizations in 21 ms.
[2022-06-12 22:19:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5915651649044318620.gal : 7 ms
[2022-06-12 22:19:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16640132221206075336.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5915651649044318620.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16640132221206075336.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/ReachabilityCardinality5915651649044318620.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16640132221206075336.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16640132221206075336.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 340
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12233243306888105847
[2022-06-12 22:20:04] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12233243306888105847
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/ltsmin12233243306888105847]
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/ltsmin12233243306888105847] 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/ltsmin12233243306888105847] 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 1776 ms. (steps per millisecond=563 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10064656 steps, run timeout after 30001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 10064656 steps, saw 1264795 distinct states, run finished after 30005 ms. (steps per millisecond=335 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:20:37] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2022-06-12 22:20:37] [INFO ] Computed 27 place invariants in 9 ms
[2022-06-12 22:20:37] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:20:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-12 22:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:37] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-12 22:20:37] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:20:37] [INFO ] [Real]Added 366 Read/Feed constraints in 38 ms returned sat
[2022-06-12 22:20:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-12 22:20:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:38] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-12 22:20:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 36 ms returned sat
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3263 ms
[2022-06-12 22:20:41] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 45 ms.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 787 ms
[2022-06-12 22:20:45] [INFO ] Added : 368 causal constraints over 74 iterations in 4437 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 81900 steps, including 1000 resets, run finished after 140 ms. (steps per millisecond=585 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 5 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 19 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 408/408 places, 1108/1108 transitions.
Starting structural reductions, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 20 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2022-06-12 22:20:46] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2022-06-12 22:20:46] [INFO ] Computed 27 place invariants in 3 ms
[2022-06-12 22:20:46] [INFO ] Implicit Places using invariants in 379 ms returned [389, 390, 392, 400, 401, 403]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 382 ms to find 6 implicit places.
[2022-06-12 22:20:46] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-12 22:20:46] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:20:46] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:20:46] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Starting structural reductions, iteration 1 : 402/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 18 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2022-06-12 22:20:46] [INFO ] Redundant transitions in 14 ms returned []
[2022-06-12 22:20:46] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:20:46] [INFO ] Computed 21 place invariants in 5 ms
[2022-06-12 22:20:47] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Finished structural reductions, in 2 iterations. Remains : 402/408 places, 1108/1108 transitions.
[2022-06-12 22:20:47] [INFO ] Flatten gal took : 27 ms
[2022-06-12 22:20:47] [INFO ] Flatten gal took : 28 ms
[2022-06-12 22:20:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17751260538226749879.gal : 3 ms
[2022-06-12 22:20:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14737889827955993313.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17751260538226749879.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14737889827955993313.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/ReachabilityCardinality17751260538226749879.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14737889827955993313.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14737889827955993313.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :556 after 2010
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2010 after 4676
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4676 after 10138
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10138 after 54571
Detected timeout of ITS tools.
[2022-06-12 22:21:07] [INFO ] Flatten gal took : 27 ms
[2022-06-12 22:21:07] [INFO ] Applying decomposition
[2022-06-12 22:21:07] [INFO ] Flatten gal took : 27 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/graph17953460346780734199.txt, -o, /tmp/graph17953460346780734199.bin, -w, /tmp/graph17953460346780734199.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/graph17953460346780734199.bin, -l, -1, -v, -w, /tmp/graph17953460346780734199.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:21:07] [INFO ] Decomposing Gal with order
[2022-06-12 22:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:21:07] [INFO ] Removed a total of 1579 redundant transitions.
[2022-06-12 22:21:07] [INFO ] Flatten gal took : 61 ms
[2022-06-12 22:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 397 labels/synchronizations in 16 ms.
[2022-06-12 22:21:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16318712496291478434.gal : 7 ms
[2022-06-12 22:21:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7330678154019771561.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16318712496291478434.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7330678154019771561.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/ReachabilityCardinality16318712496291478434.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7330678154019771561.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7330678154019771561.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 11060
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1463094294251127429
[2022-06-12 22:21:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1463094294251127429
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/ltsmin1463094294251127429]
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/ltsmin1463094294251127429] 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/ltsmin1463094294251127429] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10172024 steps, run timeout after 30001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 10172024 steps, saw 1279469 distinct states, run finished after 30001 ms. (steps per millisecond=339 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:22:02] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:22:02] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:22:02] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-12 22:22:02] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 22:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:02] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-12 22:22:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-06-12 22:22:02] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 22:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:02] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-12 22:22:02] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:22:02] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2022-06-12 22:22:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:22:02] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:22:02] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1923 ms
[2022-06-12 22:22:04] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 44 ms.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2453 ms
[2022-06-12 22:22:13] [INFO ] Added : 641 causal constraints over 129 iterations in 9187 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 193700 steps, including 1000 resets, run finished after 274 ms. (steps per millisecond=706 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 5 out of 402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 1108/1108 transitions.
Starting structural reductions, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 18 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2022-06-12 22:22:14] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:22:14] [INFO ] Computed 21 place invariants in 2 ms
[2022-06-12 22:22:14] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-06-12 22:22:14] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:22:14] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:22:14] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:22:16] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2022-06-12 22:22:16] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-12 22:22:16] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:22:16] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:22:16] [INFO ] Dead Transitions using invariants and state equation in 354 ms returned []
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 1108/1108 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 22:22:16] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:22:16] [INFO ] Computed 21 place invariants in 6 ms
[2022-06-12 22:22:16] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:22:16] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:17] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-06-12 22:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-06-12 22:22:17] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 22:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:17] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-06-12 22:22:17] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:22:17] [INFO ] [Nat]Added 366 Read/Feed constraints in 36 ms returned sat
[2022-06-12 22:22:17] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:22:17] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:22:17] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:22:17] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1960 ms
[2022-06-12 22:22:19] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 53 ms.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2442 ms
[2022-06-12 22:22:28] [INFO ] Added : 641 causal constraints over 129 iterations in 9231 ms. Result :sat
[2022-06-12 22:22:28] [INFO ] Flatten gal took : 42 ms
[2022-06-12 22:22:28] [INFO ] Flatten gal took : 26 ms
[2022-06-12 22:22:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2869904981316995322.gal : 3 ms
[2022-06-12 22:22:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1020738073841928436.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2869904981316995322.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1020738073841928436.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/ReachabilityCardinality2869904981316995322.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1020738073841928436.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1020738073841928436.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :556 after 2010
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2010 after 4676
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4676 after 10138
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10138 after 54571
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :54571 after 120152
Detected timeout of ITS tools.
[2022-06-12 22:22:53] [INFO ] Flatten gal took : 29 ms
[2022-06-12 22:22:53] [INFO ] Applying decomposition
[2022-06-12 22:22:53] [INFO ] Flatten gal took : 26 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/graph13152514729963234003.txt, -o, /tmp/graph13152514729963234003.bin, -w, /tmp/graph13152514729963234003.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/graph13152514729963234003.bin, -l, -1, -v, -w, /tmp/graph13152514729963234003.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:22:53] [INFO ] Decomposing Gal with order
[2022-06-12 22:22:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:22:53] [INFO ] Removed a total of 1579 redundant transitions.
[2022-06-12 22:22:53] [INFO ] Flatten gal took : 75 ms
[2022-06-12 22:22:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 15 ms.
[2022-06-12 22:22:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2236995264343404445.gal : 9 ms
[2022-06-12 22:22:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8073495807916873165.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2236995264343404445.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8073495807916873165.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/ReachabilityCardinality2236995264343404445.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8073495807916873165.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8073495807916873165.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 956
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :956 after 1290
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15747814686602860425
[2022-06-12 22:23:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15747814686602860425
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/ltsmin15747814686602860425]
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/ltsmin15747814686602860425] 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/ltsmin15747814686602860425] 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)
Graph (trivial) has 823 edges and 402 vertex of which 276 / 402 are part of one of the 40 SCC in 4 ms
Free SCC test removed 236 places
Drop transitions removed 472 transitions
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 721 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 387
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 2 place count 165 transition count 348
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 126 transition count 348
Performed 9 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 117 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 117 transition count 331
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 121 place count 104 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 55 edges and 104 vertex of which 36 / 104 are part of one of the 5 SCC in 0 ms
Free SCC test removed 31 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 73 transition count 330
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (trivial) has 124 edges and 70 vertex of which 18 / 70 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 3 with 41 rules applied. Total rules applied 164 place count 58 transition count 293
Drop transitions removed 36 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 4 with 134 rules applied. Total rules applied 298 place count 58 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 57 transition count 158
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 310 place count 57 transition count 148
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 313 place count 57 transition count 145
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 317 place count 54 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 318 place count 53 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 319 place count 53 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 320 place count 53 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 321 place count 52 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 322 place count 52 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 323 place count 51 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 324 place count 51 transition count 141
Applied a total of 324 rules in 45 ms. Remains 51 /402 variables (removed 351) and now considering 141/1108 (removed 967) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 51 cols
[2022-06-12 22:23:21] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-12 22:23:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-06-12 22:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:21] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-12 22:23:21] [INFO ] Computed and/alt/rep : 124/640/124 causal constraints (skipped 0 transitions) in 6 ms.
[2022-06-12 22:23:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-12 22:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-12 22:23:21] [INFO ] Computed and/alt/rep : 124/640/124 causal constraints (skipped 0 transitions) in 6 ms.
[2022-06-12 22:23:21] [INFO ] Added : 96 causal constraints over 20 iterations in 195 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-12 22:23:21] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2593621349537267802
[2022-06-12 22:23:21] [INFO ] Computing symmetric may disable matrix : 1108 transitions.
[2022-06-12 22:23:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:23:21] [INFO ] Applying decomposition
[2022-06-12 22:23:21] [INFO ] Computing symmetric may enable matrix : 1108 transitions.
[2022-06-12 22:23:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:23:21] [INFO ] Flatten gal took : 117 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/graph10016376594822371850.txt, -o, /tmp/graph10016376594822371850.bin, -w, /tmp/graph10016376594822371850.weights], workingDir=null]
[2022-06-12 22:23:21] [INFO ] Flatten gal took : 90 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10016376594822371850.bin, -l, -1, -v, -w, /tmp/graph10016376594822371850.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:23:21] [INFO ] Decomposing Gal with order
[2022-06-12 22:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:23:21] [INFO ] Input system was already deterministic with 1108 transitions.
[2022-06-12 22:23:22] [INFO ] Computing Do-Not-Accords matrix : 1108 transitions.
[2022-06-12 22:23:22] [INFO ] Removed a total of 1579 redundant transitions.
[2022-06-12 22:23:22] [INFO ] Flatten gal took : 124 ms
[2022-06-12 22:23:22] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:23:22] [INFO ] Built C files in 547ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2593621349537267802
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/ltsmin2593621349537267802]
[2022-06-12 22:23:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 405 labels/synchronizations in 28 ms.
[2022-06-12 22:23:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14798012151462679670.gal : 8 ms
[2022-06-12 22:23:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9821252145609422095.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14798012151462679670.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9821252145609422095.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/ReachabilityCardinality14798012151462679670.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9821252145609422095.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9821252145609422095.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 110
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :110 after 260
[2022-06-12 22:23:22] [INFO ] Ran tautology test, simplified 0 / 1 in 900 ms.
[2022-06-12 22:23:22] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-12(UNSAT) depth K=0 took 17 ms
[2022-06-12 22:23:22] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-12(UNSAT) depth K=1 took 10 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 898 out of 1108 initially.
// Phase 1: matrix 898 rows 402 cols
[2022-06-12 22:23:23] [INFO ] Computed 21 place invariants in 13 ms
inv : WantSection_4_T + WantSection_4_F = 1
inv : WantSection_3_T + Idle_3 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + EndTurn_5_1 + EndTurn_5_2 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_4_2 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + AskForSection_5_0 = 1
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : WantSection_5_T + WantSection_5_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + WantSection_2_F + TestAlone_2_3_0 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + AskForSection_2_0 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + WantSection_4_F + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + AskForSection_4_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + WantSection_1_F + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + AskForSection_1_0 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + Idle_3 + AskForSection_3_0 = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + WantSection_0_F + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + AskForSection_0_0 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_5_4 + EndTurn_6_1 + EndTurn_6_2 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + WantSection_6_F + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + AskForSection_6_0 = 1
Total of 21 invariants.
[2022-06-12 22:23:23] [INFO ] Computed 21 place invariants in 15 ms
[2022-06-12 22:23:23] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-12(UNSAT) depth K=2 took 978 ms
[2022-06-12 22:23:26] [INFO ] Proved 402 variables to be positive in 2812 ms
[2022-06-12 22:23:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-12
[2022-06-12 22:23:26] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-12(SAT) depth K=0 took 79 ms
[2022-06-12 22:23:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-12
[2022-06-12 22:23:27] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-12(SAT) depth K=1 took 1390 ms
[2022-06-12 22:23:27] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-12(UNSAT) depth K=3 took 4042 ms
Compilation finished in 9418 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2593621349537267802]
Link finished in 75 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, PetersonPT6ReachabilityCardinality12==true], workingDir=/tmp/ltsmin2593621349537267802]
[2022-06-12 22:26:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-12
[2022-06-12 22:26:02] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-12(SAT) depth K=2 took 154959 ms
[2022-06-12 22:30:09] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-12(UNSAT) depth K=4 took 401445 ms
Detected timeout of ITS tools.
[2022-06-12 22:45:56] [INFO ] Applying decomposition
[2022-06-12 22:45:57] [INFO ] Flatten gal took : 100 ms
[2022-06-12 22:45:57] [INFO ] Decomposing Gal with order
[2022-06-12 22:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:45:57] [INFO ] Removed a total of 1579 redundant transitions.
[2022-06-12 22:45:57] [INFO ] Flatten gal took : 219 ms
[2022-06-12 22:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 85 ms.
[2022-06-12 22:45:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12848848154232849500.gal : 14 ms
[2022-06-12 22:45:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16166416672322161119.prop : 692 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/ReachabilityCardinality12848848154232849500.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16166416672322161119.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/ReachabilityCardinality12848848154232849500.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16166416672322161119.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16166416672322161119.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1231
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1231 after 1320
[2022-06-12 22:55:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-12
[2022-06-12 22:55:00] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-12(SAT) depth K=3 took 1737769 ms
Reachability property Peterson-PT-6-ReachabilityCardinality-12 is true.
FORMULA Peterson-PT-6-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.4083e+08,387.139,6468052,123889,1282,1.22019e+07,16655,2047,1.93015e+07,146,147730,0
Total reachable state count : 440830096

Verifying 1 reachability properties.
Reachability property Peterson-PT-6-ReachabilityCardinality-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-6-ReachabilityCardinality-12,4,390.668,6468052,66,58,1.22019e+07,16655,2022,1.93015e+07,151,147730,0
ITS tools runner thread asked to quit. Dying gracefully.
[2022-06-12 23:03:48] [WARNING] Interrupting SMT solver.
[2022-06-12 23:03:48] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 23:03:48] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-6-ReachabilityCardinality-12 K-induction depth 4
Exception in thread "Thread-32" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2022-06-12 23:03:48] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 23:03:48] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-6-ReachabilityCardinality-12 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2022-06-12 23:03:48] [INFO ] During BMC, SMT solver timed out at depth 5
[2022-06-12 23:03:48] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2022-06-12 23:03:48] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1655075032040

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Peterson-PT-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;