Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-08b-00
FORMULA_NAME ASLink-PT-08b-01
FORMULA_NAME ASLink-PT-08b-02
FORMULA_NAME ASLink-PT-08b-03
FORMULA_NAME ASLink-PT-08b-04
FORMULA_NAME ASLink-PT-08b-05
FORMULA_NAME ASLink-PT-08b-06
FORMULA_NAME ASLink-PT-08b-07
FORMULA_NAME ASLink-PT-08b-08
FORMULA_NAME ASLink-PT-08b-09
FORMULA_NAME ASLink-PT-08b-10
FORMULA_NAME ASLink-PT-08b-11
FORMULA_NAME ASLink-PT-08b-12
FORMULA_NAME ASLink-PT-08b-13
FORMULA_NAME ASLink-PT-08b-14
FORMULA_NAME ASLink-PT-08b-15

=== Now, execution of the tool begins

BK_START 1620430324567

Running Version 0
[2021-05-07 23:32:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 23:32:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 23:32:06] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2021-05-07 23:32:06] [INFO ] Transformed 3618 places.
[2021-05-07 23:32:06] [INFO ] Transformed 4459 transitions.
[2021-05-07 23:32:06] [INFO ] Found NUPN structural information;
[2021-05-07 23:32:06] [INFO ] Parsed PT model containing 3618 places and 4459 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 23:32:06] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-08b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3618 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 219 places :
Symmetric choice reduction at 0 with 219 rule applications. Total rules 219 place count 3399 transition count 4240
Iterating global reduction 0 with 219 rules applied. Total rules applied 438 place count 3399 transition count 4240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 439 place count 3399 transition count 4239
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 523 place count 3315 transition count 4112
Iterating global reduction 1 with 84 rules applied. Total rules applied 607 place count 3315 transition count 4112
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 634 place count 3315 transition count 4085
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 645 place count 3304 transition count 4074
Iterating global reduction 2 with 11 rules applied. Total rules applied 656 place count 3304 transition count 4074
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 660 place count 3300 transition count 4063
Iterating global reduction 2 with 4 rules applied. Total rules applied 664 place count 3300 transition count 4063
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 667 place count 3297 transition count 4060
Iterating global reduction 2 with 3 rules applied. Total rules applied 670 place count 3297 transition count 4060
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 673 place count 3294 transition count 4050
Iterating global reduction 2 with 3 rules applied. Total rules applied 676 place count 3294 transition count 4050
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 677 place count 3293 transition count 4042
Iterating global reduction 2 with 1 rules applied. Total rules applied 678 place count 3293 transition count 4042
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 679 place count 3292 transition count 4041
Iterating global reduction 2 with 1 rules applied. Total rules applied 680 place count 3292 transition count 4041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 681 place count 3291 transition count 4033
Iterating global reduction 2 with 1 rules applied. Total rules applied 682 place count 3291 transition count 4033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 683 place count 3290 transition count 4025
Iterating global reduction 2 with 1 rules applied. Total rules applied 684 place count 3290 transition count 4025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 685 place count 3289 transition count 4024
Iterating global reduction 2 with 1 rules applied. Total rules applied 686 place count 3289 transition count 4024
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 687 place count 3288 transition count 4016
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 3288 transition count 4016
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 689 place count 3287 transition count 4008
Iterating global reduction 2 with 1 rules applied. Total rules applied 690 place count 3287 transition count 4008
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 691 place count 3286 transition count 4007
Iterating global reduction 2 with 1 rules applied. Total rules applied 692 place count 3286 transition count 4007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 693 place count 3285 transition count 3999
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 3285 transition count 3999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 695 place count 3284 transition count 3991
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 3284 transition count 3991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 697 place count 3283 transition count 3990
Iterating global reduction 2 with 1 rules applied. Total rules applied 698 place count 3283 transition count 3990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 699 place count 3282 transition count 3982
Iterating global reduction 2 with 1 rules applied. Total rules applied 700 place count 3282 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 701 place count 3281 transition count 3974
Iterating global reduction 2 with 1 rules applied. Total rules applied 702 place count 3281 transition count 3974
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 703 place count 3280 transition count 3973
Iterating global reduction 2 with 1 rules applied. Total rules applied 704 place count 3280 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 705 place count 3279 transition count 3965
Iterating global reduction 2 with 1 rules applied. Total rules applied 706 place count 3279 transition count 3965
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 707 place count 3278 transition count 3957
Iterating global reduction 2 with 1 rules applied. Total rules applied 708 place count 3278 transition count 3957
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 709 place count 3277 transition count 3956
Iterating global reduction 2 with 1 rules applied. Total rules applied 710 place count 3277 transition count 3956
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 711 place count 3276 transition count 3948
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 3276 transition count 3948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 713 place count 3275 transition count 3940
Iterating global reduction 2 with 1 rules applied. Total rules applied 714 place count 3275 transition count 3940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 715 place count 3274 transition count 3939
Iterating global reduction 2 with 1 rules applied. Total rules applied 716 place count 3274 transition count 3939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 717 place count 3273 transition count 3931
Iterating global reduction 2 with 1 rules applied. Total rules applied 718 place count 3273 transition count 3931
Applied a total of 718 rules in 7083 ms. Remains 3273 /3618 variables (removed 345) and now considering 3931/4459 (removed 528) transitions.
// Phase 1: matrix 3931 rows 3273 cols
[2021-05-07 23:32:14] [INFO ] Computed 355 place invariants in 352 ms
[2021-05-07 23:32:15] [INFO ] Implicit Places using invariants in 1759 ms returned []
// Phase 1: matrix 3931 rows 3273 cols
[2021-05-07 23:32:15] [INFO ] Computed 355 place invariants in 133 ms
[2021-05-07 23:32:24] [INFO ] Implicit Places using invariants and state equation in 9419 ms returned [3107, 3118, 3129, 3137, 3145, 3153, 3161, 3172, 3180, 3188, 3199]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 11210 ms to find 11 implicit places.
// Phase 1: matrix 3931 rows 3262 cols
[2021-05-07 23:32:25] [INFO ] Computed 344 place invariants in 72 ms
[2021-05-07 23:32:27] [INFO ] Dead Transitions using invariants and state equation in 2440 ms returned []
Starting structural reductions, iteration 1 : 3262/3618 places, 3931/4459 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3249 transition count 3918
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3249 transition count 3918
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3238 transition count 3907
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3238 transition count 3907
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3229 transition count 3898
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3229 transition count 3898
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3225 transition count 3894
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3225 transition count 3894
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3223 transition count 3892
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3223 transition count 3892
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3221 transition count 3890
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3221 transition count 3890
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3219 transition count 3888
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3219 transition count 3888
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3217 transition count 3886
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3217 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3216 transition count 3885
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3215 transition count 3884
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3215 transition count 3884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3214 transition count 3883
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3214 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3213 transition count 3882
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3213 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3212 transition count 3881
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3212 transition count 3881
Applied a total of 100 rules in 2789 ms. Remains 3212 /3262 variables (removed 50) and now considering 3881/3931 (removed 50) transitions.
// Phase 1: matrix 3881 rows 3212 cols
[2021-05-07 23:32:30] [INFO ] Computed 344 place invariants in 64 ms
[2021-05-07 23:32:31] [INFO ] Implicit Places using invariants in 1437 ms returned []
// Phase 1: matrix 3881 rows 3212 cols
[2021-05-07 23:32:31] [INFO ] Computed 344 place invariants in 63 ms
[2021-05-07 23:32:37] [INFO ] Implicit Places using invariants and state equation in 5473 ms returned []
Implicit Place search using SMT with State Equation took 6912 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3212/3618 places, 3881/4459 transitions.
[2021-05-07 23:32:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-07 23:32:37] [INFO ] Flatten gal took : 281 ms
FORMULA ASLink-PT-08b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 23:32:37] [INFO ] Flatten gal took : 177 ms
[2021-05-07 23:32:38] [INFO ] Input system was already deterministic with 3881 transitions.
Incomplete random walk after 100000 steps, including 132 resets, run finished after 663 ms. (steps per millisecond=150 ) properties (out of 13) seen :8
Running SMT prover for 5 properties.
// Phase 1: matrix 3881 rows 3212 cols
[2021-05-07 23:32:38] [INFO ] Computed 344 place invariants in 62 ms
[2021-05-07 23:32:39] [INFO ] [Real]Absence check using 84 positive place invariants in 50 ms returned sat
[2021-05-07 23:32:39] [INFO ] [Real]Absence check using 84 positive and 260 generalized place invariants in 90 ms returned sat
[2021-05-07 23:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:32:41] [INFO ] [Real]Absence check using state equation in 1833 ms returned sat
[2021-05-07 23:32:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:32:41] [INFO ] [Nat]Absence check using 84 positive place invariants in 50 ms returned sat
[2021-05-07 23:32:41] [INFO ] [Nat]Absence check using 84 positive and 260 generalized place invariants in 90 ms returned sat
[2021-05-07 23:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:32:43] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2021-05-07 23:32:44] [INFO ] Deduced a trap composed of 33 places in 1056 ms of which 5 ms to minimize.
[2021-05-07 23:32:45] [INFO ] Deduced a trap composed of 22 places in 1045 ms of which 3 ms to minimize.
[2021-05-07 23:32:47] [INFO ] Deduced a trap composed of 41 places in 1064 ms of which 16 ms to minimize.
[2021-05-07 23:32:48] [INFO ] Deduced a trap composed of 24 places in 1314 ms of which 4 ms to minimize.
[2021-05-07 23:32:50] [INFO ] Deduced a trap composed of 22 places in 1335 ms of which 2 ms to minimize.
[2021-05-07 23:32:51] [INFO ] Deduced a trap composed of 62 places in 1269 ms of which 2 ms to minimize.
[2021-05-07 23:32:52] [INFO ] Deduced a trap composed of 95 places in 1304 ms of which 12 ms to minimize.
[2021-05-07 23:32:54] [INFO ] Deduced a trap composed of 26 places in 1195 ms of which 2 ms to minimize.
[2021-05-07 23:32:55] [INFO ] Deduced a trap composed of 23 places in 1211 ms of which 2 ms to minimize.
[2021-05-07 23:32:56] [INFO ] Deduced a trap composed of 33 places in 1182 ms of which 2 ms to minimize.
[2021-05-07 23:32:58] [INFO ] Deduced a trap composed of 23 places in 1241 ms of which 3 ms to minimize.
[2021-05-07 23:32:59] [INFO ] Deduced a trap composed of 28 places in 1200 ms of which 2 ms to minimize.
[2021-05-07 23:33:00] [INFO ] Deduced a trap composed of 39 places in 1221 ms of which 2 ms to minimize.
[2021-05-07 23:33:01] [INFO ] Deduced a trap composed of 25 places in 751 ms of which 1 ms to minimize.
[2021-05-07 23:33:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-07 23:33:02] [INFO ] [Real]Absence check using 84 positive place invariants in 52 ms returned sat
[2021-05-07 23:33:02] [INFO ] [Real]Absence check using 84 positive and 260 generalized place invariants in 90 ms returned sat
[2021-05-07 23:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:04] [INFO ] [Real]Absence check using state equation in 2446 ms returned sat
[2021-05-07 23:33:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:33:05] [INFO ] [Nat]Absence check using 84 positive place invariants in 50 ms returned sat
[2021-05-07 23:33:05] [INFO ] [Nat]Absence check using 84 positive and 260 generalized place invariants in 87 ms returned sat
[2021-05-07 23:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:08] [INFO ] [Nat]Absence check using state equation in 3021 ms returned sat
[2021-05-07 23:33:09] [INFO ] Deduced a trap composed of 21 places in 809 ms of which 1 ms to minimize.
[2021-05-07 23:33:09] [INFO ] Deduced a trap composed of 51 places in 367 ms of which 1 ms to minimize.
[2021-05-07 23:33:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1563 ms
[2021-05-07 23:33:10] [INFO ] Computed and/alt/rep : 3342/7552/3342 causal constraints (skipped 538 transitions) in 263 ms.
[2021-05-07 23:33:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-07 23:33:25] [INFO ] [Real]Absence check using 84 positive place invariants in 45 ms returned sat
[2021-05-07 23:33:25] [INFO ] [Real]Absence check using 84 positive and 260 generalized place invariants in 100 ms returned sat
[2021-05-07 23:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:27] [INFO ] [Real]Absence check using state equation in 2324 ms returned sat
[2021-05-07 23:33:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:33:28] [INFO ] [Nat]Absence check using 84 positive place invariants in 47 ms returned sat
[2021-05-07 23:33:28] [INFO ] [Nat]Absence check using 84 positive and 260 generalized place invariants in 88 ms returned sat
[2021-05-07 23:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:31] [INFO ] [Nat]Absence check using state equation in 3024 ms returned sat
[2021-05-07 23:33:32] [INFO ] Deduced a trap composed of 23 places in 774 ms of which 1 ms to minimize.
[2021-05-07 23:33:32] [INFO ] Deduced a trap composed of 20 places in 779 ms of which 1 ms to minimize.
[2021-05-07 23:33:33] [INFO ] Deduced a trap composed of 23 places in 811 ms of which 2 ms to minimize.
[2021-05-07 23:33:34] [INFO ] Deduced a trap composed of 19 places in 764 ms of which 1 ms to minimize.
[2021-05-07 23:33:35] [INFO ] Deduced a trap composed of 30 places in 784 ms of which 1 ms to minimize.
[2021-05-07 23:33:36] [INFO ] Deduced a trap composed of 34 places in 838 ms of which 2 ms to minimize.
[2021-05-07 23:33:37] [INFO ] Deduced a trap composed of 32 places in 517 ms of which 1 ms to minimize.
[2021-05-07 23:33:37] [INFO ] Deduced a trap composed of 66 places in 459 ms of which 1 ms to minimize.
[2021-05-07 23:33:38] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 1 ms to minimize.
[2021-05-07 23:33:38] [INFO ] Deduced a trap composed of 97 places in 391 ms of which 1 ms to minimize.
[2021-05-07 23:33:39] [INFO ] Deduced a trap composed of 100 places in 392 ms of which 1 ms to minimize.
[2021-05-07 23:33:39] [INFO ] Deduced a trap composed of 42 places in 390 ms of which 1 ms to minimize.
[2021-05-07 23:33:40] [INFO ] Deduced a trap composed of 97 places in 473 ms of which 1 ms to minimize.
[2021-05-07 23:33:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 9417 ms
[2021-05-07 23:33:40] [INFO ] Computed and/alt/rep : 3342/7552/3342 causal constraints (skipped 538 transitions) in 196 ms.
[2021-05-07 23:33:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-07 23:33:48] [INFO ] [Real]Absence check using 84 positive place invariants in 45 ms returned sat
[2021-05-07 23:33:48] [INFO ] [Real]Absence check using 84 positive and 260 generalized place invariants in 94 ms returned sat
[2021-05-07 23:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:49] [INFO ] [Real]Absence check using state equation in 1719 ms returned sat
[2021-05-07 23:33:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:33:50] [INFO ] [Nat]Absence check using 84 positive place invariants in 47 ms returned sat
[2021-05-07 23:33:50] [INFO ] [Nat]Absence check using 84 positive and 260 generalized place invariants in 88 ms returned sat
[2021-05-07 23:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:33:52] [INFO ] [Nat]Absence check using state equation in 1655 ms returned sat
[2021-05-07 23:33:53] [INFO ] Deduced a trap composed of 32 places in 1483 ms of which 2 ms to minimize.
[2021-05-07 23:33:55] [INFO ] Deduced a trap composed of 25 places in 1449 ms of which 2 ms to minimize.
[2021-05-07 23:33:56] [INFO ] Deduced a trap composed of 33 places in 1439 ms of which 2 ms to minimize.
[2021-05-07 23:33:58] [INFO ] Deduced a trap composed of 90 places in 1428 ms of which 3 ms to minimize.
[2021-05-07 23:33:59] [INFO ] Deduced a trap composed of 80 places in 1425 ms of which 3 ms to minimize.
[2021-05-07 23:34:01] [INFO ] Deduced a trap composed of 26 places in 1411 ms of which 2 ms to minimize.
[2021-05-07 23:34:02] [INFO ] Deduced a trap composed of 33 places in 1425 ms of which 2 ms to minimize.
[2021-05-07 23:34:04] [INFO ] Deduced a trap composed of 43 places in 1395 ms of which 2 ms to minimize.
[2021-05-07 23:34:06] [INFO ] Deduced a trap composed of 21 places in 1423 ms of which 2 ms to minimize.
[2021-05-07 23:34:07] [INFO ] Deduced a trap composed of 38 places in 1432 ms of which 2 ms to minimize.
[2021-05-07 23:34:09] [INFO ] Deduced a trap composed of 69 places in 1408 ms of which 2 ms to minimize.
[2021-05-07 23:34:10] [INFO ] Deduced a trap composed of 167 places in 1429 ms of which 2 ms to minimize.
[2021-05-07 23:34:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-07 23:34:11] [INFO ] [Real]Absence check using 84 positive place invariants in 48 ms returned sat
[2021-05-07 23:34:11] [INFO ] [Real]Absence check using 84 positive and 260 generalized place invariants in 92 ms returned sat
[2021-05-07 23:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:34:13] [INFO ] [Real]Absence check using state equation in 2009 ms returned sat
[2021-05-07 23:34:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:34:13] [INFO ] [Nat]Absence check using 84 positive place invariants in 48 ms returned sat
[2021-05-07 23:34:13] [INFO ] [Nat]Absence check using 84 positive and 260 generalized place invariants in 86 ms returned sat
[2021-05-07 23:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:34:16] [INFO ] [Nat]Absence check using state equation in 2116 ms returned sat
[2021-05-07 23:34:17] [INFO ] Deduced a trap composed of 22 places in 1409 ms of which 2 ms to minimize.
[2021-05-07 23:34:19] [INFO ] Deduced a trap composed of 27 places in 1340 ms of which 3 ms to minimize.
[2021-05-07 23:34:20] [INFO ] Deduced a trap composed of 42 places in 1184 ms of which 2 ms to minimize.
[2021-05-07 23:34:21] [INFO ] Deduced a trap composed of 67 places in 1215 ms of which 2 ms to minimize.
[2021-05-07 23:34:22] [INFO ] Deduced a trap composed of 67 places in 1174 ms of which 1 ms to minimize.
[2021-05-07 23:34:24] [INFO ] Deduced a trap composed of 107 places in 1168 ms of which 2 ms to minimize.
[2021-05-07 23:34:25] [INFO ] Deduced a trap composed of 28 places in 1135 ms of which 2 ms to minimize.
[2021-05-07 23:34:26] [INFO ] Deduced a trap composed of 19 places in 890 ms of which 2 ms to minimize.
[2021-05-07 23:34:27] [INFO ] Deduced a trap composed of 76 places in 813 ms of which 1 ms to minimize.
[2021-05-07 23:34:28] [INFO ] Deduced a trap composed of 71 places in 796 ms of which 2 ms to minimize.
[2021-05-07 23:34:29] [INFO ] Deduced a trap composed of 69 places in 651 ms of which 1 ms to minimize.
[2021-05-07 23:34:29] [INFO ] Deduced a trap composed of 88 places in 569 ms of which 1 ms to minimize.
[2021-05-07 23:34:30] [INFO ] Deduced a trap composed of 77 places in 452 ms of which 1 ms to minimize.
[2021-05-07 23:34:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14350 ms
[2021-05-07 23:34:30] [INFO ] Computed and/alt/rep : 3342/7552/3342 causal constraints (skipped 538 transitions) in 191 ms.
[2021-05-07 23:34:33] [INFO ] Added : 85 causal constraints over 17 iterations in 3122 ms. Result :unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U G(p1)) U (G(p0)&&p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3207 transition count 3876
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3207 transition count 3876
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 3204 transition count 3873
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 3204 transition count 3873
Applied a total of 16 rules in 607 ms. Remains 3204 /3212 variables (removed 8) and now considering 3873/3881 (removed 8) transitions.
// Phase 1: matrix 3873 rows 3204 cols
[2021-05-07 23:34:34] [INFO ] Computed 344 place invariants in 71 ms
[2021-05-07 23:34:35] [INFO ] Implicit Places using invariants in 1378 ms returned []
// Phase 1: matrix 3873 rows 3204 cols
[2021-05-07 23:34:35] [INFO ] Computed 344 place invariants in 65 ms
[2021-05-07 23:34:46] [INFO ] Implicit Places using invariants and state equation in 10925 ms returned []
Implicit Place search using SMT with State Equation took 12304 ms to find 0 implicit places.
// Phase 1: matrix 3873 rows 3204 cols
[2021-05-07 23:34:46] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:34:48] [INFO ] Dead Transitions using invariants and state equation in 2377 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3204/3212 places, 3873/3881 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-08b-01 automaton TGBA [mat=[[{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s2708 0) (EQ s1342 1)), p0:(OR (EQ s1342 0) (EQ s2708 1)), p1:(EQ s1888 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28524 reset in 1591 ms.
Product exploration explored 100000 steps with 28525 reset in 1494 ms.
Knowledge obtained : [(NOT p2), p0, (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true, (NOT p1)]
Product exploration explored 100000 steps with 28509 reset in 1586 ms.
Product exploration explored 100000 steps with 28507 reset in 1605 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true, (NOT p1)]
Support contains 3 out of 3204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3204/3204 places, 3873/3873 transitions.
Performed 580 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 580 rules applied. Total rules applied 580 place count 3204 transition count 3873
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 581 place count 3204 transition count 3872
Performed 698 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 698 Pre rules applied. Total rules applied 581 place count 3204 transition count 5299
Deduced a syphon composed of 1278 places in 16 ms
Iterating global reduction 2 with 698 rules applied. Total rules applied 1279 place count 3204 transition count 5299
Discarding 278 places :
Symmetric choice reduction at 2 with 278 rule applications. Total rules 1557 place count 2926 transition count 4901
Deduced a syphon composed of 1000 places in 16 ms
Iterating global reduction 2 with 278 rules applied. Total rules applied 1835 place count 2926 transition count 4901
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1449 places in 10 ms
Iterating global reduction 2 with 449 rules applied. Total rules applied 2284 place count 2926 transition count 4902
Discarding 230 places :
Symmetric choice reduction at 2 with 230 rule applications. Total rules 2514 place count 2696 transition count 4668
Deduced a syphon composed of 1223 places in 9 ms
Iterating global reduction 2 with 230 rules applied. Total rules applied 2744 place count 2696 transition count 4668
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2746 place count 2694 transition count 4665
Deduced a syphon composed of 1223 places in 27 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2748 place count 2694 transition count 4665
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2750 place count 2694 transition count 4663
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -191
Deduced a syphon composed of 1267 places in 10 ms
Iterating global reduction 3 with 44 rules applied. Total rules applied 2794 place count 2694 transition count 4854
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2804 place count 2684 transition count 4834
Deduced a syphon composed of 1257 places in 10 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2814 place count 2684 transition count 4834
Performed 8(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1265 places in 9 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 2822 place count 2684 transition count 4906
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2830 place count 2676 transition count 4862
Deduced a syphon composed of 1257 places in 13 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 2838 place count 2676 transition count 4862
Deduced a syphon composed of 1257 places in 9 ms
Applied a total of 2838 rules in 1404 ms. Remains 2676 /3204 variables (removed 528) and now considering 4862/3873 (removed -989) transitions.
[2021-05-07 23:35:04] [INFO ] Redundant transitions in 357 ms returned []
// Phase 1: matrix 4862 rows 2676 cols
[2021-05-07 23:35:04] [INFO ] Computed 344 place invariants in 139 ms
[2021-05-07 23:35:07] [INFO ] Dead Transitions using invariants and state equation in 2779 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2676/3204 places, 4862/3873 transitions.
Product exploration explored 100000 steps with 28498 reset in 7584 ms.
Product exploration explored 100000 steps with 28574 reset in 7439 ms.
[2021-05-07 23:35:22] [INFO ] Flatten gal took : 123 ms
[2021-05-07 23:35:23] [INFO ] Flatten gal took : 131 ms
[2021-05-07 23:35:23] [INFO ] Time to serialize gal into /tmp/LTL12908422120928333532.gal : 45 ms
[2021-05-07 23:35:23] [INFO ] Time to serialize properties into /tmp/LTL15320369877884935357.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12908422120928333532.gal, -t, CGAL, -LTL, /tmp/LTL15320369877884935357.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12908422120928333532.gal -t CGAL -LTL /tmp/LTL15320369877884935357.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("((p1472==0)||(p2971==1))"))U(G("(p2071==1)")))U(("((p2971==0)&&(p1472==1))")&&(G("((p1472==0)||(p2971==1))")))))
Formula 0 simplified : !((X"((p1472==0)||(p2971==1))" U G"(p2071==1)") U ("((p2971==0)&&(p1472==1))" & G"((p1472==0)||(p2971==1))"))
Detected timeout of ITS tools.
[2021-05-07 23:35:43] [INFO ] Flatten gal took : 120 ms
[2021-05-07 23:35:43] [INFO ] Applying decomposition
[2021-05-07 23:35:43] [INFO ] Flatten gal took : 127 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/graph772653048548806205.txt, -o, /tmp/graph772653048548806205.bin, -w, /tmp/graph772653048548806205.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/graph772653048548806205.bin, -l, -1, -v, -w, /tmp/graph772653048548806205.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:35:43] [INFO ] Decomposing Gal with order
[2021-05-07 23:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:35:44] [INFO ] Removed a total of 2848 redundant transitions.
[2021-05-07 23:35:44] [INFO ] Flatten gal took : 274 ms
[2021-05-07 23:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 37 ms.
[2021-05-07 23:35:44] [INFO ] Time to serialize gal into /tmp/LTL8295206340373627260.gal : 32 ms
[2021-05-07 23:35:44] [INFO ] Time to serialize properties into /tmp/LTL5544679964910116554.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8295206340373627260.gal, -t, CGAL, -LTL, /tmp/LTL5544679964910116554.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8295206340373627260.gal -t CGAL -LTL /tmp/LTL5544679964910116554.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X("((i19.i0.i1.u512.p1472==0)||(i37.i1.i0.u1037.p2971==1))"))U(G("(i25.u726.p2071==1)")))U(("((i37.i1.i0.u1037.p2971==0)&&(i19.i0.i1.u512.p1472==1))")&&(G("((i19.i0.i1.u512.p1472==0)||(i37.i1.i0.u1037.p2971==1))")))))
Formula 0 simplified : !((X"((i19.i0.i1.u512.p1472==0)||(i37.i1.i0.u1037.p2971==1))" U G"(i25.u726.p2071==1)") U ("((i37.i1.i0.u1037.p2971==0)&&(i19.i0.i1.u512.p1472==1))" & G"((i19.i0.i1.u512.p1472==0)||(i37.i1.i0.u1037.p2971==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17905112954602414759
[2021-05-07 23:36:00] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17905112954602414759
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/ltsmin17905112954602414759]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17905112954602414759] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17905112954602414759] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-08b-01 finished in 91642 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1&&X(X(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3207 transition count 3876
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3207 transition count 3876
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 3204 transition count 3868
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3203 transition count 3867
Applied a total of 18 rules in 813 ms. Remains 3203 /3212 variables (removed 9) and now considering 3867/3881 (removed 14) transitions.
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:06] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:36:07] [INFO ] Implicit Places using invariants in 1486 ms returned []
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:07] [INFO ] Computed 344 place invariants in 60 ms
[2021-05-07 23:36:12] [INFO ] Implicit Places using invariants and state equation in 5291 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:12] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:36:15] [INFO ] Dead Transitions using invariants and state equation in 2481 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3203/3212 places, 3867/3881 transitions.
Stuttering acceptance computed with spot in 2674 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(EQ s2341 1), p0:(OR (EQ s2455 0) (EQ s2367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11986 steps with 17 reset in 59 ms.
FORMULA ASLink-PT-08b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-02 finished in 12854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3207 transition count 3876
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3207 transition count 3876
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 3204 transition count 3868
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3203 transition count 3867
Applied a total of 18 rules in 816 ms. Remains 3203 /3212 variables (removed 9) and now considering 3867/3881 (removed 14) transitions.
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:18] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:36:20] [INFO ] Implicit Places using invariants in 1302 ms returned []
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:20] [INFO ] Computed 344 place invariants in 62 ms
[2021-05-07 23:36:26] [INFO ] Implicit Places using invariants and state equation in 5839 ms returned []
Implicit Place search using SMT with State Equation took 7166 ms to find 0 implicit places.
// Phase 1: matrix 3867 rows 3203 cols
[2021-05-07 23:36:26] [INFO ] Computed 344 place invariants in 69 ms
[2021-05-07 23:36:28] [INFO ] Dead Transitions using invariants and state equation in 2355 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3203/3212 places, 3867/3881 transitions.
Stuttering acceptance computed with spot in 5284 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s2703 1), p0:(OR (EQ s528 0) (EQ s1831 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2698 ms.
Product exploration explored 100000 steps with 50000 reset in 2872 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 8741 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 2619 ms.
Product exploration explored 100000 steps with 50000 reset in 2625 ms.
java.io.IOException: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut6293959712175938236.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:313)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:195)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Caused by: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut6293959712175938236.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:311)
... 18 more
[2021-05-07 23:37:03] [INFO ] Flatten gal took : 116 ms
[2021-05-07 23:37:03] [INFO ] Flatten gal took : 117 ms
[2021-05-07 23:37:04] [INFO ] Time to serialize gal into /tmp/LTL11649704946271992132.gal : 501 ms
[2021-05-07 23:37:04] [INFO ] Time to serialize properties into /tmp/LTL14616687817191829836.ltl : 106 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11649704946271992132.gal, -t, CGAL, -LTL, /tmp/LTL14616687817191829836.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11649704946271992132.gal -t CGAL -LTL /tmp/LTL14616687817191829836.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p571==0)||(p2005==1))")||(G("(p2969==1)")))))
Formula 0 simplified : !X("((p571==0)||(p2005==1))" | G"(p2969==1)")
Detected timeout of ITS tools.
[2021-05-07 23:37:19] [INFO ] Flatten gal took : 106 ms
[2021-05-07 23:37:19] [INFO ] Applying decomposition
[2021-05-07 23:37:19] [INFO ] Flatten gal took : 107 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/graph17971210010434646077.txt, -o, /tmp/graph17971210010434646077.bin, -w, /tmp/graph17971210010434646077.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/graph17971210010434646077.bin, -l, -1, -v, -w, /tmp/graph17971210010434646077.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:37:20] [INFO ] Decomposing Gal with order
[2021-05-07 23:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:37:20] [INFO ] Removed a total of 2829 redundant transitions.
[2021-05-07 23:37:20] [INFO ] Flatten gal took : 186 ms
[2021-05-07 23:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 32 ms.
[2021-05-07 23:37:20] [INFO ] Time to serialize gal into /tmp/LTL16686643098318383371.gal : 28 ms
[2021-05-07 23:37:20] [INFO ] Time to serialize properties into /tmp/LTL10394803896700173827.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16686643098318383371.gal, -t, CGAL, -LTL, /tmp/LTL10394803896700173827.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16686643098318383371.gal -t CGAL -LTL /tmp/LTL10394803896700173827.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i3.u198.p571==0)||(i0.i7.i1.u700.p2005==1))")||(G("(i37.i2.i0.u1031.p2969==1)")))))
Formula 0 simplified : !X("((i3.u198.p571==0)||(i0.i7.i1.u700.p2005==1))" | G"(i37.i2.i0.u1031.p2969==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13915566885475470320
[2021-05-07 23:37:35] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13915566885475470320
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/ltsmin13915566885475470320]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13915566885475470320] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13915566885475470320] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-08b-06 finished in 78825 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 603 transitions
Trivial Post-agglo rules discarded 603 transitions
Performed 603 trivial Post agglomeration. Transition count delta: 603
Iterating post reduction 0 with 603 rules applied. Total rules applied 603 place count 3211 transition count 3277
Reduce places removed 603 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 606 rules applied. Total rules applied 1209 place count 2608 transition count 3274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1211 place count 2606 transition count 3274
Performed 863 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 863 Pre rules applied. Total rules applied 1211 place count 2606 transition count 2411
Deduced a syphon composed of 863 places in 6 ms
Ensure Unique test removed 83 places
Reduce places removed 946 places and 0 transitions.
Iterating global reduction 3 with 1809 rules applied. Total rules applied 3020 place count 1660 transition count 2411
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 60 rules applied. Total rules applied 3080 place count 1651 transition count 2360
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 52 rules applied. Total rules applied 3132 place count 1600 transition count 2359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3133 place count 1599 transition count 2359
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3133 place count 1599 transition count 2326
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3232 place count 1533 transition count 2326
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3232 place count 1533 transition count 2294
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3296 place count 1501 transition count 2294
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 3299 place count 1498 transition count 2291
Iterating global reduction 6 with 3 rules applied. Total rules applied 3302 place count 1498 transition count 2291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 3302 place count 1498 transition count 2288
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3308 place count 1495 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3309 place count 1494 transition count 2282
Iterating global reduction 6 with 1 rules applied. Total rules applied 3310 place count 1494 transition count 2282
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 6 with 506 rules applied. Total rules applied 3816 place count 1240 transition count 2030
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3820 place count 1236 transition count 2026
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3825 place count 1235 transition count 2026
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3826 place count 1235 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3827 place count 1234 transition count 2025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3827 place count 1234 transition count 2024
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3829 place count 1233 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3831 place count 1231 transition count 2022
Iterating global reduction 8 with 2 rules applied. Total rules applied 3833 place count 1231 transition count 2022
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3835 place count 1231 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3836 place count 1230 transition count 2020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3838 place count 1229 transition count 2025
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3839 place count 1228 transition count 2024
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3840 place count 1227 transition count 2023
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 22 rules applied. Total rules applied 3862 place count 1212 transition count 2016
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3869 place count 1205 transition count 2016
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 22 Pre rules applied. Total rules applied 3869 place count 1205 transition count 1994
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 12 with 45 rules applied. Total rules applied 3914 place count 1182 transition count 1994
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 3929 place count 1167 transition count 1994
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3929 place count 1167 transition count 1993
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3931 place count 1166 transition count 1993
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 13 with 46 rules applied. Total rules applied 3977 place count 1143 transition count 1970
Discarding 14 places :
Symmetric choice reduction at 13 with 14 rule applications. Total rules 3991 place count 1129 transition count 1956
Iterating global reduction 13 with 14 rules applied. Total rules applied 4005 place count 1129 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 4011 place count 1123 transition count 1950
Iterating global reduction 13 with 6 rules applied. Total rules applied 4017 place count 1123 transition count 1950
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 4023 place count 1123 transition count 1944
Applied a total of 4023 rules in 938 ms. Remains 1123 /3212 variables (removed 2089) and now considering 1944/3881 (removed 1937) transitions.
// Phase 1: matrix 1944 rows 1123 cols
[2021-05-07 23:37:37] [INFO ] Computed 185 place invariants in 30 ms
[2021-05-07 23:37:38] [INFO ] Implicit Places using invariants in 775 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 262, 278, 279, 283, 318, 338, 389, 390, 402, 403, 405, 422, 440, 460, 511, 512, 524, 525, 527, 544, 562, 582, 633, 634, 646, 647, 649, 666, 684, 704, 755, 756, 768, 769, 771, 788, 806, 825, 877, 878, 890, 891, 893, 910, 928, 1001, 1005, 1006, 1009, 1020, 1021, 1022, 1040, 1061, 1062, 1063, 1064]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 790 ms to find 70 implicit places.
[2021-05-07 23:37:38] [INFO ] Redundant transitions in 125 ms returned []
// Phase 1: matrix 1944 rows 1053 cols
[2021-05-07 23:37:38] [INFO ] Computed 115 place invariants in 21 ms
[2021-05-07 23:37:39] [INFO ] Dead Transitions using invariants and state equation in 898 ms returned []
Starting structural reductions, iteration 1 : 1053/3212 places, 1944/3881 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 1053 transition count 1815
Reduce places removed 129 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 924 transition count 1814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 923 transition count 1814
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 260 place count 923 transition count 1775
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 339 place count 883 transition count 1775
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 351 place count 879 transition count 1767
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 359 place count 871 transition count 1767
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 362 place count 868 transition count 1764
Iterating global reduction 5 with 3 rules applied. Total rules applied 365 place count 868 transition count 1764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 368 place count 868 transition count 1761
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 482 place count 811 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 483 place count 810 transition count 1703
Iterating global reduction 6 with 1 rules applied. Total rules applied 484 place count 810 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 485 place count 810 transition count 1702
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 489 place count 808 transition count 1703
Applied a total of 489 rules in 153 ms. Remains 808 /1053 variables (removed 245) and now considering 1703/1944 (removed 241) transitions.
// Phase 1: matrix 1703 rows 808 cols
[2021-05-07 23:37:39] [INFO ] Computed 110 place invariants in 29 ms
[2021-05-07 23:37:40] [INFO ] Implicit Places using invariants in 487 ms returned [88, 94, 99, 178, 184, 189, 282, 290, 296, 373, 379, 384, 461, 467, 472, 549, 555, 560, 637, 643, 648, 710, 729, 735, 740, 805]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 489 ms to find 26 implicit places.
Starting structural reductions, iteration 2 : 782/3212 places, 1703/3881 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 782 transition count 1702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 781 transition count 1702
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 765 transition count 1686
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 765 transition count 1686
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 749 transition count 1670
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 749 transition count 1670
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 740 transition count 1661
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 740 transition count 1661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 739 transition count 1660
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 739 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 738 transition count 1659
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 738 transition count 1659
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 106 place count 729 transition count 1650
Applied a total of 106 rules in 163 ms. Remains 729 /782 variables (removed 53) and now considering 1650/1703 (removed 53) transitions.
// Phase 1: matrix 1650 rows 729 cols
[2021-05-07 23:37:40] [INFO ] Computed 84 place invariants in 16 ms
[2021-05-07 23:37:40] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 1650 rows 729 cols
[2021-05-07 23:37:40] [INFO ] Computed 84 place invariants in 16 ms
[2021-05-07 23:37:42] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 729/3212 places, 1650/3881 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s148 0) (EQ s652 1) (EQ s191 0) (EQ s180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1075 reset in 301 ms.
Product exploration explored 100000 steps with 1109 reset in 315 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1092 reset in 318 ms.
Product exploration explored 100000 steps with 1084 reset in 342 ms.
[2021-05-07 23:37:43] [INFO ] Flatten gal took : 60 ms
[2021-05-07 23:37:43] [INFO ] Flatten gal took : 65 ms
[2021-05-07 23:37:43] [INFO ] Time to serialize gal into /tmp/LTL10470384577623484802.gal : 5 ms
[2021-05-07 23:37:43] [INFO ] Time to serialize properties into /tmp/LTL3140152158792943853.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10470384577623484802.gal, -t, CGAL, -LTL, /tmp/LTL3140152158792943853.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10470384577623484802.gal -t CGAL -LTL /tmp/LTL3140152158792943853.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p583==0)||(p3024==1))||(p882==0))||(p820==1))"))))
Formula 0 simplified : !FG"((((p583==0)||(p3024==1))||(p882==0))||(p820==1))"
Detected timeout of ITS tools.
[2021-05-07 23:37:59] [INFO ] Flatten gal took : 56 ms
[2021-05-07 23:37:59] [INFO ] Applying decomposition
[2021-05-07 23:37:59] [INFO ] Flatten gal took : 58 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/graph11988377092398210232.txt, -o, /tmp/graph11988377092398210232.bin, -w, /tmp/graph11988377092398210232.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/graph11988377092398210232.bin, -l, -1, -v, -w, /tmp/graph11988377092398210232.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:37:59] [INFO ] Decomposing Gal with order
[2021-05-07 23:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:37:59] [INFO ] Removed a total of 3207 redundant transitions.
[2021-05-07 23:37:59] [INFO ] Flatten gal took : 182 ms
[2021-05-07 23:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 14 ms.
[2021-05-07 23:37:59] [INFO ] Time to serialize gal into /tmp/LTL932023742678603169.gal : 7 ms
[2021-05-07 23:37:59] [INFO ] Time to serialize properties into /tmp/LTL18150359617333829614.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL932023742678603169.gal, -t, CGAL, -LTL, /tmp/LTL18150359617333829614.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL932023742678603169.gal -t CGAL -LTL /tmp/LTL18150359617333829614.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i1.u41.p583==0)||(i14.u156.p3024==1))||(i4.u55.p882==0))||(i2.u47.p820==1))"))))
Formula 0 simplified : !FG"((((i1.u41.p583==0)||(i14.u156.p3024==1))||(i4.u55.p882==0))||(i2.u47.p820==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10781852006325139240
[2021-05-07 23:38:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781852006325139240
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/ltsmin10781852006325139240]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10781852006325139240] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10781852006325139240] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-08b-07 finished in 38682 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 603 transitions
Trivial Post-agglo rules discarded 603 transitions
Performed 603 trivial Post agglomeration. Transition count delta: 603
Iterating post reduction 0 with 603 rules applied. Total rules applied 603 place count 3211 transition count 3277
Reduce places removed 603 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 606 rules applied. Total rules applied 1209 place count 2608 transition count 3274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1211 place count 2606 transition count 3274
Performed 864 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 864 Pre rules applied. Total rules applied 1211 place count 2606 transition count 2410
Deduced a syphon composed of 864 places in 6 ms
Ensure Unique test removed 83 places
Reduce places removed 947 places and 0 transitions.
Iterating global reduction 3 with 1811 rules applied. Total rules applied 3022 place count 1659 transition count 2410
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 60 rules applied. Total rules applied 3082 place count 1650 transition count 2359
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 52 rules applied. Total rules applied 3134 place count 1599 transition count 2358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3135 place count 1598 transition count 2358
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3135 place count 1598 transition count 2325
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3234 place count 1532 transition count 2325
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3234 place count 1532 transition count 2293
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3298 place count 1500 transition count 2293
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3300 place count 1498 transition count 2291
Iterating global reduction 6 with 2 rules applied. Total rules applied 3302 place count 1498 transition count 2291
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3302 place count 1498 transition count 2289
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3306 place count 1496 transition count 2289
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3307 place count 1495 transition count 2283
Iterating global reduction 6 with 1 rules applied. Total rules applied 3308 place count 1495 transition count 2283
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 6 with 512 rules applied. Total rules applied 3820 place count 1238 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3824 place count 1234 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3829 place count 1233 transition count 2024
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3830 place count 1233 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3831 place count 1232 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3831 place count 1232 transition count 2022
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3833 place count 1231 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3835 place count 1229 transition count 2020
Iterating global reduction 8 with 2 rules applied. Total rules applied 3837 place count 1229 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3839 place count 1229 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3840 place count 1228 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3842 place count 1227 transition count 2023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3843 place count 1226 transition count 2022
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3844 place count 1225 transition count 2021
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 22 rules applied. Total rules applied 3866 place count 1210 transition count 2014
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3873 place count 1203 transition count 2014
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 23 Pre rules applied. Total rules applied 3873 place count 1203 transition count 1991
Deduced a syphon composed of 23 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 47 rules applied. Total rules applied 3920 place count 1179 transition count 1991
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 3935 place count 1164 transition count 1991
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3935 place count 1164 transition count 1990
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3937 place count 1163 transition count 1990
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 13 with 46 rules applied. Total rules applied 3983 place count 1140 transition count 1967
Discarding 14 places :
Symmetric choice reduction at 13 with 14 rule applications. Total rules 3997 place count 1126 transition count 1953
Iterating global reduction 13 with 14 rules applied. Total rules applied 4011 place count 1126 transition count 1953
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 4018 place count 1119 transition count 1946
Iterating global reduction 13 with 7 rules applied. Total rules applied 4025 place count 1119 transition count 1946
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4032 place count 1119 transition count 1939
Applied a total of 4032 rules in 868 ms. Remains 1119 /3212 variables (removed 2093) and now considering 1939/3881 (removed 1942) transitions.
// Phase 1: matrix 1939 rows 1119 cols
[2021-05-07 23:38:16] [INFO ] Computed 185 place invariants in 28 ms
[2021-05-07 23:38:17] [INFO ] Implicit Places using invariants in 773 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 514, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 818, 874, 875, 887, 888, 889, 891, 908, 926, 997, 1001, 1002, 1005, 1016, 1017, 1018, 1036, 1057, 1058, 1059, 1060]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 775 ms to find 73 implicit places.
[2021-05-07 23:38:17] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1939 rows 1046 cols
[2021-05-07 23:38:17] [INFO ] Computed 112 place invariants in 21 ms
[2021-05-07 23:38:18] [INFO ] Dead Transitions using invariants and state equation in 916 ms returned []
Starting structural reductions, iteration 1 : 1046/3212 places, 1939/3881 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1046 transition count 1804
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 270 place count 911 transition count 1804
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 270 place count 911 transition count 1768
Deduced a syphon composed of 36 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 73 rules applied. Total rules applied 343 place count 874 transition count 1768
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 356 place count 869 transition count 1760
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 364 place count 861 transition count 1760
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 367 place count 858 transition count 1757
Iterating global reduction 4 with 3 rules applied. Total rules applied 370 place count 858 transition count 1757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 373 place count 858 transition count 1754
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 497 place count 796 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 498 place count 795 transition count 1691
Iterating global reduction 5 with 1 rules applied. Total rules applied 499 place count 795 transition count 1691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 500 place count 795 transition count 1690
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 504 place count 793 transition count 1691
Applied a total of 504 rules in 135 ms. Remains 793 /1046 variables (removed 253) and now considering 1691/1939 (removed 248) transitions.
// Phase 1: matrix 1691 rows 793 cols
[2021-05-07 23:38:18] [INFO ] Computed 106 place invariants in 17 ms
[2021-05-07 23:38:18] [INFO ] Implicit Places using invariants in 441 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 446, 452, 457, 534, 540, 545, 624, 630, 635, 697, 714, 720, 725, 790]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 443 ms to find 23 implicit places.
Starting structural reductions, iteration 2 : 770/3212 places, 1691/3881 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 770 transition count 1690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 769 transition count 1690
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 755 transition count 1676
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 755 transition count 1676
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 741 transition count 1662
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 741 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 734 transition count 1655
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 734 transition count 1655
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 726 transition count 1647
Applied a total of 88 rules in 123 ms. Remains 726 /770 variables (removed 44) and now considering 1647/1691 (removed 44) transitions.
// Phase 1: matrix 1647 rows 726 cols
[2021-05-07 23:38:18] [INFO ] Computed 83 place invariants in 16 ms
[2021-05-07 23:38:19] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 1647 rows 726 cols
[2021-05-07 23:38:19] [INFO ] Computed 83 place invariants in 17 ms
[2021-05-07 23:38:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-07 23:38:20] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 726/3212 places, 1647/3881 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s560 0) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 40599 steps with 444 reset in 125 ms.
FORMULA ASLink-PT-08b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-08 finished in 5181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 602 rules applied. Total rules applied 602 place count 3211 transition count 3278
Reduce places removed 602 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 605 rules applied. Total rules applied 1207 place count 2609 transition count 3275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1209 place count 2607 transition count 3275
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 866 Pre rules applied. Total rules applied 1209 place count 2607 transition count 2409
Deduced a syphon composed of 866 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 950 places and 0 transitions.
Iterating global reduction 3 with 1816 rules applied. Total rules applied 3025 place count 1657 transition count 2409
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3085 place count 1649 transition count 2357
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3137 place count 1597 transition count 2357
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3137 place count 1597 transition count 2325
Deduced a syphon composed of 32 places in 5 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 3233 place count 1533 transition count 2325
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 3233 place count 1533 transition count 2294
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 3295 place count 1502 transition count 2294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3298 place count 1499 transition count 2291
Iterating global reduction 5 with 3 rules applied. Total rules applied 3301 place count 1499 transition count 2291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 3301 place count 1499 transition count 2288
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 3307 place count 1496 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3308 place count 1495 transition count 2282
Iterating global reduction 5 with 1 rules applied. Total rules applied 3309 place count 1495 transition count 2282
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 5 with 510 rules applied. Total rules applied 3819 place count 1239 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3823 place count 1235 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3828 place count 1234 transition count 2024
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 3829 place count 1234 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3830 place count 1233 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3830 place count 1233 transition count 2022
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3832 place count 1232 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3834 place count 1230 transition count 2020
Iterating global reduction 7 with 2 rules applied. Total rules applied 3836 place count 1230 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3838 place count 1230 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3839 place count 1229 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3841 place count 1228 transition count 2023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3842 place count 1227 transition count 2022
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3843 place count 1226 transition count 2021
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3867 place count 1210 transition count 2013
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3875 place count 1202 transition count 2013
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3875 place count 1202 transition count 1989
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3924 place count 1177 transition count 1989
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 3940 place count 1161 transition count 1989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3940 place count 1161 transition count 1988
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3942 place count 1160 transition count 1988
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 3990 place count 1136 transition count 1964
Discarding 15 places :
Symmetric choice reduction at 12 with 15 rule applications. Total rules 4005 place count 1121 transition count 1949
Iterating global reduction 12 with 15 rules applied. Total rules applied 4020 place count 1121 transition count 1949
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 4027 place count 1114 transition count 1942
Iterating global reduction 12 with 7 rules applied. Total rules applied 4034 place count 1114 transition count 1942
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 4041 place count 1114 transition count 1935
Applied a total of 4041 rules in 798 ms. Remains 1114 /3212 variables (removed 2098) and now considering 1935/3881 (removed 1946) transitions.
// Phase 1: matrix 1935 rows 1114 cols
[2021-05-07 23:38:21] [INFO ] Computed 184 place invariants in 31 ms
[2021-05-07 23:38:22] [INFO ] Implicit Places using invariants in 822 ms returned [1, 18, 19, 31, 48, 66, 86, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 483, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 761, 762, 764, 781, 799, 818, 870, 871, 883, 884, 886, 903, 921, 992, 996, 997, 1000, 1011, 1012, 1013, 1031, 1052, 1053, 1054, 1055]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 827 ms to find 74 implicit places.
[2021-05-07 23:38:22] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1935 rows 1040 cols
[2021-05-07 23:38:22] [INFO ] Computed 110 place invariants in 20 ms
[2021-05-07 23:38:23] [INFO ] Dead Transitions using invariants and state equation in 998 ms returned []
Starting structural reductions, iteration 1 : 1040/3212 places, 1935/3881 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1040 transition count 1801
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 906 transition count 1800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 905 transition count 1800
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 270 place count 905 transition count 1761
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 349 place count 865 transition count 1761
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 361 place count 861 transition count 1753
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 369 place count 853 transition count 1753
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 372 place count 850 transition count 1750
Iterating global reduction 5 with 3 rules applied. Total rules applied 375 place count 850 transition count 1750
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 378 place count 850 transition count 1747
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 500 place count 789 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 501 place count 788 transition count 1685
Iterating global reduction 6 with 1 rules applied. Total rules applied 502 place count 788 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 503 place count 788 transition count 1684
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 507 place count 786 transition count 1685
Applied a total of 507 rules in 132 ms. Remains 786 /1040 variables (removed 254) and now considering 1685/1935 (removed 250) transitions.
// Phase 1: matrix 1685 rows 786 cols
[2021-05-07 23:38:23] [INFO ] Computed 105 place invariants in 17 ms
[2021-05-07 23:38:24] [INFO ] Implicit Places using invariants in 539 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 359, 364, 441, 447, 452, 529, 535, 540, 617, 623, 628, 690, 707, 713, 718, 783]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 541 ms to find 25 implicit places.
Starting structural reductions, iteration 2 : 761/3212 places, 1685/3881 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 761 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 760 transition count 1684
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 746 transition count 1670
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 746 transition count 1670
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 732 transition count 1656
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 732 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 726 transition count 1650
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 726 transition count 1650
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 88 place count 717 transition count 1641
Applied a total of 88 rules in 89 ms. Remains 717 /761 variables (removed 44) and now considering 1641/1685 (removed 44) transitions.
// Phase 1: matrix 1641 rows 717 cols
[2021-05-07 23:38:24] [INFO ] Computed 80 place invariants in 17 ms
[2021-05-07 23:38:24] [INFO ] Implicit Places using invariants in 487 ms returned []
// Phase 1: matrix 1641 rows 717 cols
[2021-05-07 23:38:24] [INFO ] Computed 80 place invariants in 16 ms
[2021-05-07 23:38:26] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 717/3212 places, 1641/3881 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s329 0) (NEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-10 finished in 5633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3206 transition count 3875
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3206 transition count 3875
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 3202 transition count 3866
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 3202 transition count 3866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 3201 transition count 3865
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 3201 transition count 3865
Applied a total of 22 rules in 775 ms. Remains 3201 /3212 variables (removed 11) and now considering 3865/3881 (removed 16) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:27] [INFO ] Computed 344 place invariants in 62 ms
[2021-05-07 23:38:28] [INFO ] Implicit Places using invariants in 1361 ms returned []
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:28] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:31] [INFO ] Implicit Places using invariants and state equation in 3369 ms returned []
Implicit Place search using SMT with State Equation took 4733 ms to find 0 implicit places.
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:31] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:34] [INFO ] Dead Transitions using invariants and state equation in 2334 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3201/3212 places, 3865/3881 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s388 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 791 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-08b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-11 finished in 7932 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3206 transition count 3875
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3206 transition count 3875
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 3202 transition count 3866
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 3202 transition count 3866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 3201 transition count 3865
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 3201 transition count 3865
Applied a total of 22 rules in 789 ms. Remains 3201 /3212 variables (removed 11) and now considering 3865/3881 (removed 16) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:35] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:36] [INFO ] Implicit Places using invariants in 1294 ms returned []
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:36] [INFO ] Computed 344 place invariants in 60 ms
[2021-05-07 23:38:39] [INFO ] Implicit Places using invariants and state equation in 3340 ms returned []
Implicit Place search using SMT with State Equation took 4635 ms to find 0 implicit places.
// Phase 1: matrix 3865 rows 3201 cols
[2021-05-07 23:38:39] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:42] [INFO ] Dead Transitions using invariants and state equation in 2366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3201/3212 places, 3865/3881 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s2644 0) (NEQ s357 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-13 finished in 7893 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3212/3212 places, 3881/3881 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3207 transition count 3876
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3207 transition count 3876
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3203 transition count 3867
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3203 transition count 3867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 3202 transition count 3866
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 3202 transition count 3866
Applied a total of 20 rules in 759 ms. Remains 3202 /3212 variables (removed 10) and now considering 3866/3881 (removed 15) transitions.
// Phase 1: matrix 3866 rows 3202 cols
[2021-05-07 23:38:43] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:44] [INFO ] Implicit Places using invariants in 1285 ms returned []
// Phase 1: matrix 3866 rows 3202 cols
[2021-05-07 23:38:44] [INFO ] Computed 344 place invariants in 61 ms
[2021-05-07 23:38:53] [INFO ] Implicit Places using invariants and state equation in 9022 ms returned []
Implicit Place search using SMT with State Equation took 10309 ms to find 0 implicit places.
// Phase 1: matrix 3866 rows 3202 cols
[2021-05-07 23:38:53] [INFO ] Computed 344 place invariants in 60 ms
[2021-05-07 23:38:55] [INFO ] Dead Transitions using invariants and state equation in 2379 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3202/3212 places, 3866/3881 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s1151 0) (NEQ s2364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-14 finished in 13529 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7785729045321451669
[2021-05-07 23:38:55] [INFO ] Too many transitions (3881) to apply POR reductions. Disabling POR matrices.
[2021-05-07 23:38:55] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7785729045321451669
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/ltsmin7785729045321451669]
[2021-05-07 23:38:55] [INFO ] Applying decomposition
[2021-05-07 23:38:55] [INFO ] Flatten gal took : 102 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/graph14144479696664180333.txt, -o, /tmp/graph14144479696664180333.bin, -w, /tmp/graph14144479696664180333.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/graph14144479696664180333.bin, -l, -1, -v, -w, /tmp/graph14144479696664180333.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:38:56] [INFO ] Decomposing Gal with order
[2021-05-07 23:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:38:56] [INFO ] Removed a total of 2852 redundant transitions.
[2021-05-07 23:38:56] [INFO ] Flatten gal took : 235 ms
[2021-05-07 23:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 35 ms.
[2021-05-07 23:38:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality3409750079721297869.gal : 30 ms
[2021-05-07 23:38:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality6938402950213723273.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality3409750079721297869.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6938402950213723273.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality3409750079721297869.gal -t CGAL -LTL /tmp/LTLCardinality6938402950213723273.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((((X("((i13.i0.i0.u509.p1472==0)||(i32.i1.i0.u1035.p2971==1))"))U(G("(i24.u724.p2071==1)")))U(("((i32.i1.i0.u1035.p2971==0)&&(i13.i0.i0.u509.p1472==1))")&&(G("((i13.i0.i0.u509.p1472==0)||(i32.i1.i0.u1035.p2971==1))")))))
Formula 0 simplified : !((X"((i13.i0.i0.u509.p1472==0)||(i32.i1.i0.u1035.p2971==1))" U G"(i24.u724.p2071==1)") U ("((i32.i1.i0.u1035.p2971==0)&&(i13.i0.i0.u509.p1472==1))" & G"((i13.i0.i0.u509.p1472==0)||(i32.i1.i0.u1035.p2971==1))"))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7785729045321451669] killed by timeout after 40 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7785729045321451669] killed by timeout after 40 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 00:01:13] [INFO ] Applying decomposition
[2021-05-08 00:01:13] [INFO ] Flatten gal took : 114 ms
[2021-05-08 00:01:13] [INFO ] Decomposing Gal with order
[2021-05-08 00:01:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:01:13] [INFO ] Removed a total of 2612 redundant transitions.
[2021-05-08 00:01:13] [INFO ] Flatten gal took : 181 ms
[2021-05-08 00:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4437 labels/synchronizations in 98 ms.
[2021-05-08 00:01:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality8998011443358164537.gal : 15 ms
[2021-05-08 00:01:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality10162108109061169450.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality8998011443358164537.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10162108109061169450.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality8998011443358164537.gal -t CGAL -LTL /tmp/LTLCardinality10162108109061169450.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((((X("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==0)||(i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==1))"))U(G("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u257.p2071==1)")))U(("((i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==0)&&(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==1))")&&(G("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==0)||(i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==1))")))))
Formula 0 simplified : !((X"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==0)||(i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==1))" U G"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u257.p2071==1)") U ("((i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==0)&&(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==1))" & G"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u173.p1472==0)||(i0.i1.i0.i0.i0.i0.i0.i1.u468.p2971==1))"))
Detected timeout of ITS tools.
[2021-05-08 00:23:44] [INFO ] Flatten gal took : 563 ms
[2021-05-08 00:23:47] [INFO ] Input system was already deterministic with 3881 transitions.
[2021-05-08 00:23:47] [INFO ] Transformed 3212 places.
[2021-05-08 00:23:47] [INFO ] Transformed 3881 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 00:24:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality5310972543576742456.gal : 25 ms
[2021-05-08 00:24:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality17174283736194671067.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5310972543576742456.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17174283736194671067.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5310972543576742456.gal -t CGAL -LTL /tmp/LTLCardinality17174283736194671067.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X("((p1472==0)||(p2971==1))"))U(G("(p2071==1)")))U(("((p2971==0)&&(p1472==1))")&&(G("((p1472==0)||(p2971==1))")))))
Formula 0 simplified : !((X"((p1472==0)||(p2971==1))" U G"(p2071==1)") U ("((p2971==0)&&(p1472==1))" & G"((p1472==0)||(p2971==1))"))

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ASLink-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-08b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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