Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 9.2K Apr 29 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 544K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652759440619

Running Version 202205111006
[2022-05-17 03:50:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 03:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:50:43] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2022-05-17 03:50:43] [INFO ] Transformed 998 places.
[2022-05-17 03:50:43] [INFO ] Transformed 922 transitions.
[2022-05-17 03:50:43] [INFO ] Parsed PT model containing 998 places and 922 transitions in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-35-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 66 place count 932 transition count 891
Iterating global reduction 1 with 31 rules applied. Total rules applied 97 place count 932 transition count 891
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 125 place count 904 transition count 863
Iterating global reduction 1 with 28 rules applied. Total rules applied 153 place count 904 transition count 863
Applied a total of 153 rules in 710 ms. Remains 904 /998 variables (removed 94) and now considering 863/922 (removed 59) transitions.
// Phase 1: matrix 863 rows 904 cols
[2022-05-17 03:50:45] [INFO ] Computed 41 place invariants in 59 ms
[2022-05-17 03:50:46] [INFO ] Implicit Places using invariants in 1314 ms returned []
// Phase 1: matrix 863 rows 904 cols
[2022-05-17 03:50:46] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-17 03:50:49] [INFO ] Implicit Places using invariants and state equation in 3302 ms returned []
Implicit Place search using SMT with State Equation took 4687 ms to find 0 implicit places.
// Phase 1: matrix 863 rows 904 cols
[2022-05-17 03:50:49] [INFO ] Computed 41 place invariants in 12 ms
[2022-05-17 03:50:51] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/998 places, 863/922 transitions.
Finished structural reductions, in 1 iterations. Remains : 904/998 places, 863/922 transitions.
Support contains 46 out of 904 places after structural reductions.
[2022-05-17 03:50:51] [INFO ] Flatten gal took : 169 ms
[2022-05-17 03:50:51] [INFO ] Flatten gal took : 150 ms
[2022-05-17 03:50:51] [INFO ] Input system was already deterministic with 863 transitions.
Support contains 44 out of 904 places (down from 46) after GAL structural reductions.
Finished random walk after 9393 steps, including 10 resets, run visited all 29 properties in 300 ms. (steps per millisecond=31 )
FORMULA HirschbergSinclair-PT-35-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 904 stabilizing places and 863 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 904 transition count 863
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((G(p1)&&p0) U p2)&&F(p3))))'
Support contains 7 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 135 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:50:53] [INFO ] Computed 41 place invariants in 11 ms
[2022-05-17 03:50:54] [INFO ] Implicit Places using invariants in 1110 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:50:54] [INFO ] Computed 41 place invariants in 10 ms
[2022-05-17 03:50:57] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 4770 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:50:57] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-17 03:50:59] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 745 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), true, (NOT p3), (AND p1 p2), p1]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s49 1) (GEQ s738 1)), p3:(AND (GEQ s3 1) (GEQ s78 1)), p0:(AND (GEQ s5 1) (GEQ s711 1)), p1:(GEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1835 reset in 1126 ms.
Product exploration explored 100000 steps with 1840 reset in 770 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 552 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p3), (NOT p3)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F p3)]
Knowledge based reduction with 11 factoid took 649 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p3)]
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:51:03] [INFO ] Computed 41 place invariants in 10 ms
[2022-05-17 03:51:05] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 301 ms returned sat
[2022-05-17 03:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:51:10] [INFO ] [Real]Absence check using state equation in 4657 ms returned sat
[2022-05-17 03:51:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:51:11] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 344 ms returned sat
[2022-05-17 03:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:51:16] [INFO ] [Nat]Absence check using state equation in 4677 ms returned sat
[2022-05-17 03:51:16] [INFO ] Computed and/alt/rep : 394/400/394 causal constraints (skipped 423 transitions) in 109 ms.
[2022-05-17 03:51:25] [INFO ] Added : 330 causal constraints over 66 iterations in 8905 ms. Result :unknown
Could not prove EG (NOT p3)
Support contains 2 out of 893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Reduce places removed 31 places and 31 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 862 transition count 471
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 512 transition count 471
Applied a total of 700 rules in 109 ms. Remains 512 /893 variables (removed 381) and now considering 471/852 (removed 381) transitions.
// Phase 1: matrix 471 rows 512 cols
[2022-05-17 03:51:25] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-17 03:51:26] [INFO ] Implicit Places using invariants in 954 ms returned []
// Phase 1: matrix 471 rows 512 cols
[2022-05-17 03:51:26] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 03:51:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 03:51:29] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3797 ms to find 0 implicit places.
[2022-05-17 03:51:29] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 471 rows 512 cols
[2022-05-17 03:51:29] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:51:29] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/893 places, 471/852 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/893 places, 471/852 transitions.
Computed a total of 512 stabilizing places and 471 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 471
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p3), (X (NOT p3)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p3)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p3), (X (NOT p3)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F p3)]
Knowledge based reduction with 3 factoid took 311 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p3)]
// Phase 1: matrix 471 rows 512 cols
[2022-05-17 03:51:30] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:51:31] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 265 ms returned sat
[2022-05-17 03:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:51:33] [INFO ] [Real]Absence check using state equation in 1850 ms returned sat
[2022-05-17 03:51:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:51:34] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 324 ms returned sat
[2022-05-17 03:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:51:44] [INFO ] [Nat]Absence check using state equation in 10053 ms returned sat
[2022-05-17 03:51:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 03:51:44] [INFO ] [Nat]Added 12 Read/Feed constraints in 84 ms returned sat
[2022-05-17 03:51:44] [INFO ] Computed and/alt/rep : 373/394/373 causal constraints (skipped 39 transitions) in 45 ms.
[2022-05-17 03:51:45] [INFO ] Added : 32 causal constraints over 7 iterations in 740 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 56 ms :[(NOT p3)]
Product exploration explored 100000 steps with 1712 reset in 985 ms.
Product exploration explored 100000 steps with 1748 reset in 731 ms.
Built C files in :
/tmp/ltsmin14058155777912852519
[2022-05-17 03:51:47] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2022-05-17 03:51:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:51:47] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2022-05-17 03:51:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:51:47] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2022-05-17 03:51:47] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:51:47] [INFO ] Built C files in 238ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14058155777912852519
Running compilation step : cd /tmp/ltsmin14058155777912852519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2236 ms.
Running link step : cd /tmp/ltsmin14058155777912852519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin14058155777912852519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14608606808002313139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 471/471 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 510 transition count 444
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 485 transition count 444
Applied a total of 50 rules in 41 ms. Remains 485 /512 variables (removed 27) and now considering 444/471 (removed 27) transitions.
// Phase 1: matrix 444 rows 485 cols
[2022-05-17 03:52:02] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:52:03] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 444 rows 485 cols
[2022-05-17 03:52:03] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:52:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-17 03:52:06] [INFO ] Implicit Places using invariants and state equation in 2730 ms returned []
Implicit Place search using SMT with State Equation took 3463 ms to find 0 implicit places.
[2022-05-17 03:52:06] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 444 rows 485 cols
[2022-05-17 03:52:06] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:52:06] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/512 places, 444/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 485/512 places, 444/471 transitions.
Built C files in :
/tmp/ltsmin15579490453154268213
[2022-05-17 03:52:06] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2022-05-17 03:52:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:52:06] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2022-05-17 03:52:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:52:06] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2022-05-17 03:52:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:52:06] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15579490453154268213
Running compilation step : cd /tmp/ltsmin15579490453154268213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1845 ms.
Running link step : cd /tmp/ltsmin15579490453154268213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15579490453154268213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1088137597825826743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 03:52:22] [INFO ] Flatten gal took : 35 ms
[2022-05-17 03:52:22] [INFO ] Flatten gal took : 28 ms
[2022-05-17 03:52:22] [INFO ] Time to serialize gal into /tmp/LTL12424506061093099259.gal : 6 ms
[2022-05-17 03:52:22] [INFO ] Time to serialize properties into /tmp/LTL1054749294803631806.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12424506061093099259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1054749294803631806.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1242450...267
Read 1 LTL properties
Checking formula 0 : !((X((!((((G("(init30>=1)"))&&("(newmsg3>=1)"))&&("(reply_35_5_to_left_4>=1)"))U("((newmsg25>=1)&&(election_35_6_10_to_left_26>=1))"))...213
Formula 0 simplified : !X(!(("(newmsg3>=1)" & "(reply_35_5_to_left_4>=1)" & G"(init30>=1)") U "((newmsg25>=1)&&(election_35_6_10_to_left_26>=1))") & F"((ne...198
Detected timeout of ITS tools.
[2022-05-17 03:52:37] [INFO ] Flatten gal took : 69 ms
[2022-05-17 03:52:37] [INFO ] Applying decomposition
[2022-05-17 03:52:37] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8914811132019341710.txt' '-o' '/tmp/graph8914811132019341710.bin' '-w' '/tmp/graph8914811132019341710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8914811132019341710.bin' '-l' '-1' '-v' '-w' '/tmp/graph8914811132019341710.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:52:37] [INFO ] Decomposing Gal with order
[2022-05-17 03:52:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:52:37] [INFO ] Removed a total of 291 redundant transitions.
[2022-05-17 03:52:37] [INFO ] Flatten gal took : 202 ms
[2022-05-17 03:52:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 37 ms.
[2022-05-17 03:52:38] [INFO ] Time to serialize gal into /tmp/LTL628302603504094942.gal : 26 ms
[2022-05-17 03:52:38] [INFO ] Time to serialize properties into /tmp/LTL10939789245836877750.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL628302603504094942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10939789245836877750.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6283026...245
Read 1 LTL properties
Checking formula 0 : !((X((!((((G("(i8.i1.u31.init30>=1)"))&&("(i7.i0.u1.newmsg3>=1)"))&&("(i7.i0.u141.reply_35_5_to_left_4>=1)"))U("((i2.u2.newmsg25>=1)&&...272
Formula 0 simplified : !X(!(("(i7.i0.u1.newmsg3>=1)" & "(i7.i0.u141.reply_35_5_to_left_4>=1)" & G"(i8.i1.u31.init30>=1)") U "((i2.u2.newmsg25>=1)&&(i8.i0.u...257
Reverse transition relation is NOT exact ! Due to transitions t2, t55_t56, t100_t101, t142_t143, t168_t169, t392_t393, t531_t532, t756_t757, i0.t1, i0.u0.t...736
Computing Next relation with stutter on 2.44472e+25 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
914 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.2901,226088,1,0,389628,26312,8045,1.24407e+06,838,178033,654420
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-35-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-00 finished in 116084 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 870 transition count 442
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 483 transition count 442
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 781 place count 476 transition count 435
Iterating global reduction 2 with 7 rules applied. Total rules applied 788 place count 476 transition count 435
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 791 place count 476 transition count 432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 794 place count 473 transition count 432
Applied a total of 794 rules in 110 ms. Remains 473 /904 variables (removed 431) and now considering 432/863 (removed 431) transitions.
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:52:48] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:52:49] [INFO ] Implicit Places using invariants in 888 ms returned []
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:52:49] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:52:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:52:53] [INFO ] Implicit Places using invariants and state equation in 3852 ms returned []
Implicit Place search using SMT with State Equation took 4741 ms to find 0 implicit places.
[2022-05-17 03:52:53] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:52:53] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:52:54] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/904 places, 432/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/904 places, 432/863 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s128 1) (GEQ s138 1)) (AND (GEQ s128 1) (GEQ s138 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 740 reset in 719 ms.
Product exploration explored 100000 steps with 740 reset in 839 ms.
Computed a total of 473 stabilizing places and 432 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 432
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 154 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:52:57] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:52:58] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 363 ms returned sat
[2022-05-17 03:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:53:00] [INFO ] [Real]Absence check using state equation in 1840 ms returned sat
[2022-05-17 03:53:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:53:01] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 480 ms returned sat
[2022-05-17 03:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:53:04] [INFO ] [Nat]Absence check using state equation in 3201 ms returned sat
[2022-05-17 03:53:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:53:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2022-05-17 03:53:04] [INFO ] Computed and/alt/rep : 366/383/366 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-17 03:53:05] [INFO ] Added : 33 causal constraints over 7 iterations in 701 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 432/432 transitions.
Applied a total of 0 rules in 66 ms. Remains 473 /473 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:53:05] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:53:06] [INFO ] Implicit Places using invariants in 1045 ms returned []
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:53:06] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:53:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:53:10] [INFO ] Implicit Places using invariants and state equation in 3705 ms returned []
Implicit Place search using SMT with State Equation took 4758 ms to find 0 implicit places.
[2022-05-17 03:53:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:53:10] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:53:10] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/473 places, 432/432 transitions.
Computed a total of 473 stabilizing places and 432 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 432
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 152 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 432 rows 473 cols
[2022-05-17 03:53:11] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:53:12] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 356 ms returned sat
[2022-05-17 03:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:53:15] [INFO ] [Real]Absence check using state equation in 2173 ms returned sat
[2022-05-17 03:53:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:53:15] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 302 ms returned sat
[2022-05-17 03:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:53:19] [INFO ] [Nat]Absence check using state equation in 3172 ms returned sat
[2022-05-17 03:53:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:53:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2022-05-17 03:53:19] [INFO ] Computed and/alt/rep : 366/383/366 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-17 03:53:19] [INFO ] Added : 33 causal constraints over 7 iterations in 455 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 740 reset in 647 ms.
Product exploration explored 100000 steps with 740 reset in 503 ms.
Built C files in :
/tmp/ltsmin1877668430318659940
[2022-05-17 03:53:20] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2022-05-17 03:53:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:53:20] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2022-05-17 03:53:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:53:20] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2022-05-17 03:53:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:53:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1877668430318659940
Running compilation step : cd /tmp/ltsmin1877668430318659940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1821 ms.
Running link step : cd /tmp/ltsmin1877668430318659940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1877668430318659940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12331070024167573118.hoa' '--buchi-type=spotba'
LTSmin run took 2512 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-35-LTLFireability-01 finished in 36355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U X(X(p1))) U X(p2)))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 119 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:53:25] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:53:26] [INFO ] Implicit Places using invariants in 1013 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:53:26] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-17 03:53:30] [INFO ] Implicit Places using invariants and state equation in 3920 ms returned []
Implicit Place search using SMT with State Equation took 4935 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:53:30] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-17 03:53:31] [INFO ] Dead Transitions using invariants and state equation in 1403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), true, (NOT p1), p0]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s609 1)), p2:(AND (GEQ s55 1) (GEQ s344 1)), p1:(GEQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 528 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-02 finished in 6887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 33 places and 33 transitions.
Drop transitions removed 369 transitions
Trivial Post-agglo rules discarded 369 transitions
Performed 369 trivial Post agglomeration. Transition count delta: 369
Iterating post reduction 0 with 369 rules applied. Total rules applied 369 place count 871 transition count 461
Reduce places removed 369 places and 0 transitions.
Iterating post reduction 1 with 369 rules applied. Total rules applied 738 place count 502 transition count 461
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 744 place count 496 transition count 455
Iterating global reduction 2 with 6 rules applied. Total rules applied 750 place count 496 transition count 455
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 752 place count 496 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 754 place count 494 transition count 453
Applied a total of 754 rules in 97 ms. Remains 494 /904 variables (removed 410) and now considering 453/863 (removed 410) transitions.
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:53:32] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:53:33] [INFO ] Implicit Places using invariants in 912 ms returned []
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:53:33] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:53:36] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2022-05-17 03:53:36] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:53:36] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:53:37] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/904 places, 453/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/904 places, 453/863 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s433 1)), p0:(AND (GEQ s9 1) (GEQ s56 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1093 reset in 1001 ms.
Product exploration explored 100000 steps with 1107 reset in 693 ms.
Computed a total of 494 stabilizing places and 453 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 494 transition count 453
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 447 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0)]
Finished random walk after 413 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 567 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:53:40] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:53:41] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 252 ms returned sat
[2022-05-17 03:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:53:54] [INFO ] [Real]Absence check using state equation in 12779 ms returned sat
[2022-05-17 03:53:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:53:55] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 269 ms returned sat
[2022-05-17 03:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:54:04] [INFO ] [Nat]Absence check using state equation in 9285 ms returned sat
[2022-05-17 03:54:04] [INFO ] Computed and/alt/rep : 365/374/365 causal constraints (skipped 23 transitions) in 64 ms.
[2022-05-17 03:54:09] [INFO ] Added : 90 causal constraints over 18 iterations in 4846 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 4 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 453/453 transitions.
Applied a total of 0 rules in 25 ms. Remains 494 /494 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:54:09] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:54:10] [INFO ] Implicit Places using invariants in 952 ms returned []
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:54:10] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:54:13] [INFO ] Implicit Places using invariants and state equation in 3097 ms returned []
Implicit Place search using SMT with State Equation took 4052 ms to find 0 implicit places.
[2022-05-17 03:54:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:54:13] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:54:14] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/494 places, 453/453 transitions.
Computed a total of 494 stabilizing places and 453 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 494 transition count 453
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 437 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Finished random walk after 408 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 538 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 453 rows 494 cols
[2022-05-17 03:54:15] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:54:16] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 249 ms returned sat
[2022-05-17 03:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:54:28] [INFO ] [Real]Absence check using state equation in 11868 ms returned sat
[2022-05-17 03:54:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:54:29] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 412 ms returned sat
[2022-05-17 03:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:54:38] [INFO ] [Nat]Absence check using state equation in 9162 ms returned sat
[2022-05-17 03:54:38] [INFO ] Computed and/alt/rep : 365/374/365 causal constraints (skipped 23 transitions) in 33 ms.
[2022-05-17 03:54:43] [INFO ] Added : 130 causal constraints over 26 iterations in 4791 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1099 reset in 581 ms.
Product exploration explored 100000 steps with 1082 reset in 664 ms.
Built C files in :
/tmp/ltsmin17101547775313466131
[2022-05-17 03:54:44] [INFO ] Computing symmetric may disable matrix : 453 transitions.
[2022-05-17 03:54:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:54:44] [INFO ] Computing symmetric may enable matrix : 453 transitions.
[2022-05-17 03:54:44] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:54:45] [INFO ] Computing Do-Not-Accords matrix : 453 transitions.
[2022-05-17 03:54:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:54:45] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17101547775313466131
Running compilation step : cd /tmp/ltsmin17101547775313466131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1536 ms.
Running link step : cd /tmp/ltsmin17101547775313466131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17101547775313466131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11905044576223805478.hoa' '--buchi-type=spotba'
LTSmin run took 1676 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-35-LTLFireability-03 finished in 76204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(!p0))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 869 transition count 440
Reduce places removed 388 places and 0 transitions.
Iterating post reduction 1 with 388 rules applied. Total rules applied 776 place count 481 transition count 440
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 782 place count 475 transition count 434
Iterating global reduction 2 with 6 rules applied. Total rules applied 788 place count 475 transition count 434
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 791 place count 475 transition count 431
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 794 place count 472 transition count 431
Applied a total of 794 rules in 52 ms. Remains 472 /904 variables (removed 432) and now considering 431/863 (removed 432) transitions.
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:54:48] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:54:49] [INFO ] Implicit Places using invariants in 899 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:54:49] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:54:51] [INFO ] Implicit Places using invariants and state equation in 2362 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
[2022-05-17 03:54:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:54:51] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-17 03:54:52] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/904 places, 431/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/904 places, 431/863 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, false, p0]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s79 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, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-04 finished in 4022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 114 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:54:52] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 03:54:53] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:54:53] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:54:57] [INFO ] Implicit Places using invariants and state equation in 3780 ms returned []
Implicit Place search using SMT with State Equation took 4626 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:54:57] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:54:58] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-05 automaton TGBA Formula[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:(LT s258 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 278 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-05 finished in 5874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!G(p1)&&p0))) U G(p2))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 152 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:54:58] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:54:59] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:54:59] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:02] [INFO ] Implicit Places using invariants and state equation in 3502 ms returned []
Implicit Place search using SMT with State Equation took 4352 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:02] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:03] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), p1, (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s42 1), p1:(GEQ s855 1), p0:(AND (GEQ s9 1) (GEQ s778 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 218 reset in 342 ms.
Product exploration explored 100000 steps with 232 reset in 363 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 617 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Finished random walk after 862 steps, including 0 resets, run visited all 4 properties in 18 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F p0), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 843 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Support contains 3 out of 893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Applied a total of 0 rules in 51 ms. Remains 893 /893 variables (removed 0) and now considering 852/852 (removed 0) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:07] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:55:08] [INFO ] Implicit Places using invariants in 878 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:08] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:11] [INFO ] Implicit Places using invariants and state equation in 3617 ms returned []
Implicit Place search using SMT with State Equation took 4502 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:11] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:13] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/893 places, 852/852 transitions.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 571 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Finished random walk after 856 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p2 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F p0), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 4 factoid took 654 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 237 reset in 356 ms.
Product exploration explored 100000 steps with 211 reset in 366 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Support contains 3 out of 893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Performed 375 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 893 transition count 852
Deduced a syphon composed of 375 places in 7 ms
Applied a total of 375 rules in 204 ms. Remains 893 /893 variables (removed 0) and now considering 852/852 (removed 0) transitions.
[2022-05-17 03:55:16] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:17] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:17] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 893/893 places, 852/852 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/893 places, 852/852 transitions.
Product exploration explored 100000 steps with 407 reset in 621 ms.
Product exploration explored 100000 steps with 417 reset in 663 ms.
Built C files in :
/tmp/ltsmin1600686066338703534
[2022-05-17 03:55:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1600686066338703534
Running compilation step : cd /tmp/ltsmin1600686066338703534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2360 ms.
Running link step : cd /tmp/ltsmin1600686066338703534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1600686066338703534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2467825067081467083.hoa' '--buchi-type=spotba'
LTSmin run took 1291 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-35-LTLFireability-07 finished in 24744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 869 transition count 440
Reduce places removed 388 places and 0 transitions.
Iterating post reduction 1 with 388 rules applied. Total rules applied 776 place count 481 transition count 440
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 782 place count 475 transition count 434
Iterating global reduction 2 with 6 rules applied. Total rules applied 788 place count 475 transition count 434
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 791 place count 475 transition count 431
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 794 place count 472 transition count 431
Applied a total of 794 rules in 64 ms. Remains 472 /904 variables (removed 432) and now considering 431/863 (removed 432) transitions.
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:23] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:23] [INFO ] Implicit Places using invariants in 602 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:23] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:25] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 2905 ms to find 0 implicit places.
[2022-05-17 03:55:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:25] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:26] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/904 places, 431/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/904 places, 431/863 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s77 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 215 reset in 391 ms.
Product exploration explored 100000 steps with 215 reset in 630 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-35-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-09 finished in 4988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 870 transition count 450
Reduce places removed 379 places and 0 transitions.
Iterating post reduction 1 with 379 rules applied. Total rules applied 758 place count 491 transition count 450
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 764 place count 485 transition count 444
Iterating global reduction 2 with 6 rules applied. Total rules applied 770 place count 485 transition count 444
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 772 place count 485 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 774 place count 483 transition count 442
Applied a total of 774 rules in 53 ms. Remains 483 /904 variables (removed 421) and now considering 442/863 (removed 421) transitions.
// Phase 1: matrix 442 rows 483 cols
[2022-05-17 03:55:28] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:28] [INFO ] Implicit Places using invariants in 523 ms returned []
// Phase 1: matrix 442 rows 483 cols
[2022-05-17 03:55:28] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:30] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
[2022-05-17 03:55:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 442 rows 483 cols
[2022-05-17 03:55:30] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-17 03:55:31] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/904 places, 442/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/904 places, 442/863 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s89 1) (GEQ s19 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 470 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-10 finished in 3557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G(F(G((X(p1)||p1))))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 107 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:31] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:55:32] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:32] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-17 03:55:35] [INFO ] Implicit Places using invariants and state equation in 3331 ms returned []
Implicit Place search using SMT with State Equation took 4023 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:35] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-17 03:55:36] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s577 1), p1:(LT s391 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 139 reset in 326 ms.
Product exploration explored 100000 steps with 140 reset in 371 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 389 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 721 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=103 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:55:38] [INFO ] Computed 41 place invariants in 11 ms
[2022-05-17 03:55:40] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 183 ms returned sat
[2022-05-17 03:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:55:53] [INFO ] [Real]Absence check using state equation in 13927 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 858 transition count 431
Reduce places removed 386 places and 0 transitions.
Iterating post reduction 1 with 386 rules applied. Total rules applied 772 place count 472 transition count 431
Applied a total of 772 rules in 26 ms. Remains 472 /893 variables (removed 421) and now considering 431/852 (removed 421) transitions.
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:54] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:54] [INFO ] Implicit Places using invariants in 941 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:54] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:57] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
[2022-05-17 03:55:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:57] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 03:55:57] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/893 places, 431/852 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/893 places, 431/852 transitions.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 350 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=87 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:55:58] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:55:59] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 133 ms returned sat
[2022-05-17 03:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:56:01] [INFO ] [Real]Absence check using state equation in 1966 ms returned sat
[2022-05-17 03:56:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:56:01] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 186 ms returned sat
[2022-05-17 03:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:56:02] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-05-17 03:56:02] [INFO ] Computed and/alt/rep : 362/369/362 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-17 03:56:03] [INFO ] Added : 249 causal constraints over 50 iterations in 1710 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 288 reset in 279 ms.
Product exploration explored 100000 steps with 289 reset in 334 ms.
Built C files in :
/tmp/ltsmin3675240954247992493
[2022-05-17 03:56:04] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2022-05-17 03:56:04] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:04] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2022-05-17 03:56:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:04] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
[2022-05-17 03:56:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:04] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3675240954247992493
Running compilation step : cd /tmp/ltsmin3675240954247992493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1612 ms.
Running link step : cd /tmp/ltsmin3675240954247992493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3675240954247992493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3763615655491871235.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 431/431 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 472 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 471 transition count 430
Applied a total of 2 rules in 20 ms. Remains 471 /472 variables (removed 1) and now considering 430/431 (removed 1) transitions.
// Phase 1: matrix 430 rows 471 cols
[2022-05-17 03:56:19] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:56:20] [INFO ] Implicit Places using invariants in 632 ms returned []
// Phase 1: matrix 430 rows 471 cols
[2022-05-17 03:56:20] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:56:22] [INFO ] Implicit Places using invariants and state equation in 2348 ms returned []
Implicit Place search using SMT with State Equation took 2982 ms to find 0 implicit places.
[2022-05-17 03:56:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 430 rows 471 cols
[2022-05-17 03:56:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-17 03:56:23] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 471/472 places, 430/431 transitions.
Finished structural reductions, in 1 iterations. Remains : 471/472 places, 430/431 transitions.
Built C files in :
/tmp/ltsmin15787867020006897680
[2022-05-17 03:56:23] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2022-05-17 03:56:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:23] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2022-05-17 03:56:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:23] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2022-05-17 03:56:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 03:56:23] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15787867020006897680
Running compilation step : cd /tmp/ltsmin15787867020006897680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1716 ms.
Running link step : cd /tmp/ltsmin15787867020006897680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15787867020006897680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4249491112518825226.hoa' '--buchi-type=spotba'
LTSmin run took 3805 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-35-LTLFireability-11 finished in 57307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&G(p1))))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 897 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 98 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:56:28] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-17 03:56:29] [INFO ] Implicit Places using invariants in 714 ms returned []
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:56:29] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-17 03:56:33] [INFO ] Implicit Places using invariants and state equation in 3405 ms returned []
Implicit Place search using SMT with State Equation took 4123 ms to find 0 implicit places.
// Phase 1: matrix 852 rows 893 cols
[2022-05-17 03:56:33] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:56:34] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s735 1), p1:(AND (GEQ s67 1) (GEQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 3 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-12 finished in 5480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||((X(!p0) U (p1 U p2))&&G(p1)))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 33 places and 33 transitions.
Drop transitions removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 871 transition count 455
Reduce places removed 375 places and 0 transitions.
Iterating post reduction 1 with 375 rules applied. Total rules applied 750 place count 496 transition count 455
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 756 place count 490 transition count 449
Iterating global reduction 2 with 6 rules applied. Total rules applied 762 place count 490 transition count 449
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 765 place count 490 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 768 place count 487 transition count 446
Applied a total of 768 rules in 42 ms. Remains 487 /904 variables (removed 417) and now considering 446/863 (removed 417) transitions.
// Phase 1: matrix 446 rows 487 cols
[2022-05-17 03:56:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-17 03:56:34] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 446 rows 487 cols
[2022-05-17 03:56:35] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-17 03:56:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 03:56:37] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2022-05-17 03:56:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 446 rows 487 cols
[2022-05-17 03:56:37] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:56:38] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/904 places, 446/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 487/904 places, 446/863 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s52 1)), p2:(GEQ s322 1), p0:(LT s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 208 reset in 244 ms.
Product exploration explored 100000 steps with 208 reset in 286 ms.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 14 factoid took 717 ms. Reduced automaton from 6 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-35-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-14 finished in 5889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(X(p0))||!p0))&&X(F(G(X(p1)))))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 869 transition count 441
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 482 transition count 441
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 781 place count 475 transition count 434
Iterating global reduction 2 with 7 rules applied. Total rules applied 788 place count 475 transition count 434
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 791 place count 475 transition count 431
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 794 place count 472 transition count 431
Applied a total of 794 rules in 44 ms. Remains 472 /904 variables (removed 432) and now considering 431/863 (removed 432) transitions.
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:56:40] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-17 03:56:40] [INFO ] Implicit Places using invariants in 760 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:56:40] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:56:43] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
[2022-05-17 03:56:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 431 rows 472 cols
[2022-05-17 03:56:43] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-17 03:56:43] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/904 places, 431/863 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/904 places, 431/863 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s102 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 466 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-15 finished in 3868 ms.
All properties solved by simple procedures.
Total runtime 360949 ms.

BK_STOP 1652759804541

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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="HirschbergSinclair-PT-35"
export BK_EXAMINATION="LTLFireability"
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 HirschbergSinclair-PT-35, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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