About the Execution of 2021-gold for FunctionPointer-PT-a128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14165.199 | 3600000.00 | 10968943.00 | 7676.70 | TF?TT?FTFT?TFFTT | normal |
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.r323-tall-165472292700155.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 FunctionPointer-PT-a128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292700155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Jun 7 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 7 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 34K Jun 6 12:11 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 FunctionPointer-PT-a128-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654756024831
Running Version 0
[2022-06-09 06:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 06:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 06:27:06] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-06-09 06:27:06] [INFO ] Transformed 40 places.
[2022-06-09 06:27:06] [INFO ] Transformed 70 transitions.
[2022-06-09 06:27:06] [INFO ] Parsed PT model containing 40 places and 70 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-09 06:27:06] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2022-06-09 06:27:06] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 06:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 06:27:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 06:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 06:27:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 06:27:07] [INFO ] [Real]Added 26 Read/Feed constraints in 17 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2022-06-09 06:27:07] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2022-06-09 06:27:07] [INFO ] Added : 18 causal constraints over 4 iterations in 40 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2022-06-09 06:27:07] [INFO ] Added : 19 causal constraints over 5 iterations in 47 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2022-06-09 06:27:07] [INFO ] Added : 19 causal constraints over 4 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2022-06-09 06:27:07] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 06:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:27:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 06:27:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-06-09 06:27:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2022-06-09 06:27:07] [INFO ] Added : 19 causal constraints over 4 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 06:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 72400 steps, including 803 resets, run finished after 100 ms. (steps per millisecond=724 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 218100 steps, including 800 resets, run finished after 276 ms. (steps per millisecond=790 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 101700 steps, including 394 resets, run finished after 147 ms. (steps per millisecond=691 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 196300 steps, including 979 resets, run finished after 198 ms. (steps per millisecond=991 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 131800 steps, including 999 resets, run finished after 133 ms. (steps per millisecond=990 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 200500 steps, including 792 resets, run finished after 182 ms. (steps per millisecond=1101 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 19 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 31 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 31 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 31 transition count 60
Applied a total of 7 rules in 21 ms. Remains 31 /34 variables (removed 3) and now considering 60/66 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/34 places, 60/66 transitions.
[2022-06-09 06:27:08] [INFO ] Flatten gal took : 26 ms
[2022-06-09 06:27:08] [INFO ] Flatten gal took : 8 ms
[2022-06-09 06:27:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12255220642643168352.gal : 5 ms
[2022-06-09 06:27:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6250432843225910985.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/ReachabilityCardinality12255220642643168352.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6250432843225910985.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/ReachabilityCardinality12255220642643168352.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6250432843225910985.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6250432843225910985.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 132
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5312 after 485149
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :485149 after 6.95408e+07
Detected timeout of ITS tools.
[2022-06-09 06:27:24] [INFO ] Flatten gal took : 12 ms
[2022-06-09 06:27:24] [INFO ] Applying decomposition
[2022-06-09 06:27:24] [INFO ] Flatten gal took : 7 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/graph4349131972383958613.txt, -o, /tmp/graph4349131972383958613.bin, -w, /tmp/graph4349131972383958613.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/graph4349131972383958613.bin, -l, -1, -v, -w, /tmp/graph4349131972383958613.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:27:24] [INFO ] Decomposing Gal with order
[2022-06-09 06:27:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:27:24] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 06:27:24] [INFO ] Flatten gal took : 28 ms
[2022-06-09 06:27:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2022-06-09 06:27:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6067619747603659230.gal : 3 ms
[2022-06-09 06:27:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6380377454379645759.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/ReachabilityCardinality6067619747603659230.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6380377454379645759.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/ReachabilityCardinality6067619747603659230.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6380377454379645759.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6380377454379645759.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 108
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :108 after 2575
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2575 after 139061
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :139061 after 1.1859e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18085505668099713491
[2022-06-09 06:27:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18085505668099713491
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/ltsmin18085505668099713491]
Compilation finished in 363 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18085505668099713491]
Link finished in 65 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, --when, -i, FunctionPointerPTa128ReachabilityCardinality02==true], workingDir=/tmp/ltsmin18085505668099713491]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000032 steps, including 1680 resets, run finished after 517 ms. (steps per millisecond=1934 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2304 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 862 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 29534254 steps, run timeout after 30001 ms. (steps per millisecond=984 ) properties seen :{}
Probabilistic random walk after 29534254 steps, saw 18340309 distinct states, run finished after 30007 ms. (steps per millisecond=984 ) properties seen :{}
Running SMT prover for 3 properties.
[2022-06-09 06:28:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:28:26] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 06:28:26] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2022-06-09 06:28:26] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2022-06-09 06:28:26] [INFO ] Added : 20 causal constraints over 5 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:26] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:26] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2022-06-09 06:28:26] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2022-06-09 06:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-06-09 06:28:26] [INFO ] Added : 17 causal constraints over 4 iterations in 60 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 191300 steps, including 724 resets, run finished after 160 ms. (steps per millisecond=1195 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 80900 steps, including 281 resets, run finished after 72 ms. (steps per millisecond=1123 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 145400 steps, including 668 resets, run finished after 121 ms. (steps per millisecond=1201 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 19 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 60/60 transitions.
Starting structural reductions, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2022-06-09 06:28:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:28:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 06:28:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 06:28:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:28:27] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 06:28:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 06:28:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-06-09 06:28:27] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 06:28:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:28:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 06:28:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 60/60 transitions.
Incomplete random walk after 100000 steps, including 153 resets, run finished after 174 ms. (steps per millisecond=574 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-09 06:28:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:28:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 06:28:27] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:27] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 2 ms.
[2022-06-09 06:28:27] [INFO ] Added : 16 causal constraints over 4 iterations in 23 ms. Result :sat
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Real]Added 23 Read/Feed constraints in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:27] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2022-06-09 06:28:27] [INFO ] Added : 20 causal constraints over 5 iterations in 29 ms. Result :sat
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:28:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 06:28:27] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 06:28:27] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2022-06-09 06:28:27] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2022-06-09 06:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-06-09 06:28:27] [INFO ] Added : 17 causal constraints over 4 iterations in 54 ms. Result :sat
[2022-06-09 06:28:27] [INFO ] Flatten gal took : 5 ms
[2022-06-09 06:28:27] [INFO ] Flatten gal took : 5 ms
[2022-06-09 06:28:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7430867298466095032.gal : 2 ms
[2022-06-09 06:28:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2195607313132099115.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/ReachabilityCardinality7430867298466095032.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2195607313132099115.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/ReachabilityCardinality7430867298466095032.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2195607313132099115.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2195607313132099115.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 132
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5312 after 485149
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :485149 after 6.95408e+07
Detected timeout of ITS tools.
[2022-06-09 06:28:42] [INFO ] Flatten gal took : 9 ms
[2022-06-09 06:28:42] [INFO ] Applying decomposition
[2022-06-09 06:28:42] [INFO ] Flatten gal took : 4 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/graph8492160292324208062.txt, -o, /tmp/graph8492160292324208062.bin, -w, /tmp/graph8492160292324208062.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/graph8492160292324208062.bin, -l, -1, -v, -w, /tmp/graph8492160292324208062.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:28:42] [INFO ] Decomposing Gal with order
[2022-06-09 06:28:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:28:42] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 06:28:42] [INFO ] Flatten gal took : 10 ms
[2022-06-09 06:28:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2022-06-09 06:28:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2948321706198578749.gal : 1 ms
[2022-06-09 06:28:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4321331633027573653.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/ReachabilityCardinality2948321706198578749.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4321331633027573653.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/ReachabilityCardinality2948321706198578749.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4321331633027573653.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4321331633027573653.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 108
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :108 after 2575
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2575 after 139061
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :139061 after 1.1859e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10642095581929979880
[2022-06-09 06:28:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10642095581929979880
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/ltsmin10642095581929979880]
Compilation finished in 293 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10642095581929979880]
Link finished in 40 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, --when, -i, FunctionPointerPTa128ReachabilityCardinality02==true], workingDir=/tmp/ltsmin10642095581929979880]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 31 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 31 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 30 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 30 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 29 transition count 41
Applied a total of 21 rules in 8 ms. Remains 29 /31 variables (removed 2) and now considering 41/60 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 29 cols
[2022-06-09 06:29:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 06:29:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 06:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 06:29:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:29:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-06-09 06:29:12] [INFO ] Computed and/alt/rep : 36/117/36 causal constraints (skipped 1 transitions) in 2 ms.
[2022-06-09 06:29:12] [INFO ] Added : 35 causal constraints over 7 iterations in 162 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 06:29:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 06:29:13] [INFO ] Computed and/alt/rep : 36/117/36 causal constraints (skipped 1 transitions) in 4 ms.
[2022-06-09 06:29:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:29:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 06:29:13] [INFO ] Computed and/alt/rep : 36/117/36 causal constraints (skipped 1 transitions) in 6 ms.
[2022-06-09 06:29:13] [INFO ] Added : 29 causal constraints over 6 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 06:29:13] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 06:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-06-09 06:29:13] [INFO ] Computed and/alt/rep : 36/117/36 causal constraints (skipped 1 transitions) in 2 ms.
[2022-06-09 06:29:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 06:29:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 06:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:29:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-06-09 06:29:13] [INFO ] Computed and/alt/rep : 36/117/36 causal constraints (skipped 1 transitions) in 3 ms.
[2022-06-09 06:29:13] [INFO ] Deduced a trap composed of 11 places in 11 ms of which 0 ms to minimize.
[2022-06-09 06:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-06-09 06:29:13] [INFO ] Added : 23 causal constraints over 5 iterations in 44 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 06:29:13] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17182183647026980999
[2022-06-09 06:29:13] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-06-09 06:29:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 06:29:13] [INFO ] Applying decomposition
[2022-06-09 06:29:13] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-06-09 06:29:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 06:29:13] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-06-09 06:29:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 06:29:13] [INFO ] Flatten gal took : 4 ms
[2022-06-09 06:29:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17182183647026980999
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/ltsmin17182183647026980999]
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/graph1064231786530371190.txt, -o, /tmp/graph1064231786530371190.bin, -w, /tmp/graph1064231786530371190.weights], workingDir=null]
[2022-06-09 06:29:13] [INFO ] Flatten gal took : 3 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/graph1064231786530371190.bin, -l, -1, -v, -w, /tmp/graph1064231786530371190.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:29:13] [INFO ] Decomposing Gal with order
[2022-06-09 06:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:29:13] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 06:29:13] [INFO ] Flatten gal took : 7 ms
[2022-06-09 06:29:13] [INFO ] Input system was already deterministic with 60 transitions.
[2022-06-09 06:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2022-06-09 06:29:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18164327698127883253.gal : 1 ms
[2022-06-09 06:29:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8988958055252904236.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/ReachabilityCardinality18164327698127883253.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8988958055252904236.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/ReachabilityCardinality18164327698127883253.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8988958055252904236.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8988958055252904236.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 108
[2022-06-09 06:29:13] [INFO ] Ran tautology test, simplified 0 / 3 in 66 ms.
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=0 took 3 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=0 took 0 ms
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :108 after 2575
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=1 took 1 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=1 took 0 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=1 took 9 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=2 took 6 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=2 took 12 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=2 took 3 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=3 took 15 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=3 took 11 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 31 cols
[2022-06-09 06:29:13] [INFO ] Computed 3 place invariants in 0 ms
inv : l0 + l1 + l2 + l8 + l9 + l27 = 128
inv : s0 + s1 + s2 + s3 + l14 + l15 + l24 + l25 + l30 = 1
inv : s0 + s1 + s2 + s3 + s4 + s5 + l30 = 1
Total of 3 invariants.
[2022-06-09 06:29:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=3 took 15 ms
[2022-06-09 06:29:13] [INFO ] Proved 31 variables to be positive in 62 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=0 took 3 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=0 took 1 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=0 took 2 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=1 took 5 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=1 took 2 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=1 took 2 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=4 took 73 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=2 took 11 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=2 took 44 ms
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=4 took 68 ms
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=2 took 26 ms
Compilation finished in 334 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17182183647026980999]
[2022-06-09 06:29:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=4 took 43 ms
Link finished in 35 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, FunctionPointerPTa128ReachabilityCardinality02==true], workingDir=/tmp/ltsmin17182183647026980999]
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2575 after 139061
[2022-06-09 06:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:13] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=3 took 334 ms
[2022-06-09 06:29:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:14] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=3 took 348 ms
[2022-06-09 06:29:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:14] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=3 took 168 ms
[2022-06-09 06:29:14] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=5 took 945 ms
[2022-06-09 06:29:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:14] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=4 took 219 ms
[2022-06-09 06:29:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=5 took 655 ms
[2022-06-09 06:29:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:15] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=4 took 653 ms
[2022-06-09 06:29:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:15] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=4 took 347 ms
[2022-06-09 06:29:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:15] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=5 took 175 ms
[2022-06-09 06:29:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=5 took 628 ms
[2022-06-09 06:29:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:16] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=5 took 604 ms
[2022-06-09 06:29:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:17] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=5 took 920 ms
[2022-06-09 06:29:17] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=6 took 1811 ms
[2022-06-09 06:29:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:17] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=6 took 407 ms
[2022-06-09 06:29:18] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=6 took 1255 ms
[2022-06-09 06:29:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:20] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=6 took 2349 ms
[2022-06-09 06:29:20] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=6 took 1756 ms
[2022-06-09 06:29:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:21] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=6 took 947 ms
[2022-06-09 06:29:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:23] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=7 took 2146 ms
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :139061 after 1.1859e+07
[2022-06-09 06:29:25] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=7 took 5231 ms
[2022-06-09 06:29:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:28] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=7 took 5258 ms
[2022-06-09 06:29:29] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=7 took 3663 ms
[2022-06-09 06:29:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:30] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=7 took 1572 ms
[2022-06-09 06:29:31] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=7 took 2219 ms
[2022-06-09 06:29:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:33] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=8 took 3360 ms
[2022-06-09 06:29:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:29:38] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=8 took 5396 ms
[2022-06-09 06:29:39] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=8 took 7893 ms
[2022-06-09 06:29:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:29:42] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=8 took 3362 ms
[2022-06-09 06:29:42] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=8 took 3159 ms
[2022-06-09 06:29:46] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=8 took 4040 ms
[2022-06-09 06:29:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:29:56] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=9 took 14577 ms
[2022-06-09 06:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=9 took 13551 ms
[2022-06-09 06:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=9 took 5094 ms
[2022-06-09 06:30:04] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=9 took 4208 ms
[2022-06-09 06:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:30:06] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=9 took 4220 ms
[2022-06-09 06:30:11] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=9 took 6600 ms
[2022-06-09 06:30:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:30:19] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=10 took 13322 ms
[2022-06-09 06:30:29] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=10 took 17806 ms
[2022-06-09 06:30:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:30:32] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=10 took 13562 ms
[2022-06-09 06:30:36] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=10 took 7159 ms
[2022-06-09 06:30:44] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=10 took 8200 ms
[2022-06-09 06:30:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:30:49] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=10 took 16149 ms
[2022-06-09 06:31:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:31:11] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=11 took 22883 ms
[2022-06-09 06:31:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=11 took 30664 ms
[2022-06-09 06:31:23] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=11 took 8738 ms
[2022-06-09 06:31:47] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=11 took 24147 ms
[2022-06-09 06:32:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=12 took 25246 ms
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.1859e+07 after 1.49869e+09
[2022-06-09 06:32:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:32:17] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=11 took 65888 ms
[2022-06-09 06:32:38] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=12 took 25122 ms
[2022-06-09 06:32:56] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=12 took 18553 ms
[2022-06-09 06:33:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:33:15] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=11 took 57461 ms
[2022-06-09 06:33:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:33:48] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=12 took 33061 ms
[2022-06-09 06:33:56] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=13 took 59673 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 63, guards 60
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 4/ 8), 0.034: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.024: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.024: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.028: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.028: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.024: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.032: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.035: "FunctionPointerPTa128ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.035: There are 63 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.035: State length is 31, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.035: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.035: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.035: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.035: Visible groups: 57 / 60, labels: 1 / 63
pins2lts-mc-linux64( 0/ 8), 0.035: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.035: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.241: ~13 levels ~960 states ~3328 transitions
pins2lts-mc-linux64( 3/ 8), 0.244: ~7 levels ~1920 states ~7328 transitions
pins2lts-mc-linux64( 0/ 8), 0.259: ~15 levels ~3840 states ~15248 transitions
pins2lts-mc-linux64( 0/ 8), 0.265: ~16 levels ~7680 states ~32336 transitions
pins2lts-mc-linux64( 0/ 8), 0.286: ~18 levels ~15360 states ~62760 transitions
pins2lts-mc-linux64( 0/ 8), 0.328: ~19 levels ~30720 states ~119328 transitions
pins2lts-mc-linux64( 0/ 8), 0.447: ~21 levels ~61440 states ~242640 transitions
pins2lts-mc-linux64( 0/ 8), 0.683: ~25 levels ~122880 states ~483504 transitions
pins2lts-mc-linux64( 2/ 8), 1.105: ~20 levels ~245760 states ~985624 transitions
pins2lts-mc-linux64( 4/ 8), 1.933: ~26 levels ~491520 states ~1972328 transitions
pins2lts-mc-linux64( 6/ 8), 3.552: ~25 levels ~983040 states ~3969752 transitions
pins2lts-mc-linux64( 2/ 8), 7.201: ~26 levels ~1966080 states ~8100888 transitions
pins2lts-mc-linux64( 4/ 8), 14.213: ~31 levels ~3932160 states ~15988536 transitions
pins2lts-mc-linux64( 4/ 8), 28.369: ~35 levels ~7864320 states ~32258880 transitions
pins2lts-mc-linux64( 2/ 8), 57.535: ~34 levels ~15728640 states ~65379312 transitions
pins2lts-mc-linux64( 4/ 8), 114.673: ~39 levels ~31457280 states ~132840064 transitions
pins2lts-mc-linux64( 4/ 8), 224.307: ~42 levels ~62914560 states ~257980088 transitions
pins2lts-mc-linux64( 3/ 8), 286.395: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 286.428:
pins2lts-mc-linux64( 0/ 8), 286.428: mean standard work distribution: 5.9% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 286.428:
pins2lts-mc-linux64( 0/ 8), 286.428: Explored 72173437 states 316335191 transitions, fanout: 4.383
pins2lts-mc-linux64( 0/ 8), 286.428: Total exploration time 286.380 sec (286.370 sec minimum, 286.374 sec on average)
pins2lts-mc-linux64( 0/ 8), 286.428: States per second: 252020, Transitions per second: 1104600
pins2lts-mc-linux64( 0/ 8), 286.428: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 286.428:
pins2lts-mc-linux64( 0/ 8), 286.428: Queue width: 8B, total height: 23314676, memory: 177.88MB
pins2lts-mc-linux64( 0/ 8), 286.428: Tree memory: 973.6MB, 10.9 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 286.428: Tree fill ratio (roots/leafs): 70.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 286.428: Stored 60 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 286.428: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 286.428: Est. total memory use: 1151.4MB (~1201.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, FunctionPointerPTa128ReachabilityCardinality02==true], workingDir=/tmp/ltsmin17182183647026980999]
255
java.lang.RuntimeException: Unexpected exception when executing 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, FunctionPointerPTa128ReachabilityCardinality02==true], workingDir=/tmp/ltsmin17182183647026980999]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-09 06:34:03] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=13 took 7171 ms
[2022-06-09 06:34:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:34:08] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=12 took 19905 ms
[2022-06-09 06:34:12] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=13 took 8410 ms
[2022-06-09 06:35:09] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=14 took 57155 ms
[2022-06-09 06:35:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=14 took 5880 ms
[2022-06-09 06:35:20] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=14 took 5630 ms
[2022-06-09 06:35:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:35:57] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=12 took 109171 ms
[2022-06-09 06:36:09] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=15 took 48956 ms
[2022-06-09 06:36:16] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=15 took 6466 ms
[2022-06-09 06:36:37] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=15 took 21255 ms
[2022-06-09 06:37:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:37:09] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=13 took 71517 ms
[2022-06-09 06:37:31] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=16 took 54346 ms
[2022-06-09 06:37:48] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=16 took 16707 ms
[2022-06-09 06:38:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=16 took 26723 ms
[2022-06-09 06:39:33] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=17 took 78093 ms
[2022-06-09 06:39:44] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=17 took 11535 ms
[2022-06-09 06:39:53] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=17 took 8901 ms
[2022-06-09 06:40:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:40:01] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=13 took 172592 ms
[2022-06-09 06:40:49] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=18 took 55617 ms
[2022-06-09 06:41:06] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=18 took 17360 ms
[2022-06-09 06:41:26] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=18 took 19956 ms
[2022-06-09 06:42:39] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=19 took 72352 ms
[2022-06-09 06:43:01] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=19 took 22496 ms
[2022-06-09 06:43:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:43:30] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=13 took 208435 ms
[2022-06-09 06:43:35] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=19 took 34175 ms
[2022-06-09 06:44:43] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=20 took 67422 ms
[2022-06-09 06:45:16] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=20 took 33386 ms
[2022-06-09 06:45:37] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=20 took 21249 ms
[2022-06-09 06:46:11] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=21 took 33662 ms
[2022-06-09 06:46:54] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=21 took 42970 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.49869e+09 after 2.46394e+11
[2022-06-09 06:47:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:47:05] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=14 took 215268 ms
[2022-06-09 06:47:21] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=21 took 26591 ms
[2022-06-09 06:48:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 06:48:00] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=14 took 55610 ms
[2022-06-09 06:48:43] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=22 took 82673 ms
[2022-06-09 06:49:26] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=22 took 43157 ms
Detected timeout of ITS tools.
[2022-06-09 06:49:55] [INFO ] Applying decomposition
[2022-06-09 06:49:55] [INFO ] Flatten gal took : 4 ms
[2022-06-09 06:49:55] [INFO ] Decomposing Gal with order
[2022-06-09 06:49:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:49:55] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 06:49:55] [INFO ] Flatten gal took : 11 ms
[2022-06-09 06:49:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2022-06-09 06:49:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14119650987471380364.gal : 1 ms
[2022-06-09 06:49:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2303265744478153035.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14119650987471380364.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2303265744478153035.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/ReachabilityCardinality14119650987471380364.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2303265744478153035.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2303265744478153035.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 108
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :108 after 2575
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2575 after 139061
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :139061 after 1.1859e+07
[2022-06-09 06:49:59] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=22 took 32981 ms
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.1859e+07 after 1.49869e+09
[2022-06-09 06:52:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 06:52:08] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=14 took 247360 ms
[2022-06-09 06:52:19] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=23 took 139433 ms
[2022-06-09 06:52:57] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=23 took 37854 ms
[2022-06-09 06:53:54] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=23 took 57778 ms
[2022-06-09 06:58:04] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=24 took 249885 ms
[2022-06-09 06:59:15] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=24 took 70937 ms
[2022-06-09 06:59:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 06:59:46] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=15 took 458540 ms
[2022-06-09 07:01:14] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=24 took 119186 ms
[2022-06-09 07:04:16] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=25 took 181356 ms
[2022-06-09 07:04:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-05
[2022-06-09 07:04:43] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(SAT) depth K=15 took 296290 ms
[2022-06-09 07:05:03] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=25 took 47168 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.49869e+09 after 2.46394e+11
[2022-06-09 07:06:29] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=25 took 85583 ms
[2022-06-09 07:08:06] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=26 took 97329 ms
[2022-06-09 07:09:01] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=26 took 55087 ms
[2022-06-09 07:10:20] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=26 took 79293 ms
Detected timeout of ITS tools.
[2022-06-09 07:10:37] [INFO ] Flatten gal took : 17 ms
[2022-06-09 07:10:37] [INFO ] Input system was already deterministic with 60 transitions.
[2022-06-09 07:10:37] [INFO ] Transformed 31 places.
[2022-06-09 07:10:37] [INFO ] Transformed 60 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 07:10:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1389079661799969743.gal : 1 ms
[2022-06-09 07:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7572441041365235120.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/ReachabilityCardinality1389079661799969743.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7572441041365235120.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1389079661799969743.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7572441041365235120.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality7572441041365235120.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 894
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :894 after 1.20803e+08
[2022-06-09 07:11:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-10
[2022-06-09 07:11:52] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(SAT) depth K=15 took 429476 ms
[2022-06-09 07:13:06] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=27 took 165859 ms
[2022-06-09 07:14:13] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=27 took 67162 ms
[2022-06-09 07:15:34] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=27 took 80558 ms
[2022-06-09 07:18:39] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=28 took 185458 ms
[2022-06-09 07:19:56] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-05(UNSAT) depth K=28 took 76131 ms
[2022-06-09 07:21:52] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-10(UNSAT) depth K=28 took 116691 ms
[2022-06-09 07:22:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a128-ReachabilityCardinality-02
[2022-06-09 07:22:57] [INFO ] KInduction solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(SAT) depth K=16 took 664767 ms
[2022-06-09 07:26:51] [INFO ] BMC solution for property FunctionPointer-PT-a128-ReachabilityCardinality-02(UNSAT) depth K=29 took 298297 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="FunctionPointer-PT-a128"
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 FunctionPointer-PT-a128, 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 r323-tall-165472292700155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a128.tgz
mv FunctionPointer-PT-a128 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 '
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 ;