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.r297-tall-167873950900770.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 ltsminxred
Input is PolyORBNT-PT-S10J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900770
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 32K Feb 26 00:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 00:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 935K Feb 25 23:59 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 23K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 999K Feb 26 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 26 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K 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 14M 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-S10J40-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J40-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679643021654

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 07:30:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 07:30:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 07:30:24] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2023-03-24 07:30:24] [INFO ] Transformed 854 places.
[2023-03-24 07:30:24] [INFO ] Transformed 12340 transitions.
[2023-03-24 07:30:24] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 55 ms.
[2023-03-24 07:30:24] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 239 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Applied a total of 0 rules in 119 ms. Remains 854 /854 variables (removed 0) and now considering 2230/2230 (removed 0) transitions.
[2023-03-24 07:30:24] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-24 07:30:24] [INFO ] Computed 112 place invariants in 154 ms
[2023-03-24 07:30:27] [INFO ] Dead Transitions using invariants and state equation in 2690 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 07:30:27] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 854 cols
[2023-03-24 07:30:27] [INFO ] Computed 112 place invariants in 64 ms
[2023-03-24 07:30:28] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-24 07:30:28] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 07:30:28] [INFO ] Invariant cache hit.
[2023-03-24 07:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:30:43] [INFO ] Implicit Places using invariants and state equation in 14830 ms returned []
Implicit Place search using SMT with State Equation took 15527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 854/854 places, 1615/2230 transitions.
Applied a total of 0 rules in 26 ms. Remains 854 /854 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18398 ms. Remains : 854/854 places, 1615/2230 transitions.
Support contains 239 out of 854 places after structural reductions.
[2023-03-24 07:30:43] [INFO ] Flatten gal took : 316 ms
[2023-03-24 07:30:44] [INFO ] Flatten gal took : 180 ms
[2023-03-24 07:30:44] [INFO ] Input system was already deterministic with 1615 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1151 ms. (steps per millisecond=8 ) properties (out of 83) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 78) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) 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 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) 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 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) 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 46) 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 46) 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 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) 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 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 44) 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 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) 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 43) seen :1
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 42) 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 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) 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 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) 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 41) 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 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-24 07:30:46] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 07:30:46] [INFO ] Invariant cache hit.
[2023-03-24 07:30:47] [INFO ] [Real]Absence check using 81 positive place invariants in 26 ms returned sat
[2023-03-24 07:30:47] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 48 ms returned sat
[2023-03-24 07:30:47] [INFO ] After 900ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:34
[2023-03-24 07:30:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2023-03-24 07:30:48] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 48 ms returned sat
[2023-03-24 07:30:57] [INFO ] After 9290ms SMT Verify possible using state equation in natural domain returned unsat :28 sat :10
[2023-03-24 07:30:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:31:09] [INFO ] After 11383ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :28 sat :9
[2023-03-24 07:31:09] [INFO ] Deduced a trap composed of 403 places in 485 ms of which 8 ms to minimize.
[2023-03-24 07:31:10] [INFO ] Deduced a trap composed of 389 places in 513 ms of which 1 ms to minimize.
[2023-03-24 07:31:11] [INFO ] Deduced a trap composed of 391 places in 500 ms of which 2 ms to minimize.
[2023-03-24 07:31:11] [INFO ] Deduced a trap composed of 401 places in 478 ms of which 2 ms to minimize.
[2023-03-24 07:31:12] [INFO ] Deduced a trap composed of 377 places in 486 ms of which 2 ms to minimize.
[2023-03-24 07:31:12] [INFO ] Deduced a trap composed of 392 places in 475 ms of which 1 ms to minimize.
[2023-03-24 07:31:13] [INFO ] Deduced a trap composed of 397 places in 467 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 07:31:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:31:13] [INFO ] After 25397ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:34
Fused 38 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 95 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 844 transition count 1573
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 95 place count 802 transition count 1572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 801 transition count 1572
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 96 place count 801 transition count 1529
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 182 place count 758 transition count 1529
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 757 transition count 1528
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 757 transition count 1528
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 755 transition count 1526
Applied a total of 188 rules in 269 ms. Remains 755 /854 variables (removed 99) and now considering 1526/1615 (removed 89) transitions.
[2023-03-24 07:31:13] [INFO ] Flow matrix only has 1517 transitions (discarded 9 similar events)
// Phase 1: matrix 1517 rows 755 cols
[2023-03-24 07:31:13] [INFO ] Computed 102 place invariants in 24 ms
[2023-03-24 07:31:14] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1413 ms. Remains : 755/854 places, 1526/1615 transitions.
Incomplete random walk after 10000 steps, including 699 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-24 07:31:15] [INFO ] Flow matrix only has 1517 transitions (discarded 9 similar events)
[2023-03-24 07:31:15] [INFO ] Invariant cache hit.
[2023-03-24 07:31:15] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 07:31:15] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-24 07:31:15] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:31:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-24 07:31:15] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 31 ms returned sat
[2023-03-24 07:31:17] [INFO ] After 1819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:31:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:31:17] [INFO ] After 116ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 07:31:17] [INFO ] Deduced a trap composed of 166 places in 426 ms of which 1 ms to minimize.
[2023-03-24 07:31:18] [INFO ] Deduced a trap composed of 301 places in 410 ms of which 1 ms to minimize.
[2023-03-24 07:31:18] [INFO ] Deduced a trap composed of 283 places in 422 ms of which 1 ms to minimize.
[2023-03-24 07:31:19] [INFO ] Deduced a trap composed of 308 places in 408 ms of which 1 ms to minimize.
[2023-03-24 07:31:19] [INFO ] Deduced a trap composed of 281 places in 413 ms of which 1 ms to minimize.
[2023-03-24 07:31:20] [INFO ] Deduced a trap composed of 321 places in 417 ms of which 1 ms to minimize.
[2023-03-24 07:31:20] [INFO ] Deduced a trap composed of 317 places in 426 ms of which 1 ms to minimize.
[2023-03-24 07:31:21] [INFO ] Deduced a trap composed of 309 places in 424 ms of which 0 ms to minimize.
[2023-03-24 07:31:21] [INFO ] Deduced a trap composed of 325 places in 424 ms of which 1 ms to minimize.
[2023-03-24 07:31:22] [INFO ] Deduced a trap composed of 311 places in 417 ms of which 1 ms to minimize.
[2023-03-24 07:31:22] [INFO ] Deduced a trap composed of 321 places in 421 ms of which 1 ms to minimize.
[2023-03-24 07:31:23] [INFO ] Deduced a trap composed of 298 places in 388 ms of which 0 ms to minimize.
[2023-03-24 07:31:23] [INFO ] Deduced a trap composed of 314 places in 390 ms of which 1 ms to minimize.
[2023-03-24 07:31:23] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:31:24] [INFO ] Deduced a trap composed of 306 places in 370 ms of which 1 ms to minimize.
[2023-03-24 07:31:24] [INFO ] Deduced a trap composed of 318 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:31:25] [INFO ] Deduced a trap composed of 316 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:31:25] [INFO ] Deduced a trap composed of 312 places in 390 ms of which 0 ms to minimize.
[2023-03-24 07:31:26] [INFO ] Deduced a trap composed of 302 places in 381 ms of which 1 ms to minimize.
[2023-03-24 07:31:26] [INFO ] Deduced a trap composed of 302 places in 375 ms of which 1 ms to minimize.
[2023-03-24 07:31:27] [INFO ] Deduced a trap composed of 310 places in 390 ms of which 1 ms to minimize.
[2023-03-24 07:31:27] [INFO ] Deduced a trap composed of 320 places in 382 ms of which 1 ms to minimize.
[2023-03-24 07:31:28] [INFO ] Deduced a trap composed of 296 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:31:32] [INFO ] Deduced a trap composed of 314 places in 380 ms of which 1 ms to minimize.
[2023-03-24 07:31:33] [INFO ] Deduced a trap composed of 303 places in 382 ms of which 1 ms to minimize.
[2023-03-24 07:31:33] [INFO ] Deduced a trap composed of 323 places in 399 ms of which 2 ms to minimize.
[2023-03-24 07:31:34] [INFO ] Deduced a trap composed of 308 places in 380 ms of which 1 ms to minimize.
[2023-03-24 07:31:34] [INFO ] Deduced a trap composed of 316 places in 396 ms of which 1 ms to minimize.
[2023-03-24 07:31:35] [INFO ] Deduced a trap composed of 304 places in 375 ms of which 0 ms to minimize.
[2023-03-24 07:31:35] [INFO ] Deduced a trap composed of 308 places in 390 ms of which 1 ms to minimize.
[2023-03-24 07:31:36] [INFO ] Deduced a trap composed of 305 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:31:37] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2023-03-24 07:31:38] [INFO ] Deduced a trap composed of 301 places in 374 ms of which 2 ms to minimize.
[2023-03-24 07:31:38] [INFO ] Deduced a trap composed of 302 places in 371 ms of which 0 ms to minimize.
[2023-03-24 07:31:38] [INFO ] Deduced a trap composed of 318 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:31:39] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 0 ms to minimize.
[2023-03-24 07:31:40] [INFO ] Deduced a trap composed of 2 places in 511 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 07:31:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:31:40] [INFO ] After 25533ms 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 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1526/1526 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 755 transition count 1525
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 754 transition count 1525
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 754 transition count 1521
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 750 transition count 1521
Applied a total of 10 rules in 74 ms. Remains 750 /755 variables (removed 5) and now considering 1521/1526 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 750/755 places, 1521/1526 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235753 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235753 steps, saw 39269 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 07:31:43] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 07:31:44] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 07:31:44] [INFO ] [Real]Absence check using 80 positive place invariants in 23 ms returned sat
[2023-03-24 07:31:44] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-24 07:31:44] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:31:44] [INFO ] [Nat]Absence check using 80 positive place invariants in 27 ms returned sat
[2023-03-24 07:31:44] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 31 ms returned sat
[2023-03-24 07:31:45] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:31:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:31:45] [INFO ] After 146ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 07:31:45] [INFO ] Deduced a trap composed of 302 places in 388 ms of which 1 ms to minimize.
[2023-03-24 07:31:46] [INFO ] Deduced a trap composed of 322 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:31:46] [INFO ] Deduced a trap composed of 296 places in 378 ms of which 1 ms to minimize.
[2023-03-24 07:31:46] [INFO ] Deduced a trap composed of 298 places in 365 ms of which 1 ms to minimize.
[2023-03-24 07:31:47] [INFO ] Deduced a trap composed of 314 places in 381 ms of which 0 ms to minimize.
[2023-03-24 07:31:47] [INFO ] Deduced a trap composed of 333 places in 390 ms of which 1 ms to minimize.
[2023-03-24 07:31:48] [INFO ] Deduced a trap composed of 312 places in 384 ms of which 1 ms to minimize.
[2023-03-24 07:31:48] [INFO ] Deduced a trap composed of 308 places in 393 ms of which 0 ms to minimize.
[2023-03-24 07:31:49] [INFO ] Deduced a trap composed of 312 places in 397 ms of which 0 ms to minimize.
[2023-03-24 07:31:49] [INFO ] Deduced a trap composed of 307 places in 404 ms of which 1 ms to minimize.
[2023-03-24 07:31:50] [INFO ] Deduced a trap composed of 323 places in 412 ms of which 1 ms to minimize.
[2023-03-24 07:31:50] [INFO ] Deduced a trap composed of 288 places in 386 ms of which 0 ms to minimize.
[2023-03-24 07:31:51] [INFO ] Deduced a trap composed of 312 places in 397 ms of which 9 ms to minimize.
[2023-03-24 07:31:51] [INFO ] Deduced a trap composed of 308 places in 385 ms of which 0 ms to minimize.
[2023-03-24 07:31:52] [INFO ] Deduced a trap composed of 294 places in 395 ms of which 1 ms to minimize.
[2023-03-24 07:31:52] [INFO ] Deduced a trap composed of 304 places in 388 ms of which 0 ms to minimize.
[2023-03-24 07:31:53] [INFO ] Deduced a trap composed of 300 places in 388 ms of which 1 ms to minimize.
[2023-03-24 07:31:54] [INFO ] Deduced a trap composed of 298 places in 381 ms of which 1 ms to minimize.
[2023-03-24 07:31:54] [INFO ] Deduced a trap composed of 290 places in 375 ms of which 1 ms to minimize.
[2023-03-24 07:31:54] [INFO ] Deduced a trap composed of 312 places in 373 ms of which 2 ms to minimize.
[2023-03-24 07:31:55] [INFO ] Deduced a trap composed of 318 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:31:56] [INFO ] Deduced a trap composed of 300 places in 391 ms of which 0 ms to minimize.
[2023-03-24 07:31:56] [INFO ] Deduced a trap composed of 319 places in 389 ms of which 2 ms to minimize.
[2023-03-24 07:31:57] [INFO ] Deduced a trap composed of 308 places in 395 ms of which 5 ms to minimize.
[2023-03-24 07:31:57] [INFO ] Deduced a trap composed of 312 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:31:58] [INFO ] Deduced a trap composed of 309 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:31:59] [INFO ] Deduced a trap composed of 311 places in 387 ms of which 1 ms to minimize.
[2023-03-24 07:32:00] [INFO ] Deduced a trap composed of 308 places in 379 ms of which 0 ms to minimize.
[2023-03-24 07:32:01] [INFO ] Deduced a trap composed of 328 places in 386 ms of which 0 ms to minimize.
[2023-03-24 07:32:01] [INFO ] Deduced a trap composed of 320 places in 388 ms of which 0 ms to minimize.
[2023-03-24 07:32:02] [INFO ] Deduced a trap composed of 310 places in 376 ms of which 0 ms to minimize.
[2023-03-24 07:32:02] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 1 ms to minimize.
[2023-03-24 07:32:02] [INFO ] Deduced a trap composed of 343 places in 373 ms of which 1 ms to minimize.
[2023-03-24 07:32:03] [INFO ] Deduced a trap composed of 333 places in 365 ms of which 1 ms to minimize.
[2023-03-24 07:32:03] [INFO ] Deduced a trap composed of 322 places in 358 ms of which 0 ms to minimize.
[2023-03-24 07:32:04] [INFO ] Deduced a trap composed of 334 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:32:04] [INFO ] Deduced a trap composed of 314 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:32:05] [INFO ] Deduced a trap composed of 312 places in 371 ms of which 1 ms to minimize.
[2023-03-24 07:32:05] [INFO ] Deduced a trap composed of 318 places in 377 ms of which 0 ms to minimize.
[2023-03-24 07:32:06] [INFO ] Deduced a trap composed of 318 places in 379 ms of which 1 ms to minimize.
[2023-03-24 07:32:06] [INFO ] Deduced a trap composed of 286 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:32:06] [INFO ] Deduced a trap composed of 304 places in 337 ms of which 1 ms to minimize.
[2023-03-24 07:32:07] [INFO ] Deduced a trap composed of 310 places in 371 ms of which 0 ms to minimize.
[2023-03-24 07:32:07] [INFO ] Deduced a trap composed of 316 places in 380 ms of which 0 ms to minimize.
[2023-03-24 07:32:08] [INFO ] Deduced a trap composed of 318 places in 394 ms of which 1 ms to minimize.
[2023-03-24 07:32:08] [INFO ] Deduced a trap composed of 302 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:32:09] [INFO ] Deduced a trap composed of 310 places in 389 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 07:32:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:32:09] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 55 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 48 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-24 07:32:09] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:32:09] [INFO ] Invariant cache hit.
[2023-03-24 07:32:10] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2023-03-24 07:32:10] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:32:10] [INFO ] Invariant cache hit.
[2023-03-24 07:32:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:32:21] [INFO ] Implicit Places using invariants and state equation in 11256 ms returned []
Implicit Place search using SMT with State Equation took 12405 ms to find 0 implicit places.
[2023-03-24 07:32:21] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-24 07:32:21] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:32:21] [INFO ] Invariant cache hit.
[2023-03-24 07:32:22] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13636 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
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 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 192 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-24 07:32:23] [INFO ] Computed 102 place invariants in 36 ms
[2023-03-24 07:32:23] [INFO ] [Real]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 07:32:23] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-24 07:32:23] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:32:23] [INFO ] [Nat]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 07:32:23] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-24 07:32:24] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:32:24] [INFO ] Deduced a trap composed of 306 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:32:25] [INFO ] Deduced a trap composed of 306 places in 326 ms of which 1 ms to minimize.
[2023-03-24 07:32:25] [INFO ] Deduced a trap composed of 302 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:32:26] [INFO ] Deduced a trap composed of 308 places in 408 ms of which 1 ms to minimize.
[2023-03-24 07:32:26] [INFO ] Deduced a trap composed of 296 places in 352 ms of which 1 ms to minimize.
[2023-03-24 07:32:26] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 1 ms to minimize.
[2023-03-24 07:32:27] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 0 ms to minimize.
[2023-03-24 07:32:27] [INFO ] Deduced a trap composed of 296 places in 362 ms of which 1 ms to minimize.
[2023-03-24 07:32:28] [INFO ] Deduced a trap composed of 310 places in 404 ms of which 0 ms to minimize.
[2023-03-24 07:32:28] [INFO ] Deduced a trap composed of 330 places in 399 ms of which 1 ms to minimize.
[2023-03-24 07:32:29] [INFO ] Deduced a trap composed of 306 places in 395 ms of which 1 ms to minimize.
[2023-03-24 07:32:29] [INFO ] Deduced a trap composed of 298 places in 397 ms of which 1 ms to minimize.
[2023-03-24 07:32:30] [INFO ] Deduced a trap composed of 316 places in 366 ms of which 1 ms to minimize.
[2023-03-24 07:32:31] [INFO ] Deduced a trap composed of 286 places in 393 ms of which 0 ms to minimize.
[2023-03-24 07:32:31] [INFO ] Deduced a trap composed of 310 places in 345 ms of which 1 ms to minimize.
[2023-03-24 07:32:31] [INFO ] Deduced a trap composed of 316 places in 342 ms of which 1 ms to minimize.
[2023-03-24 07:32:32] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-24 07:32:32] [INFO ] Deduced a trap composed of 314 places in 399 ms of which 0 ms to minimize.
[2023-03-24 07:32:33] [INFO ] Deduced a trap composed of 312 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:32:33] [INFO ] Deduced a trap composed of 306 places in 396 ms of which 0 ms to minimize.
[2023-03-24 07:32:34] [INFO ] Deduced a trap composed of 308 places in 396 ms of which 1 ms to minimize.
[2023-03-24 07:32:34] [INFO ] Deduced a trap composed of 292 places in 388 ms of which 1 ms to minimize.
[2023-03-24 07:32:35] [INFO ] Deduced a trap composed of 294 places in 384 ms of which 1 ms to minimize.
[2023-03-24 07:32:35] [INFO ] Deduced a trap composed of 314 places in 383 ms of which 1 ms to minimize.
[2023-03-24 07:32:36] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2023-03-24 07:32:36] [INFO ] Deduced a trap composed of 306 places in 394 ms of which 1 ms to minimize.
[2023-03-24 07:32:36] [INFO ] Deduced a trap composed of 306 places in 367 ms of which 1 ms to minimize.
[2023-03-24 07:32:37] [INFO ] Deduced a trap composed of 302 places in 369 ms of which 1 ms to minimize.
[2023-03-24 07:32:37] [INFO ] Deduced a trap composed of 290 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:32:38] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 0 ms to minimize.
[2023-03-24 07:32:38] [INFO ] Deduced a trap composed of 304 places in 383 ms of which 0 ms to minimize.
[2023-03-24 07:32:39] [INFO ] Deduced a trap composed of 306 places in 367 ms of which 1 ms to minimize.
[2023-03-24 07:32:39] [INFO ] Deduced a trap composed of 296 places in 367 ms of which 0 ms to minimize.
[2023-03-24 07:32:39] [INFO ] Deduced a trap composed of 308 places in 394 ms of which 1 ms to minimize.
[2023-03-24 07:32:40] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 0 ms to minimize.
[2023-03-24 07:32:40] [INFO ] Deduced a trap composed of 322 places in 387 ms of which 1 ms to minimize.
[2023-03-24 07:32:41] [INFO ] Deduced a trap composed of 294 places in 364 ms of which 1 ms to minimize.
[2023-03-24 07:32:41] [INFO ] Deduced a trap composed of 294 places in 358 ms of which 0 ms to minimize.
[2023-03-24 07:32:42] [INFO ] Deduced a trap composed of 310 places in 408 ms of which 1 ms to minimize.
[2023-03-24 07:32:42] [INFO ] Deduced a trap composed of 302 places in 351 ms of which 1 ms to minimize.
[2023-03-24 07:32:42] [INFO ] Deduced a trap composed of 298 places in 347 ms of which 0 ms to minimize.
[2023-03-24 07:32:43] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 1 ms to minimize.
[2023-03-24 07:32:44] [INFO ] Deduced a trap composed of 300 places in 365 ms of which 1 ms to minimize.
[2023-03-24 07:32:45] [INFO ] Deduced a trap composed of 312 places in 364 ms of which 1 ms to minimize.
[2023-03-24 07:32:47] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 1 ms to minimize.
[2023-03-24 07:32:47] [INFO ] Deduced a trap composed of 294 places in 369 ms of which 0 ms to minimize.
[2023-03-24 07:32:47] [INFO ] Deduced a trap composed of 300 places in 355 ms of which 1 ms to minimize.
[2023-03-24 07:32:48] [INFO ] Deduced a trap composed of 304 places in 372 ms of which 0 ms to minimize.
[2023-03-24 07:32:48] [INFO ] Deduced a trap composed of 302 places in 367 ms of which 1 ms to minimize.
[2023-03-24 07:32:49] [INFO ] Deduced a trap composed of 304 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:32:50] [INFO ] Deduced a trap composed of 330 places in 361 ms of which 1 ms to minimize.
[2023-03-24 07:32:51] [INFO ] Deduced a trap composed of 306 places in 383 ms of which 1 ms to minimize.
[2023-03-24 07:36:08] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 224122 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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 07:36:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:36:08] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J40-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 07:36:08] [INFO ] Flatten gal took : 96 ms
[2023-03-24 07:36:08] [INFO ] Flatten gal took : 100 ms
[2023-03-24 07:36:09] [INFO ] Input system was already deterministic with 1615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 39 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:09] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 07:36:09] [INFO ] Computed 102 place invariants in 38 ms
[2023-03-24 07:36:11] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1890 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:11] [INFO ] Flatten gal took : 66 ms
[2023-03-24 07:36:11] [INFO ] Flatten gal took : 74 ms
[2023-03-24 07:36:11] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
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 854 transition count 1572
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 811 transition count 1572
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 86 place count 811 transition count 1528
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 174 place count 767 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 766 transition count 1527
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 766 transition count 1527
Applied a total of 176 rules in 186 ms. Remains 766 /854 variables (removed 88) and now considering 1527/1615 (removed 88) transitions.
[2023-03-24 07:36:11] [INFO ] Flow matrix only has 1518 transitions (discarded 9 similar events)
// Phase 1: matrix 1518 rows 766 cols
[2023-03-24 07:36:11] [INFO ] Computed 112 place invariants in 22 ms
[2023-03-24 07:36:12] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1394 ms. Remains : 766/854 places, 1527/1615 transitions.
[2023-03-24 07:36:12] [INFO ] Flatten gal took : 61 ms
[2023-03-24 07:36:12] [INFO ] Flatten gal took : 68 ms
[2023-03-24 07:36:13] [INFO ] Input system was already deterministic with 1527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Applied a total of 0 rules in 18 ms. Remains 854 /854 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 07:36:13] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 854 cols
[2023-03-24 07:36:13] [INFO ] Computed 112 place invariants in 27 ms
[2023-03-24 07:36:14] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 854/854 places, 1615/1615 transitions.
[2023-03-24 07:36:15] [INFO ] Flatten gal took : 74 ms
[2023-03-24 07:36:15] [INFO ] Flatten gal took : 81 ms
[2023-03-24 07:36:15] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Applied a total of 10 rules in 21 ms. Remains 844 /854 variables (removed 10) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 07:36:15] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 07:36:15] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 07:36:17] [INFO ] Dead Transitions using invariants and state equation in 1826 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1848 ms. Remains : 844/854 places, 1615/1615 transitions.
[2023-03-24 07:36:17] [INFO ] Flatten gal took : 69 ms
[2023-03-24 07:36:17] [INFO ] Flatten gal took : 87 ms
[2023-03-24 07:36:17] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 854 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 809 transition count 1570
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 809 transition count 1525
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 764 transition count 1525
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 763 transition count 1524
Applied a total of 182 rules in 106 ms. Remains 763 /854 variables (removed 91) and now considering 1524/1615 (removed 91) transitions.
[2023-03-24 07:36:17] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 763 cols
[2023-03-24 07:36:17] [INFO ] Computed 112 place invariants in 26 ms
[2023-03-24 07:36:18] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1257 ms. Remains : 763/854 places, 1524/1615 transitions.
[2023-03-24 07:36:18] [INFO ] Flatten gal took : 57 ms
[2023-03-24 07:36:18] [INFO ] Flatten gal took : 62 ms
[2023-03-24 07:36:19] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 35 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:19] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 07:36:19] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 07:36:20] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1693 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:20] [INFO ] Flatten gal took : 66 ms
[2023-03-24 07:36:20] [INFO ] Flatten gal took : 76 ms
[2023-03-24 07:36:21] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 92 place count 798 transition count 1525
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 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
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 186 place count 751 transition count 1522
Applied a total of 186 rules in 119 ms. Remains 751 /854 variables (removed 103) and now considering 1522/1615 (removed 93) transitions.
[2023-03-24 07:36:21] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 07:36:21] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 07:36:22] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1308 ms. Remains : 751/854 places, 1522/1615 transitions.
[2023-03-24 07:36:22] [INFO ] Flatten gal took : 59 ms
[2023-03-24 07:36:22] [INFO ] Flatten gal took : 60 ms
[2023-03-24 07:36:22] [INFO ] Input system was already deterministic with 1522 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
FORMULA PolyORBNT-PT-S10J40-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1525
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 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 752 transition count 1523
Applied a total of 184 rules in 104 ms. Remains 752 /854 variables (removed 102) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 07:36:22] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 07:36:22] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-24 07:36:24] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1316 ms. Remains : 752/854 places, 1523/1615 transitions.
[2023-03-24 07:36:24] [INFO ] Flatten gal took : 59 ms
[2023-03-24 07:36:24] [INFO ] Flatten gal took : 62 ms
[2023-03-24 07:36:24] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 35 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:24] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 07:36:24] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-24 07:36:25] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:26] [INFO ] Flatten gal took : 60 ms
[2023-03-24 07:36:26] [INFO ] Flatten gal took : 64 ms
[2023-03-24 07:36:26] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 37 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:26] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 07:36:26] [INFO ] Invariant cache hit.
[2023-03-24 07:36:28] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1854 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:28] [INFO ] Flatten gal took : 60 ms
[2023-03-24 07:36:28] [INFO ] Flatten gal took : 65 ms
[2023-03-24 07:36:28] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 35 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:28] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 07:36:28] [INFO ] Invariant cache hit.
[2023-03-24 07:36:30] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1877 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:30] [INFO ] Flatten gal took : 61 ms
[2023-03-24 07:36:30] [INFO ] Flatten gal took : 64 ms
[2023-03-24 07:36:30] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1526
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 178 place count 755 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 754 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 754 transition count 1525
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 184 place count 752 transition count 1523
Applied a total of 184 rules in 100 ms. Remains 752 /854 variables (removed 102) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 07:36:30] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 07:36:30] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 07:36:31] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1298 ms. Remains : 752/854 places, 1523/1615 transitions.
[2023-03-24 07:36:31] [INFO ] Flatten gal took : 58 ms
[2023-03-24 07:36:32] [INFO ] Flatten gal took : 62 ms
[2023-03-24 07:36:32] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 35 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 07:36:32] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 07:36:32] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 07:36:33] [INFO ] Dead Transitions using invariants and state equation in 1760 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1798 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 07:36:33] [INFO ] Flatten gal took : 58 ms
[2023-03-24 07:36:34] [INFO ] Flatten gal took : 62 ms
[2023-03-24 07:36:34] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1526
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 178 place count 755 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 754 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 754 transition count 1525
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 184 place count 752 transition count 1523
Applied a total of 184 rules in 94 ms. Remains 752 /854 variables (removed 102) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 07:36:34] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 07:36:34] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 07:36:35] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1301 ms. Remains : 752/854 places, 1523/1615 transitions.
[2023-03-24 07:36:35] [INFO ] Flatten gal took : 56 ms
[2023-03-24 07:36:35] [INFO ] Flatten gal took : 60 ms
[2023-03-24 07:36:35] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1526
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 178 place count 755 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 754 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 754 transition count 1525
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 184 place count 752 transition count 1523
Applied a total of 184 rules in 93 ms. Remains 752 /854 variables (removed 102) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 07:36:35] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 07:36:35] [INFO ] Invariant cache hit.
[2023-03-24 07:36:37] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1271 ms. Remains : 752/854 places, 1523/1615 transitions.
[2023-03-24 07:36:37] [INFO ] Flatten gal took : 57 ms
[2023-03-24 07:36:37] [INFO ] Flatten gal took : 59 ms
[2023-03-24 07:36:37] [INFO ] Input system was already deterministic with 1523 transitions.
[2023-03-24 07:36:37] [INFO ] Flatten gal took : 83 ms
[2023-03-24 07:36:37] [INFO ] Flatten gal took : 83 ms
[2023-03-24 07:36:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2023-03-24 07:36:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 854 places, 1615 transitions and 9824 arcs took 10 ms.
Total runtime 374151 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1021/ctl_0_ --ctl=/tmp/1021/ctl_1_ --ctl=/tmp/1021/ctl_2_ --ctl=/tmp/1021/ctl_3_ --ctl=/tmp/1021/ctl_4_ --ctl=/tmp/1021/ctl_5_ --ctl=/tmp/1021/ctl_6_ --ctl=/tmp/1021/ctl_7_ --ctl=/tmp/1021/ctl_8_ --ctl=/tmp/1021/ctl_9_ --ctl=/tmp/1021/ctl_10_ --ctl=/tmp/1021/ctl_11_ --ctl=/tmp/1021/ctl_12_ --ctl=/tmp/1021/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15060916 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16071360 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
mcc2023

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-S10J40"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S10J40, 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 r297-tall-167873950900770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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