fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331000060
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
748.312 100105.00 158827.00 658.70 FFFFFFTFFFFFTTFT normal

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.r102-smll-162075331000060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 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 374K 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 FlexibleBarrier-PT-10b-00
FORMULA_NAME FlexibleBarrier-PT-10b-01
FORMULA_NAME FlexibleBarrier-PT-10b-02
FORMULA_NAME FlexibleBarrier-PT-10b-03
FORMULA_NAME FlexibleBarrier-PT-10b-04
FORMULA_NAME FlexibleBarrier-PT-10b-05
FORMULA_NAME FlexibleBarrier-PT-10b-06
FORMULA_NAME FlexibleBarrier-PT-10b-07
FORMULA_NAME FlexibleBarrier-PT-10b-08
FORMULA_NAME FlexibleBarrier-PT-10b-09
FORMULA_NAME FlexibleBarrier-PT-10b-10
FORMULA_NAME FlexibleBarrier-PT-10b-11
FORMULA_NAME FlexibleBarrier-PT-10b-12
FORMULA_NAME FlexibleBarrier-PT-10b-13
FORMULA_NAME FlexibleBarrier-PT-10b-14
FORMULA_NAME FlexibleBarrier-PT-10b-15

=== Now, execution of the tool begins

BK_START 1621131594914

