Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 34K Feb 25 23:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 23:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Feb 25 23:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 251K Feb 25 23:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 25 23:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 217K Feb 25 23:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 168K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 755K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 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 PolyORBNT-PT-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678955741727

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 08:35:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 08:35:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 08:35:43] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-16 08:35:43] [INFO ] Transformed 629 places.
[2023-03-16 08:35:43] [INFO ] Transformed 1590 transitions.
[2023-03-16 08:35:43] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 481 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Applied a total of 5 rules in 37 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
[2023-03-16 08:35:44] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2023-03-16 08:35:44] [INFO ] Computed 97 place invariants in 62 ms
[2023-03-16 08:35:45] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-16 08:35:45] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2023-03-16 08:35:45] [INFO ] Computed 97 place invariants in 35 ms
[2023-03-16 08:35:46] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-16 08:35:46] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-16 08:35:46] [INFO ] Invariant cache hit.
[2023-03-16 08:35:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:35:50] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 5590 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/935 transitions.
Applied a total of 0 rules in 18 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6843 ms. Remains : 624/629 places, 840/935 transitions.
Support contains 481 out of 624 places after structural reductions.
[2023-03-16 08:35:51] [INFO ] Flatten gal took : 101 ms
[2023-03-16 08:35:51] [INFO ] Flatten gal took : 66 ms
[2023-03-16 08:35:51] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 480 out of 624 places (down from 481) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 675 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 08:35:52] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-16 08:35:52] [INFO ] Invariant cache hit.
[2023-03-16 08:35:52] [INFO ] [Real]Absence check using 76 positive place invariants in 23 ms returned sat
[2023-03-16 08:35:52] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 25 ms returned sat
[2023-03-16 08:35:52] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 08:35:52] [INFO ] [Nat]Absence check using 76 positive place invariants in 22 ms returned sat
[2023-03-16 08:35:52] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 27 ms returned sat
[2023-03-16 08:35:53] [INFO ] After 1068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 08:35:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:35:54] [INFO ] After 898ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 08:35:54] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 4 ms to minimize.
[2023-03-16 08:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-16 08:35:55] [INFO ] Deduced a trap composed of 260 places in 195 ms of which 1 ms to minimize.
[2023-03-16 08:35:55] [INFO ] Deduced a trap composed of 263 places in 215 ms of which 1 ms to minimize.
[2023-03-16 08:35:55] [INFO ] Deduced a trap composed of 257 places in 187 ms of which 1 ms to minimize.
[2023-03-16 08:35:56] [INFO ] Deduced a trap composed of 254 places in 192 ms of which 1 ms to minimize.
[2023-03-16 08:35:56] [INFO ] Deduced a trap composed of 258 places in 180 ms of which 1 ms to minimize.
[2023-03-16 08:35:56] [INFO ] Deduced a trap composed of 270 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:35:56] [INFO ] Deduced a trap composed of 278 places in 188 ms of which 0 ms to minimize.
[2023-03-16 08:35:57] [INFO ] Deduced a trap composed of 248 places in 178 ms of which 1 ms to minimize.
[2023-03-16 08:35:57] [INFO ] Deduced a trap composed of 260 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:35:57] [INFO ] Deduced a trap composed of 263 places in 184 ms of which 1 ms to minimize.
[2023-03-16 08:35:57] [INFO ] Deduced a trap composed of 252 places in 182 ms of which 0 ms to minimize.
[2023-03-16 08:35:58] [INFO ] Deduced a trap composed of 263 places in 190 ms of which 1 ms to minimize.
[2023-03-16 08:35:58] [INFO ] Deduced a trap composed of 260 places in 186 ms of which 1 ms to minimize.
[2023-03-16 08:35:58] [INFO ] Deduced a trap composed of 251 places in 185 ms of which 1 ms to minimize.
[2023-03-16 08:35:59] [INFO ] Deduced a trap composed of 263 places in 187 ms of which 0 ms to minimize.
[2023-03-16 08:35:59] [INFO ] Deduced a trap composed of 263 places in 186 ms of which 0 ms to minimize.
[2023-03-16 08:35:59] [INFO ] Deduced a trap composed of 263 places in 185 ms of which 0 ms to minimize.
[2023-03-16 08:35:59] [INFO ] Deduced a trap composed of 256 places in 179 ms of which 1 ms to minimize.
[2023-03-16 08:36:00] [INFO ] Deduced a trap composed of 269 places in 180 ms of which 1 ms to minimize.
[2023-03-16 08:36:00] [INFO ] Deduced a trap composed of 275 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:36:00] [INFO ] Deduced a trap composed of 269 places in 183 ms of which 1 ms to minimize.
[2023-03-16 08:36:00] [INFO ] Deduced a trap composed of 248 places in 181 ms of which 0 ms to minimize.
[2023-03-16 08:36:01] [INFO ] Deduced a trap composed of 260 places in 175 ms of which 0 ms to minimize.
[2023-03-16 08:36:01] [INFO ] Deduced a trap composed of 257 places in 181 ms of which 3 ms to minimize.
[2023-03-16 08:36:01] [INFO ] Deduced a trap composed of 260 places in 178 ms of which 0 ms to minimize.
[2023-03-16 08:36:01] [INFO ] Deduced a trap composed of 254 places in 178 ms of which 1 ms to minimize.
[2023-03-16 08:36:02] [INFO ] Deduced a trap composed of 254 places in 181 ms of which 0 ms to minimize.
[2023-03-16 08:36:02] [INFO ] Deduced a trap composed of 245 places in 180 ms of which 1 ms to minimize.
[2023-03-16 08:36:02] [INFO ] Deduced a trap composed of 260 places in 175 ms of which 0 ms to minimize.
[2023-03-16 08:36:02] [INFO ] Deduced a trap composed of 260 places in 186 ms of which 0 ms to minimize.
[2023-03-16 08:36:02] [INFO ] Deduced a trap composed of 254 places in 176 ms of which 1 ms to minimize.
[2023-03-16 08:36:03] [INFO ] Deduced a trap composed of 273 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:36:03] [INFO ] Deduced a trap composed of 272 places in 185 ms of which 1 ms to minimize.
[2023-03-16 08:36:03] [INFO ] Deduced a trap composed of 261 places in 183 ms of which 1 ms to minimize.
[2023-03-16 08:36:04] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 1 ms to minimize.
[2023-03-16 08:36:04] [INFO ] Deduced a trap composed of 271 places in 183 ms of which 1 ms to minimize.
[2023-03-16 08:36:04] [INFO ] Deduced a trap composed of 273 places in 186 ms of which 0 ms to minimize.
[2023-03-16 08:36:04] [INFO ] Deduced a trap composed of 261 places in 185 ms of which 0 ms to minimize.
[2023-03-16 08:36:05] [INFO ] Deduced a trap composed of 272 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:36:05] [INFO ] Deduced a trap composed of 266 places in 187 ms of which 1 ms to minimize.
[2023-03-16 08:36:05] [INFO ] Deduced a trap composed of 265 places in 184 ms of which 1 ms to minimize.
[2023-03-16 08:36:05] [INFO ] Deduced a trap composed of 265 places in 190 ms of which 0 ms to minimize.
[2023-03-16 08:36:06] [INFO ] Deduced a trap composed of 246 places in 183 ms of which 1 ms to minimize.
[2023-03-16 08:36:07] [INFO ] Deduced a trap composed of 263 places in 181 ms of which 1 ms to minimize.
[2023-03-16 08:36:08] [INFO ] Deduced a trap composed of 250 places in 183 ms of which 1 ms to minimize.
[2023-03-16 08:36:09] [INFO ] Deduced a trap composed of 274 places in 185 ms of which 1 ms to minimize.
[2023-03-16 08:36:09] [INFO ] Deduced a trap composed of 256 places in 178 ms of which 0 ms to minimize.
[2023-03-16 08:36:09] [INFO ] Deduced a trap composed of 251 places in 185 ms of which 0 ms to minimize.
[2023-03-16 08:36:09] [INFO ] Deduced a trap composed of 273 places in 184 ms of which 0 ms to minimize.
[2023-03-16 08:36:10] [INFO ] Deduced a trap composed of 257 places in 182 ms of which 1 ms to minimize.
[2023-03-16 08:36:10] [INFO ] Deduced a trap composed of 258 places in 185 ms of which 0 ms to minimize.
[2023-03-16 08:36:10] [INFO ] Deduced a trap composed of 260 places in 187 ms of which 0 ms to minimize.
[2023-03-16 08:36:11] [INFO ] Deduced a trap composed of 277 places in 185 ms of which 1 ms to minimize.
[2023-03-16 08:36:12] [INFO ] Deduced a trap composed of 252 places in 185 ms of which 0 ms to minimize.
[2023-03-16 08:36:13] [INFO ] Deduced a trap composed of 266 places in 179 ms of which 0 ms to minimize.
[2023-03-16 08:36:17] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 22032 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 08:36:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 08:36:17] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 159 ms. Remains 531 /624 variables (removed 93) and now considering 747/840 (removed 93) transitions.
[2023-03-16 08:36:17] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-16 08:36:17] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-16 08:36:18] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 531/624 places, 747/840 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 08:36:18] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2023-03-16 08:36:18] [INFO ] Invariant cache hit.
[2023-03-16 08:36:18] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-16 08:36:18] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-16 08:36:18] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 08:36:18] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-16 08:36:18] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 26 ms returned sat
[2023-03-16 08:36:18] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 08:36:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:36:19] [INFO ] After 747ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 08:36:19] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 0 ms to minimize.
[2023-03-16 08:36:20] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:36:20] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 1 ms to minimize.
[2023-03-16 08:36:20] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:36:20] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 1 ms to minimize.
[2023-03-16 08:36:20] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:36:21] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:36:21] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:36:21] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:36:21] [INFO ] Deduced a trap composed of 200 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:36:21] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:36:22] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 2 ms to minimize.
[2023-03-16 08:36:22] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:36:22] [INFO ] Deduced a trap composed of 183 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:36:22] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:36:22] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:36:23] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2023-03-16 08:36:23] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:36:23] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:36:23] [INFO ] Deduced a trap composed of 182 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:36:24] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:36:24] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:36:24] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:36:24] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:36:25] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:36:25] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2023-03-16 08:36:25] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 0 ms to minimize.
[2023-03-16 08:36:25] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:36:26] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:36:28] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:36:28] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:36:31] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:36:38] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:36:43] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 23637 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 08:36:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 08:36:43] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 531 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 746
Applied a total of 2 rules in 42 ms. Remains 530 /531 variables (removed 1) and now considering 746/747 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 530/531 places, 746/747 transitions.
Incomplete random walk after 10001 steps, including 513 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262079 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262079 steps, saw 78242 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 08:36:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-16 08:36:46] [INFO ] Computed 97 place invariants in 26 ms
[2023-03-16 08:36:46] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-16 08:36:46] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-16 08:36:46] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 08:36:46] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-16 08:36:46] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 23 ms returned sat
[2023-03-16 08:36:47] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 08:36:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:36:47] [INFO ] After 502ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 08:36:48] [INFO ] Deduced a trap composed of 180 places in 146 ms of which 0 ms to minimize.
[2023-03-16 08:36:48] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:36:48] [INFO ] Deduced a trap composed of 180 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:36:48] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:36:48] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:36:49] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:36:49] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:36:49] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 0 ms to minimize.
[2023-03-16 08:36:49] [INFO ] Deduced a trap composed of 189 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:36:49] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 1 ms to minimize.
[2023-03-16 08:36:50] [INFO ] Deduced a trap composed of 193 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:36:51] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:36:51] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:36:51] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:36:51] [INFO ] Deduced a trap composed of 187 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:36:52] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:36:52] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:36:53] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:36:53] [INFO ] Deduced a trap composed of 170 places in 166 ms of which 0 ms to minimize.
[2023-03-16 08:36:55] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:36:55] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:37:04] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 16553 ms
[2023-03-16 08:37:04] [INFO ] After 17131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 08:37:04] [INFO ] After 18104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 23 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 23 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-16 08:37:04] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:37:04] [INFO ] Invariant cache hit.
[2023-03-16 08:37:05] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-16 08:37:05] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:37:05] [INFO ] Invariant cache hit.
[2023-03-16 08:37:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:37:11] [INFO ] Implicit Places using invariants and state equation in 6587 ms returned []
Implicit Place search using SMT with State Equation took 7233 ms to find 0 implicit places.
[2023-03-16 08:37:11] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-16 08:37:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:37:11] [INFO ] Invariant cache hit.
[2023-03-16 08:37:12] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7849 ms. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 81 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-16 08:37:12] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-16 08:37:12] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-16 08:37:12] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-16 08:37:12] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 08:37:12] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-16 08:37:12] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-16 08:37:13] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 08:37:13] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:37:13] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:37:13] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 156 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:14] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:37:15] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-16 08:37:15] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 1 ms to minimize.
[2023-03-16 08:37:15] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:37:15] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:37:15] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:16] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:37:16] [INFO ] Deduced a trap composed of 180 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:16] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 0 ms to minimize.
[2023-03-16 08:37:17] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:37:17] [INFO ] Deduced a trap composed of 180 places in 147 ms of which 1 ms to minimize.
[2023-03-16 08:37:17] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:37:17] [INFO ] Deduced a trap composed of 180 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:18] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:37:18] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:18] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:37:18] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 2 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:37:19] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:37:20] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:20] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:37:20] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:37:20] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:37:20] [INFO ] Deduced a trap composed of 186 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:21] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:37:21] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:21] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:21] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:37:22] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:37:22] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:37:22] [INFO ] Deduced a trap composed of 198 places in 143 ms of which 0 ms to minimize.
[2023-03-16 08:37:22] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:37:22] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 0 ms to minimize.
[2023-03-16 08:37:23] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:37:23] [INFO ] Deduced a trap composed of 186 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:24] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 0 ms to minimize.
[2023-03-16 08:37:24] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2023-03-16 08:37:25] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:37:25] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:37:25] [INFO ] Deduced a trap composed of 180 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:37:25] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:37:25] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:26] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:26] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:26] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 1 ms to minimize.
[2023-03-16 08:37:26] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2023-03-16 08:37:26] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:27] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:37:27] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:37:27] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:37:28] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:37:28] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:37:28] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:28] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:37:29] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 3 ms to minimize.
[2023-03-16 08:37:29] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:37:29] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:29] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:29] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:37:30] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:30] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 1 ms to minimize.
[2023-03-16 08:37:30] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:37:31] [INFO ] Deduced a trap composed of 177 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:37:31] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 1 ms to minimize.
[2023-03-16 08:37:31] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:32] [INFO ] Deduced a trap composed of 180 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:37:33] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:37:33] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 0 ms to minimize.
[2023-03-16 08:37:33] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:37:33] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:37:33] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:37:34] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:37:34] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:37:34] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:37:35] [INFO ] Deduced a trap composed of 177 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:37:35] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:37:36] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:37:36] [INFO ] Deduced a trap composed of 177 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:37:37] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:37:37] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:37] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 0 ms to minimize.
[2023-03-16 08:37:37] [INFO ] Deduced a trap composed of 153 places in 139 ms of which 1 ms to minimize.
[2023-03-16 08:37:38] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:38] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:37:38] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:37:39] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 1 ms to minimize.
[2023-03-16 08:37:39] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:37:39] [INFO ] Deduced a trap composed of 177 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:37:39] [INFO ] Deduced a trap composed of 186 places in 142 ms of which 1 ms to minimize.
[2023-03-16 08:37:39] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:37:41] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:37:42] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:37:45] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:37:48] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 0 ms to minimize.
[2023-03-16 08:37:49] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:37:58] [INFO ] Trap strengthening (SAT) tested/added 107/107 trap constraints in 44728 ms
[2023-03-16 08:37:58] [INFO ] After 45309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 08:37:58] [INFO ] After 45408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&G(p1))))'
Support contains 44 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 44 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:37:58] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-16 08:37:58] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-16 08:37:59] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
[2023-03-16 08:37:59] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:37:59] [INFO ] Invariant cache hit.
[2023-03-16 08:38:00] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-16 08:38:00] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:00] [INFO ] Invariant cache hit.
[2023-03-16 08:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:38:10] [INFO ] Implicit Places using invariants and state equation in 10430 ms returned []
Implicit Place search using SMT with State Equation took 11149 ms to find 0 implicit places.
[2023-03-16 08:38:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:10] [INFO ] Invariant cache hit.
[2023-03-16 08:38:11] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13007 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s105 1) (LT s165 1) (LT s574 1)) (OR (LT s165 1) (LT s489 1) (LT s574 1)) (OR (LT s165 1) (LT s450 1) (LT s574 1)) (OR (LT s165 1) (LT s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12460 reset in 868 ms.
Product exploration explored 100000 steps with 12634 reset in 784 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 4449 steps, including 317 resets, run visited all 2 properties in 14 ms. (steps per millisecond=317 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 15 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2023-03-16 08:38:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:14] [INFO ] Invariant cache hit.
[2023-03-16 08:38:15] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
[2023-03-16 08:38:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:15] [INFO ] Invariant cache hit.
[2023-03-16 08:38:15] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-16 08:38:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:15] [INFO ] Invariant cache hit.
[2023-03-16 08:38:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:38:25] [INFO ] Implicit Places using invariants and state equation in 9600 ms returned []
Implicit Place search using SMT with State Equation took 10321 ms to find 0 implicit places.
[2023-03-16 08:38:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:25] [INFO ] Invariant cache hit.
[2023-03-16 08:38:26] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12190 ms. Remains : 623/623 places, 839/839 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 1484 steps, including 100 resets, run visited all 2 properties in 8 ms. (steps per millisecond=185 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12704 reset in 734 ms.
Product exploration explored 100000 steps with 12610 reset in 751 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 623 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 43 place count 623 transition count 840
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 623 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 622 transition count 839
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 622 transition count 839
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 622 transition count 839
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 135 place count 580 transition count 797
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 177 place count 580 transition count 797
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 177 rules in 191 ms. Remains 580 /623 variables (removed 43) and now considering 797/839 (removed 42) transitions.
[2023-03-16 08:38:29] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
// Phase 1: matrix 793 rows 580 cols
[2023-03-16 08:38:29] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-16 08:38:29] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
[2023-03-16 08:38:29] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 08:38:29] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
[2023-03-16 08:38:29] [INFO ] Invariant cache hit.
[2023-03-16 08:38:30] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/623 places, 797/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1360 ms. Remains : 580/623 places, 797/839 transitions.
Built C files in :
/tmp/ltsmin12598799280383062756
[2023-03-16 08:38:30] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12598799280383062756
Running compilation step : cd /tmp/ltsmin12598799280383062756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1492 ms.
Running link step : cd /tmp/ltsmin12598799280383062756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12598799280383062756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2419347210681185833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2023-03-16 08:38:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-16 08:38:45] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-16 08:38:46] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
[2023-03-16 08:38:46] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:46] [INFO ] Invariant cache hit.
[2023-03-16 08:38:47] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-16 08:38:47] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:47] [INFO ] Invariant cache hit.
[2023-03-16 08:38:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:38:56] [INFO ] Implicit Places using invariants and state equation in 9465 ms returned []
Implicit Place search using SMT with State Equation took 10152 ms to find 0 implicit places.
[2023-03-16 08:38:56] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:38:56] [INFO ] Invariant cache hit.
[2023-03-16 08:38:57] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12009 ms. Remains : 623/623 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin16045437970386658401
[2023-03-16 08:38:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16045437970386658401
Running compilation step : cd /tmp/ltsmin16045437970386658401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1430 ms.
Running link step : cd /tmp/ltsmin16045437970386658401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16045437970386658401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15390533812051023564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 08:39:12] [INFO ] Flatten gal took : 49 ms
[2023-03-16 08:39:12] [INFO ] Flatten gal took : 44 ms
[2023-03-16 08:39:12] [INFO ] Time to serialize gal into /tmp/LTL5965658415996454366.gal : 7 ms
[2023-03-16 08:39:12] [INFO ] Time to serialize properties into /tmp/LTL13554077632048306677.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5965658415996454366.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7743818185781887306.hoa' '-atoms' '/tmp/LTL13554077632048306677.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13554077632048306677.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7743818185781887306.hoa
Detected timeout of ITS tools.
[2023-03-16 08:39:27] [INFO ] Flatten gal took : 43 ms
[2023-03-16 08:39:27] [INFO ] Flatten gal took : 36 ms
[2023-03-16 08:39:27] [INFO ] Time to serialize gal into /tmp/LTL11638614979836958028.gal : 6 ms
[2023-03-16 08:39:27] [INFO ] Time to serialize properties into /tmp/LTL16970761745531327369.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11638614979836958028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16970761745531327369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X(F("(NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1...1955
Formula 0 simplified : G(XG!"(NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1))||(b...1945
Detected timeout of ITS tools.
[2023-03-16 08:39:43] [INFO ] Flatten gal took : 34 ms
[2023-03-16 08:39:43] [INFO ] Applying decomposition
[2023-03-16 08:39:43] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7464347089001368144.txt' '-o' '/tmp/graph7464347089001368144.bin' '-w' '/tmp/graph7464347089001368144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7464347089001368144.bin' '-l' '-1' '-v' '-w' '/tmp/graph7464347089001368144.weights' '-q' '0' '-e' '0.001'
[2023-03-16 08:39:43] [INFO ] Decomposing Gal with order
[2023-03-16 08:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 08:39:43] [INFO ] Removed a total of 881 redundant transitions.
[2023-03-16 08:39:43] [INFO ] Flatten gal took : 258 ms
[2023-03-16 08:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 33 ms.
[2023-03-16 08:39:43] [INFO ] Time to serialize gal into /tmp/LTL9732220825878794723.gal : 13 ms
[2023-03-16 08:39:43] [INFO ] Time to serialize properties into /tmp/LTL4619949083541110590.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9732220825878794723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4619949083541110590.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X(F("(i18.i2.u75.NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((i4.u34.QueueJobB_1_37<1)||(i4.u34.mi1<1))||(i4.u8.block<1)...2786
Formula 0 simplified : G(XG!"(i18.i2.u75.NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((i4.u34.QueueJobB_1_37<1)||(i4.u34.mi1<1))||(i4.u8.block<1))&&(((...2776
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15622124136655262905
[2023-03-16 08:39:58] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15622124136655262905
Running compilation step : cd /tmp/ltsmin15622124136655262905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1426 ms.
Running link step : cd /tmp/ltsmin15622124136655262905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15622124136655262905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 135365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U X(p1))))))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 21 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:40:13] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:13] [INFO ] Invariant cache hit.
[2023-03-16 08:40:14] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
[2023-03-16 08:40:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:14] [INFO ] Invariant cache hit.
[2023-03-16 08:40:15] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-16 08:40:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:15] [INFO ] Invariant cache hit.
[2023-03-16 08:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:40:25] [INFO ] Implicit Places using invariants and state equation in 9646 ms returned []
Implicit Place search using SMT with State Equation took 10374 ms to find 0 implicit places.
[2023-03-16 08:40:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:25] [INFO ] Invariant cache hit.
[2023-03-16 08:40:26] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12214 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s192 1) (GEQ s516 1) (GEQ s258 1) (GEQ s447 1) (GEQ s518 1) (GEQ s319 1) (GEQ s254 1) (GEQ s266 1) (GEQ s12 1) (GEQ s452 1) (GEQ s263 1) (GEQ ...], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-01 finished in 12485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 530 transition count 746
Applied a total of 188 rules in 54 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2023-03-16 08:40:26] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-16 08:40:26] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-16 08:40:26] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
[2023-03-16 08:40:26] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:40:26] [INFO ] Invariant cache hit.
[2023-03-16 08:40:27] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-16 08:40:27] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:40:27] [INFO ] Invariant cache hit.
[2023-03-16 08:40:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:40:34] [INFO ] Implicit Places using invariants and state equation in 6593 ms returned []
Implicit Place search using SMT with State Equation took 7237 ms to find 0 implicit places.
[2023-03-16 08:40:34] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 08:40:34] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-16 08:40:34] [INFO ] Invariant cache hit.
[2023-03-16 08:40:34] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/624 places, 746/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8455 ms. Remains : 530/624 places, 746/840 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s252 1) (GEQ s383 1) (GEQ s486 1)) (AND (GEQ s99 1) (GEQ s252 1) (GEQ s486 1)) (AND (GEQ s88 1) (GEQ s252 1) (GEQ s486 1)) (AND (GEQ s183...], 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 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-02 finished in 8499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 88 place count 580 transition count 750
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 43 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-16 08:40:34] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-16 08:40:34] [INFO ] Computed 97 place invariants in 22 ms
[2023-03-16 08:40:35] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2023-03-16 08:40:35] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:40:35] [INFO ] Invariant cache hit.
[2023-03-16 08:40:36] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-03-16 08:40:36] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:40:36] [INFO ] Invariant cache hit.
[2023-03-16 08:40:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:40:43] [INFO ] Implicit Places using invariants and state equation in 7270 ms returned []
Implicit Place search using SMT with State Equation took 7894 ms to find 0 implicit places.
[2023-03-16 08:40:43] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 08:40:43] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:40:43] [INFO ] Invariant cache hit.
[2023-03-16 08:40:43] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9122 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-04 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:(GEQ s184 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]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-04 finished in 9212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1)||X((p2||X(X(G(p3)))))))))'
Support contains 331 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 18 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:40:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-16 08:40:44] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-16 08:40:44] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
[2023-03-16 08:40:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:44] [INFO ] Invariant cache hit.
[2023-03-16 08:40:45] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-16 08:40:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:45] [INFO ] Invariant cache hit.
[2023-03-16 08:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:40:52] [INFO ] Implicit Places using invariants and state equation in 6773 ms returned []
Implicit Place search using SMT with State Equation took 7278 ms to find 0 implicit places.
[2023-03-16 08:40:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:52] [INFO ] Invariant cache hit.
[2023-03-16 08:40:53] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9160 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LT s446 1), p0:(OR (AND (GEQ s56 1) (GEQ s128 1)) (AND (GEQ s124 1) (GEQ s507 1)) (AND (GEQ s480 1) (GEQ s619 1)) (AND (GEQ s90 1) (GEQ s181 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-05 finished in 9446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 26 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:40:53] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:53] [INFO ] Invariant cache hit.
[2023-03-16 08:40:54] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
[2023-03-16 08:40:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:54] [INFO ] Invariant cache hit.
[2023-03-16 08:40:55] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-16 08:40:55] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:40:55] [INFO ] Invariant cache hit.
[2023-03-16 08:40:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:41:05] [INFO ] Implicit Places using invariants and state equation in 10654 ms returned []
Implicit Place search using SMT with State Equation took 11420 ms to find 0 implicit places.
[2023-03-16 08:41:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:05] [INFO ] Invariant cache hit.
[2023-03-16 08:41:06] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13303 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s218 1), p0:(AND (OR (LT s449 1) (LT s591 1)) (OR (LT s106 1) (LT s591 1)) (OR (LT s62 1) (LT s591 1)) (OR (LT s585 1) (LT s591 1)) (OR (LT s322 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 796 ms.
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-07 finished in 15172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 19 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:41:08] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:08] [INFO ] Invariant cache hit.
[2023-03-16 08:41:09] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
[2023-03-16 08:41:09] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:09] [INFO ] Invariant cache hit.
[2023-03-16 08:41:10] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-16 08:41:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:10] [INFO ] Invariant cache hit.
[2023-03-16 08:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:41:20] [INFO ] Implicit Places using invariants and state equation in 10512 ms returned []
Implicit Place search using SMT with State Equation took 11271 ms to find 0 implicit places.
[2023-03-16 08:41:20] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:20] [INFO ] Invariant cache hit.
[2023-03-16 08:41:21] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13143 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s298 1) (LT s432 1) (LT s574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 516 ms.
Product exploration explored 100000 steps with 33333 reset in 512 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-08 finished in 14342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 17 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:41:22] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:22] [INFO ] Invariant cache hit.
[2023-03-16 08:41:23] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
[2023-03-16 08:41:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:23] [INFO ] Invariant cache hit.
[2023-03-16 08:41:24] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-16 08:41:24] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:24] [INFO ] Invariant cache hit.
[2023-03-16 08:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:41:34] [INFO ] Implicit Places using invariants and state equation in 9529 ms returned []
Implicit Place search using SMT with State Equation took 10288 ms to find 0 implicit places.
[2023-03-16 08:41:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:34] [INFO ] Invariant cache hit.
[2023-03-16 08:41:35] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12152 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s121 6) (LT s289 1) (LT s297 1) (LT s468 1) (LT s561 1) (LT s610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Product exploration explored 100000 steps with 50000 reset in 626 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-09 finished in 13546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(((!p0 U (p2||G(!p0)))||p1))))'
Support contains 5 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 22 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:41:36] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:36] [INFO ] Invariant cache hit.
[2023-03-16 08:41:37] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
[2023-03-16 08:41:37] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:37] [INFO ] Invariant cache hit.
[2023-03-16 08:41:38] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-16 08:41:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:38] [INFO ] Invariant cache hit.
[2023-03-16 08:41:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:41:50] [INFO ] Implicit Places using invariants and state equation in 12057 ms returned []
Implicit Place search using SMT with State Equation took 12816 ms to find 0 implicit places.
[2023-03-16 08:41:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:50] [INFO ] Invariant cache hit.
[2023-03-16 08:41:51] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14682 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s215 1) (GEQ s417 1)), p1:(OR (LT s46 1) (LT s77 1)), p2:(AND (NOT (AND (GEQ s417 1) (GEQ s591 10))) (NOT (AND (GEQ s215 1) (GEQ s417 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-10 finished in 14822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(G(!p0)))) U (F(p2)&&p1)))'
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 22 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:41:51] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:51] [INFO ] Invariant cache hit.
[2023-03-16 08:41:52] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
[2023-03-16 08:41:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:52] [INFO ] Invariant cache hit.
[2023-03-16 08:41:52] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-16 08:41:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:41:52] [INFO ] Invariant cache hit.
[2023-03-16 08:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:42:01] [INFO ] Implicit Places using invariants and state equation in 9057 ms returned []
Implicit Place search using SMT with State Equation took 9755 ms to find 0 implicit places.
[2023-03-16 08:42:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:42:01] [INFO ] Invariant cache hit.
[2023-03-16 08:42:02] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11616 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), true, p0]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s101 1) (GEQ s559 1) (GEQ s610 1)), p2:(AND (GEQ s55 1) (GEQ s59 1) (GEQ s493 1)), p0:(LT s78 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-11 finished in 11784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 20 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:42:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:42:03] [INFO ] Invariant cache hit.
[2023-03-16 08:42:04] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
[2023-03-16 08:42:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:42:04] [INFO ] Invariant cache hit.
[2023-03-16 08:42:04] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-16 08:42:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:42:04] [INFO ] Invariant cache hit.
[2023-03-16 08:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:42:15] [INFO ] Implicit Places using invariants and state equation in 10201 ms returned []
Implicit Place search using SMT with State Equation took 10973 ms to find 0 implicit places.
[2023-03-16 08:42:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:42:15] [INFO ] Invariant cache hit.
[2023-03-16 08:42:15] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12860 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s446 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 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-12 finished in 12963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 50 ms. Remains 533 /624 variables (removed 91) and now considering 749/840 (removed 91) transitions.
[2023-03-16 08:42:16] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2023-03-16 08:42:16] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-16 08:42:16] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-16 08:42:16] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-16 08:42:16] [INFO ] Invariant cache hit.
[2023-03-16 08:42:17] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-16 08:42:17] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-16 08:42:17] [INFO ] Invariant cache hit.
[2023-03-16 08:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:42:28] [INFO ] Implicit Places using invariants and state equation in 10675 ms returned []
Implicit Place search using SMT with State Equation took 11336 ms to find 0 implicit places.
[2023-03-16 08:42:28] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 08:42:28] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-16 08:42:28] [INFO ] Invariant cache hit.
[2023-03-16 08:42:28] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/624 places, 749/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12603 ms. Remains : 533/624 places, 749/840 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s434 1), p1:(AND (GEQ s84 1) (GEQ s476 1) (GEQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-13 finished in 13082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 88 place count 580 transition count 751
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 53 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-16 08:42:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-16 08:42:29] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-16 08:42:29] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-16 08:42:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:42:29] [INFO ] Invariant cache hit.
[2023-03-16 08:42:30] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-16 08:42:30] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:42:30] [INFO ] Invariant cache hit.
[2023-03-16 08:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:42:39] [INFO ] Implicit Places using invariants and state equation in 8649 ms returned []
Implicit Place search using SMT with State Equation took 9335 ms to find 0 implicit places.
[2023-03-16 08:42:39] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 08:42:39] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:42:39] [INFO ] Invariant cache hit.
[2023-03-16 08:42:39] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10564 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s185 1), p1:(GEQ s53 4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7139 reset in 371 ms.
Product exploration explored 100000 steps with 7132 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 655 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 299 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 08:42:41] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:42:41] [INFO ] Invariant cache hit.
[2023-03-16 08:42:41] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-16 08:42:41] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-16 08:42:41] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 08:42:41] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-16 08:42:41] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-16 08:42:43] [INFO ] After 1447ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-16 08:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:42:43] [INFO ] After 463ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-16 08:42:44] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 1 ms to minimize.
[2023-03-16 08:42:44] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:42:44] [INFO ] Deduced a trap composed of 172 places in 167 ms of which 1 ms to minimize.
[2023-03-16 08:42:44] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:42:44] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:42:45] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:42:45] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 0 ms to minimize.
[2023-03-16 08:42:45] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 2 ms to minimize.
[2023-03-16 08:42:45] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:42:45] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2023-03-16 08:42:46] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:42:46] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:42:46] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 3 ms to minimize.
[2023-03-16 08:42:46] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:42:46] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:42:47] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:42:47] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:42:47] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:42:47] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 0 ms to minimize.
[2023-03-16 08:42:48] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 3 ms to minimize.
[2023-03-16 08:42:48] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:42:48] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:42:49] [INFO ] Deduced a trap composed of 163 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:42:49] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:42:49] [INFO ] Deduced a trap composed of 178 places in 152 ms of which 2 ms to minimize.
[2023-03-16 08:42:49] [INFO ] Deduced a trap composed of 178 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:42:50] [INFO ] Deduced a trap composed of 181 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:42:50] [INFO ] Deduced a trap composed of 169 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:42:50] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:42:50] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:42:50] [INFO ] Deduced a trap composed of 163 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:42:51] [INFO ] Deduced a trap composed of 178 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:42:51] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:42:51] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:42:51] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:42:51] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 0 ms to minimize.
[2023-03-16 08:42:52] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:42:52] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:42:52] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:42:52] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 1 ms to minimize.
[2023-03-16 08:42:53] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:42:54] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 0 ms to minimize.
[2023-03-16 08:42:55] [INFO ] Deduced a trap composed of 178 places in 160 ms of which 0 ms to minimize.
[2023-03-16 08:42:55] [INFO ] Deduced a trap composed of 188 places in 164 ms of which 0 ms to minimize.
[2023-03-16 08:42:58] [INFO ] Deduced a trap composed of 175 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:06] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 22961 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 08:43:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 08:43:06] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:43:06] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:43:06] [INFO ] Invariant cache hit.
[2023-03-16 08:43:07] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 532/532 places, 748/748 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 220213 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220213 steps, saw 65810 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 08:43:10] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:43:10] [INFO ] Invariant cache hit.
[2023-03-16 08:43:10] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-16 08:43:10] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 24 ms returned sat
[2023-03-16 08:43:10] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 08:43:10] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-16 08:43:10] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 27 ms returned sat
[2023-03-16 08:43:12] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 08:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:43:12] [INFO ] After 455ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 08:43:12] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 1 ms to minimize.
[2023-03-16 08:43:13] [INFO ] Deduced a trap composed of 181 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:43:13] [INFO ] Deduced a trap composed of 172 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:43:13] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:13] [INFO ] Deduced a trap composed of 160 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:13] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:43:14] [INFO ] Deduced a trap composed of 163 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:43:14] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:43:14] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:14] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:43:14] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:43:15] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 1 ms to minimize.
[2023-03-16 08:43:15] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:43:15] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:43:15] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 0 ms to minimize.
[2023-03-16 08:43:15] [INFO ] Deduced a trap composed of 185 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:43:16] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:43:16] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:43:16] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:16] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:43:17] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:43:17] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:43:17] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:43:18] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:43:18] [INFO ] Deduced a trap composed of 178 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:18] [INFO ] Deduced a trap composed of 178 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:43:18] [INFO ] Deduced a trap composed of 181 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:43:19] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 1 ms to minimize.
[2023-03-16 08:43:19] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:19] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 0 ms to minimize.
[2023-03-16 08:43:19] [INFO ] Deduced a trap composed of 163 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:19] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 0 ms to minimize.
[2023-03-16 08:43:20] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2023-03-16 08:43:20] [INFO ] Deduced a trap composed of 163 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:43:20] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:20] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:43:21] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:43:21] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:43:21] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:21] [INFO ] Deduced a trap composed of 151 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:43:21] [INFO ] Deduced a trap composed of 175 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:43:23] [INFO ] Deduced a trap composed of 169 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:43:23] [INFO ] Deduced a trap composed of 178 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:43:24] [INFO ] Deduced a trap composed of 188 places in 164 ms of which 1 ms to minimize.
[2023-03-16 08:43:26] [INFO ] Deduced a trap composed of 175 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:43:35] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 23014 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 08:43:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 08:43:35] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 532/532 places, 748/748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 15 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:43:35] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:43:35] [INFO ] Invariant cache hit.
[2023-03-16 08:43:36] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-03-16 08:43:36] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:43:36] [INFO ] Invariant cache hit.
[2023-03-16 08:43:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:43:44] [INFO ] Implicit Places using invariants and state equation in 8498 ms returned []
Implicit Place search using SMT with State Equation took 9177 ms to find 0 implicit places.
[2023-03-16 08:43:44] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 08:43:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:43:44] [INFO ] Invariant cache hit.
[2023-03-16 08:43:45] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9783 ms. Remains : 532/532 places, 748/748 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 532 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 532 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 531 transition count 743
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 531 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 530 transition count 742
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 530 transition count 737
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 525 transition count 737
Applied a total of 18 rules in 60 ms. Remains 525 /532 variables (removed 7) and now considering 737/748 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 737 rows 525 cols
[2023-03-16 08:43:45] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-16 08:43:45] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-16 08:43:45] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 23 ms returned sat
[2023-03-16 08:43:46] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 08:43:46] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-16 08:43:46] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-16 08:43:46] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 08:43:46] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:43:47] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:43:47] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:47] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:43:47] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:47] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:43:48] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:43:48] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:43:48] [INFO ] Deduced a trap composed of 155 places in 145 ms of which 0 ms to minimize.
[2023-03-16 08:43:48] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:48] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:43:49] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2023-03-16 08:43:49] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:43:49] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 0 ms to minimize.
[2023-03-16 08:43:49] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:49] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:43:50] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:43:50] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:43:50] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:43:50] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2023-03-16 08:43:50] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 1 ms to minimize.
[2023-03-16 08:43:51] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:43:51] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:43:51] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:51] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:43:52] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:43:52] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:43:52] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:43:52] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:43:52] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:43:53] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:53] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-16 08:43:53] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2023-03-16 08:43:53] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:43:54] [INFO ] Deduced a trap composed of 182 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:43:54] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:54] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:57] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:43:57] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:43:58] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:58] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:43:58] [INFO ] Deduced a trap composed of 177 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:43:58] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:43:58] [INFO ] Deduced a trap composed of 182 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:43:59] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:43:59] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:43:59] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:44:00] [INFO ] Deduced a trap composed of 154 places in 141 ms of which 0 ms to minimize.
[2023-03-16 08:44:01] [INFO ] Deduced a trap composed of 192 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:44:01] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 0 ms to minimize.
[2023-03-16 08:44:01] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 0 ms to minimize.
[2023-03-16 08:44:02] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:44:02] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:44:02] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:44:02] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:44:02] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 1 ms to minimize.
[2023-03-16 08:44:03] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 0 ms to minimize.
[2023-03-16 08:44:03] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:44:03] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:44:03] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:44:04] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-16 08:44:04] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 0 ms to minimize.
[2023-03-16 08:44:04] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 0 ms to minimize.
[2023-03-16 08:44:04] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:44:04] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2023-03-16 08:44:05] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 0 ms to minimize.
[2023-03-16 08:44:05] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 0 ms to minimize.
[2023-03-16 08:44:05] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:44:05] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:44:05] [INFO ] Deduced a trap composed of 152 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:44:06] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:44:07] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2023-03-16 08:44:07] [INFO ] Deduced a trap composed of 173 places in 143 ms of which 0 ms to minimize.
[2023-03-16 08:44:07] [INFO ] Deduced a trap composed of 181 places in 153 ms of which 1 ms to minimize.
[2023-03-16 08:44:08] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 1 ms to minimize.
[2023-03-16 08:44:10] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 0 ms to minimize.
[2023-03-16 08:44:10] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:44:11] [INFO ] Deduced a trap composed of 190 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:44:12] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:44:12] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 0 ms to minimize.
[2023-03-16 08:44:13] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 1 ms to minimize.
[2023-03-16 08:44:22] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 35472 ms
[2023-03-16 08:44:22] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-16 08:44:23] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 0 ms to minimize.
[2023-03-16 08:44:24] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2023-03-16 08:44:25] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 0 ms to minimize.
[2023-03-16 08:44:25] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 1 ms to minimize.
[2023-03-16 08:44:33] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 1 ms to minimize.
[2023-03-16 08:44:34] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-16 08:44:34] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:44:37] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 1 ms to minimize.
[2023-03-16 08:44:37] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 1 ms to minimize.
[2023-03-16 08:44:46] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 24145 ms
[2023-03-16 08:44:46] [INFO ] After 60539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 08:44:46] [INFO ] After 60672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 839 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 532 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 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:44:47] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-16 08:44:47] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-16 08:44:48] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-16 08:44:48] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:44:48] [INFO ] Invariant cache hit.
[2023-03-16 08:44:48] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-03-16 08:44:48] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:44:48] [INFO ] Invariant cache hit.
[2023-03-16 08:44:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:44:59] [INFO ] Implicit Places using invariants and state equation in 10183 ms returned []
Implicit Place search using SMT with State Equation took 10862 ms to find 0 implicit places.
[2023-03-16 08:44:59] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 08:44:59] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:44:59] [INFO ] Invariant cache hit.
[2023-03-16 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12084 ms. Remains : 532/532 places, 748/748 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7127 reset in 369 ms.
Product exploration explored 100000 steps with 7232 reset in 385 ms.
Built C files in :
/tmp/ltsmin9951762148672523392
[2023-03-16 08:45:00] [INFO ] Computing symmetric may disable matrix : 748 transitions.
[2023-03-16 08:45:00] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:00] [INFO ] Computing symmetric may enable matrix : 748 transitions.
[2023-03-16 08:45:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:01] [INFO ] Computing Do-Not-Accords matrix : 748 transitions.
[2023-03-16 08:45:01] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:01] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9951762148672523392
Running compilation step : cd /tmp/ltsmin9951762148672523392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2203 ms.
Running link step : cd /tmp/ltsmin9951762148672523392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9951762148672523392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16210979060966384372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 21 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:45:16] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:45:16] [INFO ] Invariant cache hit.
[2023-03-16 08:45:16] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-16 08:45:16] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:45:16] [INFO ] Invariant cache hit.
[2023-03-16 08:45:17] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-16 08:45:17] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:45:17] [INFO ] Invariant cache hit.
[2023-03-16 08:45:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:45:26] [INFO ] Implicit Places using invariants and state equation in 9188 ms returned []
Implicit Place search using SMT with State Equation took 9851 ms to find 0 implicit places.
[2023-03-16 08:45:26] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-16 08:45:26] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:45:26] [INFO ] Invariant cache hit.
[2023-03-16 08:45:27] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11023 ms. Remains : 532/532 places, 748/748 transitions.
Built C files in :
/tmp/ltsmin6911841500296938325
[2023-03-16 08:45:27] [INFO ] Computing symmetric may disable matrix : 748 transitions.
[2023-03-16 08:45:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:27] [INFO ] Computing symmetric may enable matrix : 748 transitions.
[2023-03-16 08:45:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:27] [INFO ] Computing Do-Not-Accords matrix : 748 transitions.
[2023-03-16 08:45:27] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:45:27] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6911841500296938325
Running compilation step : cd /tmp/ltsmin6911841500296938325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1996 ms.
Running link step : cd /tmp/ltsmin6911841500296938325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6911841500296938325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2034814279268327171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 08:45:42] [INFO ] Flatten gal took : 32 ms
[2023-03-16 08:45:42] [INFO ] Flatten gal took : 28 ms
[2023-03-16 08:45:42] [INFO ] Time to serialize gal into /tmp/LTL15430446567382394191.gal : 6 ms
[2023-03-16 08:45:42] [INFO ] Time to serialize properties into /tmp/LTL3251925844439590951.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15430446567382394191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8017053603519606364.hoa' '-atoms' '/tmp/LTL3251925844439590951.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3251925844439590951.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8017053603519606364.hoa
Detected timeout of ITS tools.
[2023-03-16 08:45:57] [INFO ] Flatten gal took : 27 ms
[2023-03-16 08:45:57] [INFO ] Flatten gal took : 28 ms
[2023-03-16 08:45:57] [INFO ] Time to serialize gal into /tmp/LTL6613428916538005267.gal : 6 ms
[2023-03-16 08:45:57] [INFO ] Time to serialize properties into /tmp/LTL1901895271797324684.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6613428916538005267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1901895271797324684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Try_Check_Sources_B_1<1)")||(X((G("(place_523_1>=4)"))U(("(Try_Check_Sources_B_1<1)")&&(G("(place_523_1>=4)")))))))))
Formula 0 simplified : GF(!"(Try_Check_Sources_B_1<1)" & X(!"(Try_Check_Sources_B_1<1)" W F!"(place_523_1>=4)"))
Detected timeout of ITS tools.
[2023-03-16 08:46:12] [INFO ] Flatten gal took : 27 ms
[2023-03-16 08:46:12] [INFO ] Applying decomposition
[2023-03-16 08:46:12] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16215982879975983371.txt' '-o' '/tmp/graph16215982879975983371.bin' '-w' '/tmp/graph16215982879975983371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16215982879975983371.bin' '-l' '-1' '-v' '-w' '/tmp/graph16215982879975983371.weights' '-q' '0' '-e' '0.001'
[2023-03-16 08:46:12] [INFO ] Decomposing Gal with order
[2023-03-16 08:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 08:46:12] [INFO ] Removed a total of 868 redundant transitions.
[2023-03-16 08:46:12] [INFO ] Flatten gal took : 58 ms
[2023-03-16 08:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 11 ms.
[2023-03-16 08:46:12] [INFO ] Time to serialize gal into /tmp/LTL17097687674464481264.gal : 9 ms
[2023-03-16 08:46:12] [INFO ] Time to serialize properties into /tmp/LTL14466470223412132946.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17097687674464481264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14466470223412132946.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i11.u25.Try_Check_Sources_B_1<1)")||(X((G("(i21.u33.place_523_1>=4)"))U(("(i11.u25.Try_Check_Sources_B_1<1)")&&(G("(i21.u33....180
Formula 0 simplified : GF(!"(i11.u25.Try_Check_Sources_B_1<1)" & X(!"(i11.u25.Try_Check_Sources_B_1<1)" W F!"(i21.u33.place_523_1>=4)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1943161907753742418
[2023-03-16 08:46:27] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1943161907753742418
Running compilation step : cd /tmp/ltsmin1943161907753742418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1275 ms.
Running link step : cd /tmp/ltsmin1943161907753742418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1943161907753742418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X(([]((LTLAPp1==true)) U ((LTLAPp0==true)&&[]((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-14 finished in 253646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 22 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-16 08:46:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-16 08:46:43] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-16 08:46:44] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
[2023-03-16 08:46:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:46:44] [INFO ] Invariant cache hit.
[2023-03-16 08:46:45] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-16 08:46:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:46:45] [INFO ] Invariant cache hit.
[2023-03-16 08:46:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:46:55] [INFO ] Implicit Places using invariants and state equation in 10890 ms returned []
Implicit Place search using SMT with State Equation took 11601 ms to find 0 implicit places.
[2023-03-16 08:46:55] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-16 08:46:55] [INFO ] Invariant cache hit.
[2023-03-16 08:46:56] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13468 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s131 1) (GEQ s180 1)) (AND (GEQ s46 1) (GEQ s205 1)) (AND (GEQ s298 1) (GEQ s372 1) (GEQ s574 1))), p1:(AND (GEQ s298 1) (GEQ s372 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-15 finished in 14249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&G(p1))))'
Found a Shortening insensitive property : PolyORBNT-PT-S05J40-LTLFireability-00
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 624 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 42 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-16 08:46:57] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-16 08:46:57] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-16 08:46:57] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2023-03-16 08:46:57] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:46:57] [INFO ] Invariant cache hit.
[2023-03-16 08:46:58] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-16 08:46:58] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:46:58] [INFO ] Invariant cache hit.
[2023-03-16 08:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:47:05] [INFO ] Implicit Places using invariants and state equation in 6833 ms returned []
Implicit Place search using SMT with State Equation took 7453 ms to find 0 implicit places.
[2023-03-16 08:47:05] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:05] [INFO ] Invariant cache hit.
[2023-03-16 08:47:05] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8654 ms. Remains : 532/624 places, 748/840 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s86 1) (LT s137 1) (LT s488 1)) (OR (LT s137 1) (LT s415 1) (LT s488 1)) (OR (LT s137 1) (LT s381 1) (LT s488 1)) (OR (LT s137 1) (LT s323...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11276 reset in 1054 ms.
Product exploration explored 100000 steps with 11475 reset in 1078 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 11 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:47:08] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:08] [INFO ] Invariant cache hit.
[2023-03-16 08:47:09] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-16 08:47:09] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:09] [INFO ] Invariant cache hit.
[2023-03-16 08:47:09] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-16 08:47:09] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:09] [INFO ] Invariant cache hit.
[2023-03-16 08:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:47:17] [INFO ] Implicit Places using invariants and state equation in 7332 ms returned []
Implicit Place search using SMT with State Equation took 7948 ms to find 0 implicit places.
[2023-03-16 08:47:17] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:17] [INFO ] Invariant cache hit.
[2023-03-16 08:47:17] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9101 ms. Remains : 532/532 places, 748/748 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11283 reset in 1054 ms.
Product exploration explored 100000 steps with 11431 reset in 1076 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 20 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:47:21] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:21] [INFO ] Invariant cache hit.
[2023-03-16 08:47:21] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
[2023-03-16 08:47:21] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 08:47:21] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:21] [INFO ] Invariant cache hit.
[2023-03-16 08:47:22] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1193 ms. Remains : 532/532 places, 748/748 transitions.
Built C files in :
/tmp/ltsmin10564185041593942449
[2023-03-16 08:47:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10564185041593942449
Running compilation step : cd /tmp/ltsmin10564185041593942449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1305 ms.
Running link step : cd /tmp/ltsmin10564185041593942449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10564185041593942449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4669076173301706270.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 12 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-16 08:47:37] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:37] [INFO ] Invariant cache hit.
[2023-03-16 08:47:37] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
[2023-03-16 08:47:37] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:37] [INFO ] Invariant cache hit.
[2023-03-16 08:47:38] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-16 08:47:38] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:38] [INFO ] Invariant cache hit.
[2023-03-16 08:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 08:47:46] [INFO ] Implicit Places using invariants and state equation in 8172 ms returned []
Implicit Place search using SMT with State Equation took 8780 ms to find 0 implicit places.
[2023-03-16 08:47:46] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-16 08:47:46] [INFO ] Invariant cache hit.
[2023-03-16 08:47:47] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9910 ms. Remains : 532/532 places, 748/748 transitions.
Built C files in :
/tmp/ltsmin6177582700748371041
[2023-03-16 08:47:47] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6177582700748371041
Running compilation step : cd /tmp/ltsmin6177582700748371041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1270 ms.
Running link step : cd /tmp/ltsmin6177582700748371041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6177582700748371041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3213419963855037865.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 08:48:02] [INFO ] Flatten gal took : 31 ms
[2023-03-16 08:48:02] [INFO ] Flatten gal took : 27 ms
[2023-03-16 08:48:02] [INFO ] Time to serialize gal into /tmp/LTL1283302812078845891.gal : 10 ms
[2023-03-16 08:48:02] [INFO ] Time to serialize properties into /tmp/LTL7285723297295150062.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1283302812078845891.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15442104871069857596.hoa' '-atoms' '/tmp/LTL7285723297295150062.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7285723297295150062.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15442104871069857596.hoa
Detected timeout of ITS tools.
[2023-03-16 08:48:17] [INFO ] Flatten gal took : 27 ms
[2023-03-16 08:48:17] [INFO ] Flatten gal took : 34 ms
[2023-03-16 08:48:17] [INFO ] Time to serialize gal into /tmp/LTL2637181419258990631.gal : 4 ms
[2023-03-16 08:48:17] [INFO ] Time to serialize properties into /tmp/LTL16335444800881478333.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2637181419258990631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16335444800881478333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(F("(NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1...1955
Formula 0 simplified : G(XG!"(NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1))||(b...1945
Detected timeout of ITS tools.
[2023-03-16 08:48:32] [INFO ] Flatten gal took : 27 ms
[2023-03-16 08:48:32] [INFO ] Applying decomposition
[2023-03-16 08:48:32] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12676899318892621743.txt' '-o' '/tmp/graph12676899318892621743.bin' '-w' '/tmp/graph12676899318892621743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12676899318892621743.bin' '-l' '-1' '-v' '-w' '/tmp/graph12676899318892621743.weights' '-q' '0' '-e' '0.001'
[2023-03-16 08:48:32] [INFO ] Decomposing Gal with order
[2023-03-16 08:48:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 08:48:32] [INFO ] Removed a total of 844 redundant transitions.
[2023-03-16 08:48:32] [INFO ] Flatten gal took : 59 ms
[2023-03-16 08:48:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 11 ms.
[2023-03-16 08:48:32] [INFO ] Time to serialize gal into /tmp/LTL8712478535979465853.gal : 7 ms
[2023-03-16 08:48:32] [INFO ] Time to serialize properties into /tmp/LTL6922280733275971236.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8712478535979465853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6922280733275971236.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X(F("(i19.u21.NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((i27.u42.QueueJobB_1_37<1)||(i27.u42.mi1<1))||(i27.u42.block<1...2943
Formula 0 simplified : G(XG!"(i19.u21.NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((i27.u42.QueueJobB_1_37<1)||(i27.u42.mi1<1))||(i27.u42.block<1))&&((...2933
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10558355044961369380
[2023-03-16 08:48:47] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10558355044961369380
Running compilation step : cd /tmp/ltsmin10558355044961369380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1307 ms.
Running link step : cd /tmp/ltsmin10558355044961369380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10558355044961369380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 126020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(p1) U (p0&&G(p1))))))))'
[2023-03-16 08:49:03] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6128261999537340156
[2023-03-16 08:49:03] [INFO ] Computing symmetric may disable matrix : 840 transitions.
[2023-03-16 08:49:03] [INFO ] Applying decomposition
[2023-03-16 08:49:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:49:03] [INFO ] Computing symmetric may enable matrix : 840 transitions.
[2023-03-16 08:49:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:49:03] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17958660486040332752.txt' '-o' '/tmp/graph17958660486040332752.bin' '-w' '/tmp/graph17958660486040332752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17958660486040332752.bin' '-l' '-1' '-v' '-w' '/tmp/graph17958660486040332752.weights' '-q' '0' '-e' '0.001'
[2023-03-16 08:49:03] [INFO ] Decomposing Gal with order
[2023-03-16 08:49:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 08:49:03] [INFO ] Computing Do-Not-Accords matrix : 840 transitions.
[2023-03-16 08:49:03] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 08:49:03] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6128261999537340156
Running compilation step : cd /tmp/ltsmin6128261999537340156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 08:49:03] [INFO ] Removed a total of 1001 redundant transitions.
[2023-03-16 08:49:03] [INFO ] Flatten gal took : 57 ms
[2023-03-16 08:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 8 ms.
[2023-03-16 08:49:03] [INFO ] Time to serialize gal into /tmp/LTLFireability2095614567132409670.gal : 8 ms
[2023-03-16 08:49:03] [INFO ] Time to serialize properties into /tmp/LTLFireability18363483556356092738.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2095614567132409670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18363483556356092738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((X(F("(i30.i2.u42.NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((i13.u83.QueueJobB_1_37<1)||(i13.u83.mi1<1))||(i13.u83.bloc...2950
Formula 0 simplified : G(XG!"(i30.i2.u42.NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((i13.u83.QueueJobB_1_37<1)||(i13.u83.mi1<1))||(i13.u83.block<1))&...2940
Compilation finished in 2417 ms.
Running link step : cd /tmp/ltsmin6128261999537340156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6128261999537340156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: LTL layer: formula: <>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))
pins2lts-mc-linux64( 5/ 8), 0.048: "<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.048: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.127: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.276: There are 845 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.276: State length is 625, there are 846 groups
pins2lts-mc-linux64( 0/ 8), 0.276: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.276: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.276: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.276: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.355: [Blue] ~30 levels ~960 states ~5344 transitions
pins2lts-mc-linux64( 6/ 8), 0.399: [Blue] ~30 levels ~1920 states ~7880 transitions
pins2lts-mc-linux64( 1/ 8), 0.454: [Blue] ~30 levels ~3840 states ~11576 transitions
pins2lts-mc-linux64( 6/ 8), 0.609: [Blue] ~30 levels ~7680 states ~20888 transitions
pins2lts-mc-linux64( 1/ 8), 0.855: [Blue] ~30 levels ~15360 states ~38392 transitions
pins2lts-mc-linux64( 0/ 8), 1.360: [Blue] ~30 levels ~30720 states ~73952 transitions
pins2lts-mc-linux64( 0/ 8), 2.318: [Blue] ~30 levels ~61440 states ~144952 transitions
pins2lts-mc-linux64( 3/ 8), 4.090: [Blue] ~30 levels ~122880 states ~262552 transitions
pins2lts-mc-linux64( 3/ 8), 7.509: [Blue] ~30 levels ~245760 states ~595728 transitions
pins2lts-mc-linux64( 3/ 8), 13.909: [Blue] ~30 levels ~491520 states ~1201192 transitions
pins2lts-mc-linux64( 3/ 8), 26.151: [Blue] ~30 levels ~983040 states ~2461672 transitions
pins2lts-mc-linux64( 3/ 8), 49.689: [Blue] ~30 levels ~1966080 states ~4914064 transitions
pins2lts-mc-linux64( 3/ 8), 96.936: [Blue] ~30 levels ~3932160 states ~9880264 transitions
pins2lts-mc-linux64( 3/ 8), 190.960: [Blue] ~30 levels ~7864320 states ~19750848 transitions
pins2lts-mc-linux64( 3/ 8), 380.817: [Blue] ~30 levels ~15728640 states ~41659016 transitions
pins2lts-mc-linux64( 4/ 8), 730.285: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 730.330:
pins2lts-mc-linux64( 0/ 8), 730.330: Explored 27983546 states 75024801 transitions, fanout: 2.681
pins2lts-mc-linux64( 0/ 8), 730.330: Total exploration time 730.040 sec (729.980 sec minimum, 730.003 sec on average)
pins2lts-mc-linux64( 0/ 8), 730.330: States per second: 38332, Transitions per second: 102768
pins2lts-mc-linux64( 0/ 8), 730.330:
pins2lts-mc-linux64( 0/ 8), 730.330: State space has 27986317 states, 3334413 are accepting
pins2lts-mc-linux64( 0/ 8), 730.330: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 730.330: blue states: 27983546 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 730.330: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 730.330: all-red states: 3392271 (12.12%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 730.330:
pins2lts-mc-linux64( 0/ 8), 730.330: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 730.330:
pins2lts-mc-linux64( 0/ 8), 730.330: Queue width: 8B, total height: 240, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 730.330: Tree memory: 469.5MB, 17.6 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 730.330: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 730.330: Stored 921 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 730.330: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 730.330: Est. total memory use: 469.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6128261999537340156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6128261999537340156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 09:13:44] [INFO ] Flatten gal took : 255 ms
[2023-03-16 09:13:44] [INFO ] Time to serialize gal into /tmp/LTLFireability7636015191716846325.gal : 85 ms
[2023-03-16 09:13:44] [INFO ] Time to serialize properties into /tmp/LTLFireability7062048750265449756.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7636015191716846325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7062048750265449756.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F((X(F("(NotifyEventEndOfCheckSourcesE_1<1)")))&&(G("(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1...1955
Formula 0 simplified : G(XG!"(NotifyEventEndOfCheckSourcesE_1<1)" | F!"(((((((((QueueJobB_1_37<1)||(mi1<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_20<1))||(b...1945
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 136380 kB
After kill :
MemTotal: 16393232 kB
MemFree: 12910048 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-PT-S05J40"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J40, 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 r293-tall-167873945800732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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