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.r298-tall-167873952100730.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 marciexred
Input is PolyORBNT-PT-S05J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100730
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679651746983

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 09:55:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 09:55:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 09:55:48] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-24 09:55:48] [INFO ] Transformed 629 places.
[2023-03-24 09:55:48] [INFO ] Transformed 1590 transitions.
[2023-03-24 09:55:48] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
[2023-03-24 09:55:48] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 09:55:48] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 623 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 24 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
[2023-03-24 09:55:48] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-24 09:55:48] [INFO ] Computed 102 place invariants in 81 ms
[2023-03-24 09:55:50] [INFO ] Dead Transitions using invariants and state equation in 1400 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-24 09:55:50] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2023-03-24 09:55:50] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-24 09:55:50] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-24 09:55:50] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 09:55:50] [INFO ] Invariant cache hit.
[2023-03-24 09:55:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 09:55:50] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 7 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 623 out of 629 places after structural reductions.
[2023-03-24 09:55:51] [INFO ] Flatten gal took : 135 ms
[2023-03-24 09:55:51] [INFO ] Flatten gal took : 86 ms
[2023-03-24 09:55:51] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 622 out of 629 places (down from 623) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 65) seen :35
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-24 09:55:52] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 09:55:52] [INFO ] Invariant cache hit.
[2023-03-24 09:55:53] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 09:55:53] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 27 ms returned sat
[2023-03-24 09:55:53] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:13
[2023-03-24 09:55:53] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 09:55:53] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 31 ms returned sat
[2023-03-24 09:55:55] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :4
[2023-03-24 09:55:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 09:55:56] [INFO ] After 1145ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :24 sat :4
[2023-03-24 09:55:56] [INFO ] Deduced a trap composed of 248 places in 241 ms of which 4 ms to minimize.
[2023-03-24 09:55:56] [INFO ] Deduced a trap composed of 252 places in 240 ms of which 1 ms to minimize.
[2023-03-24 09:55:57] [INFO ] Deduced a trap composed of 269 places in 218 ms of which 1 ms to minimize.
[2023-03-24 09:55:57] [INFO ] Deduced a trap composed of 284 places in 191 ms of which 1 ms to minimize.
[2023-03-24 09:55:57] [INFO ] Deduced a trap composed of 269 places in 212 ms of which 1 ms to minimize.
[2023-03-24 09:55:57] [INFO ] Deduced a trap composed of 255 places in 205 ms of which 1 ms to minimize.
[2023-03-24 09:55:58] [INFO ] Deduced a trap composed of 249 places in 208 ms of which 0 ms to minimize.
[2023-03-24 09:55:58] [INFO ] Deduced a trap composed of 258 places in 214 ms of which 1 ms to minimize.
[2023-03-24 09:55:58] [INFO ] Deduced a trap composed of 263 places in 205 ms of which 0 ms to minimize.
[2023-03-24 09:55:58] [INFO ] Deduced a trap composed of 246 places in 203 ms of which 1 ms to minimize.
[2023-03-24 09:55:59] [INFO ] Deduced a trap composed of 261 places in 189 ms of which 1 ms to minimize.
[2023-03-24 09:55:59] [INFO ] Deduced a trap composed of 266 places in 193 ms of which 0 ms to minimize.
[2023-03-24 09:55:59] [INFO ] Deduced a trap composed of 264 places in 184 ms of which 1 ms to minimize.
[2023-03-24 09:55:59] [INFO ] Deduced a trap composed of 251 places in 188 ms of which 0 ms to minimize.
[2023-03-24 09:56:00] [INFO ] Deduced a trap composed of 270 places in 182 ms of which 1 ms to minimize.
[2023-03-24 09:56:00] [INFO ] Deduced a trap composed of 272 places in 189 ms of which 1 ms to minimize.
[2023-03-24 09:56:00] [INFO ] Deduced a trap composed of 268 places in 181 ms of which 1 ms to minimize.
[2023-03-24 09:56:01] [INFO ] Deduced a trap composed of 279 places in 187 ms of which 1 ms to minimize.
[2023-03-24 09:56:02] [INFO ] Deduced a trap composed of 269 places in 201 ms of which 0 ms to minimize.
[2023-03-24 09:56:02] [INFO ] Deduced a trap composed of 257 places in 183 ms of which 1 ms to minimize.
[2023-03-24 09:56:02] [INFO ] Deduced a trap composed of 260 places in 202 ms of which 1 ms to minimize.
[2023-03-24 09:56:02] [INFO ] Deduced a trap composed of 245 places in 206 ms of which 1 ms to minimize.
[2023-03-24 09:56:03] [INFO ] Deduced a trap composed of 257 places in 195 ms of which 0 ms to minimize.
[2023-03-24 09:56:03] [INFO ] Deduced a trap composed of 260 places in 199 ms of which 1 ms to minimize.
[2023-03-24 09:56:03] [INFO ] Deduced a trap composed of 266 places in 192 ms of which 1 ms to minimize.
[2023-03-24 09:56:03] [INFO ] Deduced a trap composed of 263 places in 192 ms of which 1 ms to minimize.
[2023-03-24 09:56:04] [INFO ] Deduced a trap composed of 281 places in 194 ms of which 1 ms to minimize.
[2023-03-24 09:56:04] [INFO ] Deduced a trap composed of 275 places in 194 ms of which 0 ms to minimize.
[2023-03-24 09:56:05] [INFO ] Deduced a trap composed of 269 places in 196 ms of which 1 ms to minimize.
[2023-03-24 09:56:05] [INFO ] Deduced a trap composed of 254 places in 206 ms of which 1 ms to minimize.
[2023-03-24 09:56:05] [INFO ] Deduced a trap composed of 255 places in 191 ms of which 0 ms to minimize.
[2023-03-24 09:56:05] [INFO ] Deduced a trap composed of 266 places in 204 ms of which 1 ms to minimize.
[2023-03-24 09:56:05] [INFO ] Deduced a trap composed of 275 places in 205 ms of which 0 ms to minimize.
[2023-03-24 09:56:06] [INFO ] Deduced a trap composed of 281 places in 193 ms of which 1 ms to minimize.
[2023-03-24 09:56:06] [INFO ] Deduced a trap composed of 272 places in 192 ms of which 2 ms to minimize.
[2023-03-24 09:56:06] [INFO ] Deduced a trap composed of 278 places in 203 ms of which 1 ms to minimize.
[2023-03-24 09:56:07] [INFO ] Deduced a trap composed of 280 places in 190 ms of which 1 ms to minimize.
[2023-03-24 09:56:07] [INFO ] Deduced a trap composed of 257 places in 183 ms of which 1 ms to minimize.
[2023-03-24 09:56:07] [INFO ] Deduced a trap composed of 260 places in 184 ms of which 0 ms to minimize.
[2023-03-24 09:56:07] [INFO ] Deduced a trap composed of 244 places in 186 ms of which 2 ms to minimize.
[2023-03-24 09:56:08] [INFO ] Deduced a trap composed of 259 places in 201 ms of which 0 ms to minimize.
[2023-03-24 09:56:08] [INFO ] Deduced a trap composed of 266 places in 187 ms of which 1 ms to minimize.
[2023-03-24 09:56:09] [INFO ] Deduced a trap composed of 263 places in 186 ms of which 1 ms to minimize.
[2023-03-24 09:56:09] [INFO ] Deduced a trap composed of 260 places in 197 ms of which 1 ms to minimize.
[2023-03-24 09:56:10] [INFO ] Deduced a trap composed of 263 places in 199 ms of which 1 ms to minimize.
[2023-03-24 09:56:18] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 21985 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
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.Application.startNoEx(Application.java:626)
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-24 09:56:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 09:56:18] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0 real:13
Fused 28 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
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 49 rules applied. Total rules applied 49 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 93 place count 580 transition count 796
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 93 place count 580 transition count 752
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 181 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 535 transition count 751
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 2 with 4 rules applied. Total rules applied 187 place count 533 transition count 749
Applied a total of 187 rules in 159 ms. Remains 533 /629 variables (removed 96) and now considering 749/840 (removed 91) transitions.
[2023-03-24 09:56:18] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2023-03-24 09:56:18] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-24 09:56:19] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 533/629 places, 749/840 transitions.
Incomplete random walk after 10000 steps, including 525 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 09:56:19] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-24 09:56:19] [INFO ] Invariant cache hit.
[2023-03-24 09:56:19] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 09:56:19] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-24 09:56:19] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 09:56:19] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-24 09:56:19] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-24 09:56:20] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 09:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 09:56:21] [INFO ] After 1028ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 09:56:21] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2023-03-24 09:56:21] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 1 ms to minimize.
[2023-03-24 09:56:21] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 0 ms to minimize.
[2023-03-24 09:56:21] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 1 ms to minimize.
[2023-03-24 09:56:22] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 1 ms to minimize.
[2023-03-24 09:56:22] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2023-03-24 09:56:22] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 1 ms to minimize.
[2023-03-24 09:56:22] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 0 ms to minimize.
[2023-03-24 09:56:22] [INFO ] Deduced a trap composed of 180 places in 149 ms of which 1 ms to minimize.
[2023-03-24 09:56:23] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2023-03-24 09:56:23] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 0 ms to minimize.
[2023-03-24 09:56:23] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 4 ms to minimize.
[2023-03-24 09:56:23] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 1 ms to minimize.
[2023-03-24 09:56:23] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-24 09:56:24] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 1 ms to minimize.
[2023-03-24 09:56:24] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2023-03-24 09:56:24] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2023-03-24 09:56:24] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 0 ms to minimize.
[2023-03-24 09:56:25] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 1 ms to minimize.
[2023-03-24 09:56:26] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 2 ms to minimize.
[2023-03-24 09:56:26] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2023-03-24 09:56:26] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 2 ms to minimize.
[2023-03-24 09:56:27] [INFO ] Deduced a trap composed of 178 places in 150 ms of which 3 ms to minimize.
[2023-03-24 09:56:27] [INFO ] Deduced a trap composed of 191 places in 158 ms of which 1 ms to minimize.
[2023-03-24 09:56:27] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 1 ms to minimize.
[2023-03-24 09:56:33] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-24 09:56:33] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 1 ms to minimize.
[2023-03-24 09:56:37] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2023-03-24 09:56:38] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-24 09:56:44] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 23594 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.Application.startNoEx(Application.java:626)
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-24 09:56:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 09:56:44] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 749/749 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 533 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 532 transition count 748
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 532 transition count 746
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 530 transition count 746
Applied a total of 6 rules in 63 ms. Remains 530 /533 variables (removed 3) and now considering 746/749 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 530/533 places, 746/749 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 258704 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258704 steps, saw 77223 distinct states, run finished after 3005 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 09:56:47] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 09:56:47] [INFO ] Computed 97 place invariants in 23 ms
[2023-03-24 09:56:47] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2023-03-24 09:56:47] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-24 09:56:48] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 09:56:48] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 09:56:48] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-24 09:56:51] [INFO ] After 3211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 09:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 09:56:51] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 09:56:51] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 1 ms to minimize.
[2023-03-24 09:56:51] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 1 ms to minimize.
[2023-03-24 09:56:52] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-24 09:56:52] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 0 ms to minimize.
[2023-03-24 09:56:52] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 0 ms to minimize.
[2023-03-24 09:56:52] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2023-03-24 09:56:52] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-24 09:56:53] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 1 ms to minimize.
[2023-03-24 09:56:53] [INFO ] Deduced a trap composed of 186 places in 167 ms of which 1 ms to minimize.
[2023-03-24 09:56:53] [INFO ] Deduced a trap composed of 184 places in 183 ms of which 1 ms to minimize.
[2023-03-24 09:56:54] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 0 ms to minimize.
[2023-03-24 09:56:54] [INFO ] Deduced a trap composed of 180 places in 167 ms of which 0 ms to minimize.
[2023-03-24 09:56:54] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2023-03-24 09:56:55] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 0 ms to minimize.
[2023-03-24 09:56:55] [INFO ] Deduced a trap composed of 176 places in 170 ms of which 0 ms to minimize.
[2023-03-24 09:56:55] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 1 ms to minimize.
[2023-03-24 09:56:55] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-24 09:57:04] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 13398 ms
[2023-03-24 09:57:04] [INFO ] After 13490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 09:57:04] [INFO ] After 16807ms 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 32 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 32 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 30 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 09:57:04] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 09:57:04] [INFO ] Invariant cache hit.
[2023-03-24 09:57:05] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-24 09:57:05] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 09:57:05] [INFO ] Invariant cache hit.
[2023-03-24 09:57:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 09:57:11] [INFO ] Implicit Places using invariants and state equation in 5846 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
[2023-03-24 09:57:11] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-24 09:57:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 09:57:11] [INFO ] Invariant cache hit.
[2023-03-24 09:57:12] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7176 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 90 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-24 09:57:12] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-24 09:57:12] [INFO ] [Real]Absence check using 76 positive place invariants in 11 ms returned sat
[2023-03-24 09:57:12] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-24 09:57:12] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 09:57:12] [INFO ] [Nat]Absence check using 76 positive place invariants in 11 ms returned sat
[2023-03-24 09:57:12] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-24 09:57:16] [INFO ] After 4035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 09:57:16] [INFO ] Deduced a trap composed of 174 places in 146 ms of which 1 ms to minimize.
[2023-03-24 09:57:16] [INFO ] Deduced a trap composed of 186 places in 147 ms of which 1 ms to minimize.
[2023-03-24 09:57:16] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 0 ms to minimize.
[2023-03-24 09:57:17] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-24 09:57:17] [INFO ] Deduced a trap composed of 177 places in 154 ms of which 0 ms to minimize.
[2023-03-24 09:57:17] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 0 ms to minimize.
[2023-03-24 09:57:17] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 1 ms to minimize.
[2023-03-24 09:57:18] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2023-03-24 09:57:18] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 1 ms to minimize.
[2023-03-24 09:57:18] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2023-03-24 09:57:18] [INFO ] Deduced a trap composed of 177 places in 142 ms of which 0 ms to minimize.
[2023-03-24 09:57:18] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 1 ms to minimize.
[2023-03-24 09:57:19] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 0 ms to minimize.
[2023-03-24 09:57:19] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2023-03-24 09:57:19] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 1 ms to minimize.
[2023-03-24 09:57:19] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 0 ms to minimize.
[2023-03-24 09:57:20] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 0 ms to minimize.
[2023-03-24 09:57:20] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2023-03-24 09:57:20] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-24 09:57:20] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 0 ms to minimize.
[2023-03-24 09:57:20] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2023-03-24 09:57:21] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-24 09:57:21] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 0 ms to minimize.
[2023-03-24 09:57:21] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 0 ms to minimize.
[2023-03-24 09:57:21] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2023-03-24 09:57:22] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 1 ms to minimize.
[2023-03-24 09:57:23] [INFO ] Deduced a trap composed of 180 places in 145 ms of which 0 ms to minimize.
[2023-03-24 09:57:25] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 0 ms to minimize.
[2023-03-24 09:57:34] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 17618 ms
[2023-03-24 09:57:34] [INFO ] After 21772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 09:57:34] [INFO ] After 21883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 09:57:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 09:57:34] [INFO ] Flatten gal took : 60 ms
FORMULA PolyORBNT-PT-S05J40-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 09:57:34] [INFO ] Flatten gal took : 56 ms
[2023-03-24 09:57:34] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 561 out of 629 places (down from 573) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 22 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 09:57:34] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-24 09:57:35] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 930 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:35] [INFO ] Flatten gal took : 37 ms
[2023-03-24 09:57:35] [INFO ] Flatten gal took : 34 ms
[2023-03-24 09:57:35] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 24 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:35] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 09:57:35] [INFO ] Invariant cache hit.
[2023-03-24 09:57:36] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:36] [INFO ] Flatten gal took : 31 ms
[2023-03-24 09:57:36] [INFO ] Flatten gal took : 38 ms
[2023-03-24 09:57:36] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 45 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:36] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 09:57:36] [INFO ] Invariant cache hit.
[2023-03-24 09:57:37] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:37] [INFO ] Flatten gal took : 29 ms
[2023-03-24 09:57:37] [INFO ] Flatten gal took : 32 ms
[2023-03-24 09:57:37] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
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 0 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 0 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 92 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
[2023-03-24 09:57:37] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-24 09:57:37] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 09:57:38] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 652 ms. Remains : 531/629 places, 747/840 transitions.
[2023-03-24 09:57:38] [INFO ] Flatten gal took : 28 ms
[2023-03-24 09:57:38] [INFO ] Flatten gal took : 28 ms
[2023-03-24 09:57:38] [INFO ] Input system was already deterministic with 747 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 29 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 09:57:38] [INFO ] Computed 97 place invariants in 19 ms
[2023-03-24 09:57:39] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:39] [INFO ] Flatten gal took : 32 ms
[2023-03-24 09:57:39] [INFO ] Flatten gal took : 31 ms
[2023-03-24 09:57:39] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 624 transition count 797
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 581 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 88 place count 580 transition count 752
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 176 place count 536 transition count 752
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 180 place count 534 transition count 750
Applied a total of 180 rules in 56 ms. Remains 534 /629 variables (removed 95) and now considering 750/840 (removed 90) transitions.
[2023-03-24 09:57:39] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2023-03-24 09:57:39] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-24 09:57:40] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 630 ms. Remains : 534/629 places, 750/840 transitions.
[2023-03-24 09:57:40] [INFO ] Flatten gal took : 24 ms
[2023-03-24 09:57:40] [INFO ] Flatten gal took : 32 ms
[2023-03-24 09:57:40] [INFO ] Input system was already deterministic with 750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 17 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 09:57:40] [INFO ] Computed 97 place invariants in 19 ms
[2023-03-24 09:57:41] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 898 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:41] [INFO ] Flatten gal took : 27 ms
[2023-03-24 09:57:41] [INFO ] Flatten gal took : 28 ms
[2023-03-24 09:57:41] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 835
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 619 transition count 835
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 10 place count 619 transition count 791
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 98 place count 575 transition count 791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 574 transition count 790
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 574 transition count 790
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 2 with 4 rules applied. Total rules applied 104 place count 572 transition count 788
Applied a total of 104 rules in 40 ms. Remains 572 /629 variables (removed 57) and now considering 788/840 (removed 52) transitions.
[2023-03-24 09:57:41] [INFO ] Flow matrix only has 784 transitions (discarded 4 similar events)
// Phase 1: matrix 784 rows 572 cols
[2023-03-24 09:57:41] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-24 09:57:42] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 723 ms. Remains : 572/629 places, 788/840 transitions.
[2023-03-24 09:57:42] [INFO ] Flatten gal took : 26 ms
[2023-03-24 09:57:42] [INFO ] Flatten gal took : 28 ms
[2023-03-24 09:57:42] [INFO ] Input system was already deterministic with 788 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
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.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 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 72 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
[2023-03-24 09:57:42] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 09:57:42] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-24 09:57:43] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 715 ms. Remains : 532/629 places, 748/840 transitions.
[2023-03-24 09:57:43] [INFO ] Flatten gal took : 23 ms
[2023-03-24 09:57:43] [INFO ] Flatten gal took : 25 ms
[2023-03-24 09:57:43] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 18 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 09:57:43] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-24 09:57:44] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 994 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:44] [INFO ] Flatten gal took : 26 ms
[2023-03-24 09:57:44] [INFO ] Flatten gal took : 26 ms
[2023-03-24 09:57:44] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 19 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 09:57:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 09:57:44] [INFO ] Invariant cache hit.
[2023-03-24 09:57:45] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 953 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 09:57:45] [INFO ] Flatten gal took : 25 ms
[2023-03-24 09:57:45] [INFO ] Flatten gal took : 27 ms
[2023-03-24 09:57:45] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
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.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 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 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
[2023-03-24 09:57:45] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 09:57:45] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 09:57:45] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 651 ms. Remains : 532/629 places, 748/840 transitions.
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 23 ms
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 24 ms
[2023-03-24 09:57:46] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
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.
Iterating post reduction 1 with 45 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 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 54 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
[2023-03-24 09:57:46] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-24 09:57:46] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 09:57:46] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 624 ms. Remains : 531/629 places, 747/840 transitions.
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 23 ms
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 25 ms
[2023-03-24 09:57:46] [INFO ] Input system was already deterministic with 747 transitions.
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 37 ms
[2023-03-24 09:57:46] [INFO ] Flatten gal took : 38 ms
[2023-03-24 09:57:47] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2023-03-24 09:57:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 840 transitions and 4204 arcs took 5 ms.
Total runtime 118679 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 629 NrTr: 840 NrArc: 4204)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.000sec

init dd package: 0m 2.703sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10125716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093672 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.007sec

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="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PolyORBNT-PT-S05J40, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952100730"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;