Running Version 0
[2021-05-16 02:19:58] [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-16 02:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 02:19:58] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2021-05-16 02:19:58] [INFO ] Transformed 1402 places.
[2021-05-16 02:19:58] [INFO ] Transformed 1613 transitions.
[2021-05-16 02:19:58] [INFO ] Found NUPN structural information;
[2021-05-16 02:19:58] [INFO ] Parsed PT model containing 1402 places and 1613 transitions in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 02:19:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA FlexibleBarrier-PT-10b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 530 places :
Symmetric choice reduction at 0 with 530 rule applications. Total rules 530 place count 872 transition count 1083
Iterating global reduction 0 with 530 rules applied. Total rules applied 1060 place count 872 transition count 1083
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 1299 place count 633 transition count 844
Iterating global reduction 0 with 239 rules applied. Total rules applied 1538 place count 633 transition count 844
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 1683 place count 488 transition count 699
Iterating global reduction 0 with 145 rules applied. Total rules applied 1828 place count 488 transition count 699
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1894 place count 488 transition count 633
Applied a total of 1894 rules in 441 ms. Remains 488 /1402 variables (removed 914) and now considering 633/1613 (removed 980) transitions.
// Phase 1: matrix 633 rows 488 cols
[2021-05-16 02:19:59] [INFO ] Computed 12 place invariants in 41 ms
[2021-05-16 02:20:00] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 633 rows 488 cols
[2021-05-16 02:20:00] [INFO ] Computed 12 place invariants in 16 ms
[2021-05-16 02:20:00] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
// Phase 1: matrix 633 rows 488 cols
[2021-05-16 02:20:00] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:20:01] [INFO ] Dead Transitions using invariants and state equation in 563 ms returned []
Finished structural reductions, in 1 iterations. Remains : 488/1402 places, 633/1613 transitions.
[2021-05-16 02:20:01] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 02:20:01] [INFO ] Flatten gal took : 121 ms
FORMULA FlexibleBarrier-PT-10b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 02:20:01] [INFO ] Flatten gal took : 54 ms
[2021-05-16 02:20:01] [INFO ] Input system was already deterministic with 633 transitions.
Incomplete random walk after 100000 steps, including 1305 resets, run finished after 478 ms. (steps per millisecond=209 ) properties (out of 13) seen :9
Running SMT prover for 4 properties.
// Phase 1: matrix 633 rows 488 cols
[2021-05-16 02:20:02] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:20:02] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2021-05-16 02:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:02] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-16 02:20:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:20:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:03] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2021-05-16 02:20:03] [INFO ] Computed and/alt/rep : 613/1316/613 causal constraints (skipped 19 transitions) in 93 ms.
[2021-05-16 02:20:10] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 10 ms to minimize.
[2021-05-16 02:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2021-05-16 02:20:11] [INFO ] Added : 482 causal constraints over 98 iterations in 7963 ms. Result :sat
[2021-05-16 02:20:11] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-16 02:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:11] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-16 02:20:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:20:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-16 02:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:12] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2021-05-16 02:20:12] [INFO ] Computed and/alt/rep : 613/1316/613 causal constraints (skipped 19 transitions) in 79 ms.
[2021-05-16 02:20:19] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 2 ms to minimize.
[2021-05-16 02:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2021-05-16 02:20:20] [INFO ] Added : 486 causal constraints over 98 iterations in 7808 ms. Result :sat
[2021-05-16 02:20:20] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:20] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-16 02:20:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:20:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:21] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-16 02:20:21] [INFO ] Computed and/alt/rep : 613/1316/613 causal constraints (skipped 19 transitions) in 60 ms.
[2021-05-16 02:20:27] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 2 ms to minimize.
[2021-05-16 02:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2021-05-16 02:20:28] [INFO ] Added : 481 causal constraints over 97 iterations in 6999 ms. Result :sat
[2021-05-16 02:20:28] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2021-05-16 02:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:28] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-16 02:20:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:20:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:20:29] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2021-05-16 02:20:29] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 3 ms to minimize.
[2021-05-16 02:20:29] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 1 ms to minimize.
[2021-05-16 02:20:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2021-05-16 02:20:29] [INFO ] Computed and/alt/rep : 613/1316/613 causal constraints (skipped 19 transitions) in 77 ms.
[2021-05-16 02:20:35] [INFO ] Added : 480 causal constraints over 96 iterations in 5685 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Graph (trivial) has 452 edges and 488 vertex of which 55 / 488 are part of one of the 9 SCC in 12 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 441 transition count 533
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 389 transition count 533
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 105 place count 389 transition count 505
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 161 place count 361 transition count 505
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 196 place count 326 transition count 470
Iterating global reduction 2 with 35 rules applied. Total rules applied 231 place count 326 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 234 place count 326 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 326 transition count 466
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 325 transition count 466
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 243 place count 318 transition count 459
Iterating global reduction 3 with 7 rules applied. Total rules applied 250 place count 318 transition count 459
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 257 place count 318 transition count 452
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 385 place count 254 transition count 388
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 390 place count 249 transition count 383
Iterating global reduction 4 with 5 rules applied. Total rules applied 395 place count 249 transition count 383
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 400 place count 249 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 248 transition count 378
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 413 place count 248 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 414 place count 247 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 246 transition count 365
Applied a total of 415 rules in 288 ms. Remains 246 /488 variables (removed 242) and now considering 365/633 (removed 268) transitions.
[2021-05-16 02:20:35] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:20:35] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:20:35] [INFO ] Implicit Places using invariants in 197 ms returned []
[2021-05-16 02:20:35] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:20:35] [INFO ] Computed 12 place invariants in 15 ms
[2021-05-16 02:20:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:20:36] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2021-05-16 02:20:36] [INFO ] Redundant transitions in 38 ms returned []
[2021-05-16 02:20:36] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:20:36] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:20:36] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/488 places, 365/633 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s97 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 48 steps with 2 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-00 finished in 1428 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)||X((F(p2)||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 473 transition count 618
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 473 transition count 618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 473 transition count 616
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 461 transition count 604
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 461 transition count 604
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 461 transition count 596
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 457 transition count 592
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 457 transition count 592
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 457 transition count 590
Applied a total of 74 rules in 69 ms. Remains 457 /488 variables (removed 31) and now considering 590/633 (removed 43) transitions.
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:20:36] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:20:37] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:20:37] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:20:37] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:20:37] [INFO ] Computed 12 place invariants in 14 ms
[2021-05-16 02:20:38] [INFO ] Dead Transitions using invariants and state equation in 450 ms returned []
Finished structural reductions, in 1 iterations. Remains : 457/488 places, 590/633 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(AND (NEQ s225 0) (NEQ s449 1)), p0:(OR (EQ s254 0) (EQ s233 1)), p1:(EQ s230 1), p3:(OR (NEQ s233 0) (NEQ s254 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, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2803 steps with 35 reset in 95 ms.
FORMULA FlexibleBarrier-PT-10b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-02 finished in 1800 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 470 transition count 615
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 470 transition count 615
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 470 transition count 612
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 456 transition count 598
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 456 transition count 598
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 456 transition count 590
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 451 transition count 585
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 451 transition count 585
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 451 transition count 582
Applied a total of 88 rules in 100 ms. Remains 451 /488 variables (removed 37) and now considering 582/633 (removed 51) transitions.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:20:38] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:20:39] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:20:39] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:20:39] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:20:39] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:20:39] [INFO ] Dead Transitions using invariants and state equation in 393 ms returned []
Finished structural reductions, in 1 iterations. Remains : 451/488 places, 582/633 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-05 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:(EQ s84 0)], 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]]
Product exploration explored 100000 steps with 1296 reset in 471 ms.
Entered a terminal (fully accepting) state of product in 47806 steps with 616 reset in 219 ms.
FORMULA FlexibleBarrier-PT-10b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-05 finished in 2191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 471 transition count 616
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 471 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 471 transition count 613
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 458 transition count 600
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 458 transition count 600
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 458 transition count 592
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 454 transition count 588
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 454 transition count 588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 454 transition count 585
Applied a total of 82 rules in 48 ms. Remains 454 /488 variables (removed 34) and now considering 585/633 (removed 48) transitions.
// Phase 1: matrix 585 rows 454 cols
[2021-05-16 02:20:40] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:20:41] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 585 rows 454 cols
[2021-05-16 02:20:41] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:20:41] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 585 rows 454 cols
[2021-05-16 02:20:41] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:20:41] [INFO ] Dead Transitions using invariants and state equation in 438 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/488 places, 585/633 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s197 0) (EQ s397 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]]
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Product exploration explored 100000 steps with 50000 reset in 600 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 570 ms.
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 454/454 places, 585/585 transitions.
Graph (trivial) has 419 edges and 454 vertex of which 61 / 454 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 403 transition count 533
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 40 place count 403 transition count 593
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 71 place count 403 transition count 593
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 118 place count 356 transition count 546
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 165 place count 356 transition count 546
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 220 place count 356 transition count 566
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 243 place count 333 transition count 543
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 266 place count 333 transition count 543
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 276 place count 333 transition count 583
Deduced a syphon composed of 84 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 316 place count 333 transition count 543
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 316 rules in 152 ms. Remains 333 /454 variables (removed 121) and now considering 543/585 (removed 42) transitions.
[2021-05-16 02:20:45] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-16 02:20:45] [INFO ] Flow matrix only has 515 transitions (discarded 28 similar events)
// Phase 1: matrix 515 rows 333 cols
[2021-05-16 02:20:45] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:20:45] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Finished structural reductions, in 1 iterations. Remains : 333/454 places, 543/585 transitions.
Product exploration explored 100000 steps with 50000 reset in 2554 ms.
Product exploration explored 100000 steps with 50000 reset in 2166 ms.
[2021-05-16 02:20:50] [INFO ] Flatten gal took : 40 ms
[2021-05-16 02:20:50] [INFO ] Flatten gal took : 37 ms
[2021-05-16 02:20:50] [INFO ] Time to serialize gal into /tmp/LTL13172357639634503928.gal : 12 ms
[2021-05-16 02:20:50] [INFO ] Time to serialize properties into /tmp/LTL10644670398078133077.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/LTL13172357639634503928.gal, -t, CGAL, -LTL, /tmp/LTL10644670398078133077.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/LTL13172357639634503928.gal -t CGAL -LTL /tmp/LTL10644670398078133077.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p574==0)||(p1140==1))"))))
Formula 0 simplified : !XF"((p574==0)||(p1140==1))"
Detected timeout of ITS tools.
[2021-05-16 02:21:05] [INFO ] Flatten gal took : 63 ms
[2021-05-16 02:21:05] [INFO ] Applying decomposition
[2021-05-16 02:21:05] [INFO ] Flatten gal took : 53 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/graph9457470665474666375.txt, -o, /tmp/graph9457470665474666375.bin, -w, /tmp/graph9457470665474666375.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/graph9457470665474666375.bin, -l, -1, -v, -w, /tmp/graph9457470665474666375.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:21:06] [INFO ] Decomposing Gal with order
[2021-05-16 02:21:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:21:06] [INFO ] Removed a total of 262 redundant transitions.
[2021-05-16 02:21:06] [INFO ] Flatten gal took : 206 ms
[2021-05-16 02:21:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 21 ms.
[2021-05-16 02:21:06] [INFO ] Time to serialize gal into /tmp/LTL3804719589496772065.gal : 21 ms
[2021-05-16 02:21:06] [INFO ] Time to serialize properties into /tmp/LTL13191487802969585867.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/LTL3804719589496772065.gal, -t, CGAL, -LTL, /tmp/LTL13191487802969585867.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/LTL3804719589496772065.gal -t CGAL -LTL /tmp/LTL13191487802969585867.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.u58.p574==0)||(u106.p1140==1))"))))
Formula 0 simplified : !XF"((i8.u58.p574==0)||(u106.p1140==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16023712093965507043
[2021-05-16 02:21:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16023712093965507043
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/ltsmin16023712093965507043]
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/ltsmin16023712093965507043] 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/ltsmin16023712093965507043] 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 FlexibleBarrier-PT-10b-06 finished in 41898 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 471 transition count 616
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 471 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 471 transition count 613
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 458 transition count 600
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 458 transition count 600
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 458 transition count 593
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 453 transition count 588
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 453 transition count 588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 453 transition count 585
Applied a total of 83 rules in 116 ms. Remains 453 /488 variables (removed 35) and now considering 585/633 (removed 48) transitions.
// Phase 1: matrix 585 rows 453 cols
[2021-05-16 02:21:22] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:21:23] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 585 rows 453 cols
[2021-05-16 02:21:23] [INFO ] Computed 12 place invariants in 12 ms
[2021-05-16 02:21:23] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
// Phase 1: matrix 585 rows 453 cols
[2021-05-16 02:21:23] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:21:24] [INFO ] Dead Transitions using invariants and state equation in 461 ms returned []
Finished structural reductions, in 1 iterations. Remains : 453/488 places, 585/633 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s428 0) (EQ s56 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-09 finished in 1628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1&&(p2 U (p3||G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 475 transition count 620
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 475 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 475 transition count 618
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 464 transition count 607
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 464 transition count 607
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 464 transition count 601
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 460 transition count 597
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 460 transition count 597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 460 transition count 595
Applied a total of 66 rules in 55 ms. Remains 460 /488 variables (removed 28) and now considering 595/633 (removed 38) transitions.
// Phase 1: matrix 595 rows 460 cols
[2021-05-16 02:21:24] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:21:24] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 595 rows 460 cols
[2021-05-16 02:21:24] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:21:25] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 460 cols
[2021-05-16 02:21:25] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:21:25] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 460/488 places, 595/633 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s362 0) (EQ s135 1)), p1:(OR (EQ s88 0) (EQ s49 1)), p3:(AND (NEQ s92 0) (NEQ s168 1) (NEQ s96 1)), p2:(NEQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2513 steps with 32 reset in 11 ms.
FORMULA FlexibleBarrier-PT-10b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-10 finished in 1280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 488/488 places, 633/633 transitions.
Graph (trivial) has 453 edges and 488 vertex of which 61 / 488 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 436 transition count 531
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 387 transition count 531
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 99 place count 387 transition count 503
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 155 place count 359 transition count 503
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 323 transition count 467
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 323 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 230 place count 323 transition count 464
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 236 place count 317 transition count 458
Iterating global reduction 3 with 6 rules applied. Total rules applied 242 place count 317 transition count 458
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 248 place count 317 transition count 452
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 372 place count 255 transition count 390
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 378 place count 249 transition count 384
Iterating global reduction 4 with 6 rules applied. Total rules applied 384 place count 249 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 390 place count 249 transition count 378
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 400 place count 249 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 401 place count 248 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 402 place count 247 transition count 366
Applied a total of 402 rules in 120 ms. Remains 247 /488 variables (removed 241) and now considering 366/633 (removed 267) transitions.
[2021-05-16 02:21:25] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 247 cols
[2021-05-16 02:21:25] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:21:25] [INFO ] Implicit Places using invariants in 173 ms returned []
[2021-05-16 02:21:25] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 247 cols
[2021-05-16 02:21:25] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:21:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:21:26] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2021-05-16 02:21:26] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-16 02:21:26] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 247 cols
[2021-05-16 02:21:26] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:21:26] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/488 places, 366/633 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-11 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 s158 0) (EQ s226 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 54 steps with 3 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-11 finished in 891 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5358637430205912451
[2021-05-16 02:21:26] [INFO ] Computing symmetric may disable matrix : 633 transitions.
[2021-05-16 02:21:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:21:26] [INFO ] Applying decomposition
[2021-05-16 02:21:26] [INFO ] Computing symmetric may enable matrix : 633 transitions.
[2021-05-16 02:21:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:21:26] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3819001599915314172.txt, -o, /tmp/graph3819001599915314172.bin, -w, /tmp/graph3819001599915314172.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/graph3819001599915314172.bin, -l, -1, -v, -w, /tmp/graph3819001599915314172.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:21:26] [INFO ] Computing Do-Not-Accords matrix : 633 transitions.
[2021-05-16 02:21:26] [INFO ] Decomposing Gal with order
[2021-05-16 02:21:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:21:26] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:21:26] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5358637430205912451
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/ltsmin5358637430205912451]
[2021-05-16 02:21:26] [INFO ] Removed a total of 252 redundant transitions.
[2021-05-16 02:21:27] [INFO ] Flatten gal took : 219 ms
[2021-05-16 02:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 56 ms.
[2021-05-16 02:21:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality13958733422084923927.gal : 9 ms
[2021-05-16 02:21:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality1848841096485300877.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/LTLCardinality13958733422084923927.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1848841096485300877.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/LTLCardinality13958733422084923927.gal -t CGAL -LTL /tmp/LTLCardinality1848841096485300877.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.i1.i0.u68.p574==0)||(i2.u111.p1140==1))"))))
Formula 0 simplified : !XF"((i8.i1.i0.u68.p574==0)||(i2.u111.p1140==1))"
Compilation finished in 6417 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5358637430205912451]
Link finished in 78 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5358637430205912451]
LTSmin run took 710 ms.
FORMULA FlexibleBarrier-PT-10b-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621131695019

--------------------
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="FlexibleBarrier-PT-10b"
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 FlexibleBarrier-PT-10b, 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 r102-smll-162075331000060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b 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 ;