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.r266-smll-167863541200642.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-PT-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 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 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679225070695

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 11:24:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 11:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:24:34] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2023-03-19 11:24:34] [INFO ] Transformed 1992 places.
[2023-03-19 11:24:34] [INFO ] Transformed 3096 transitions.
[2023-03-19 11:24:34] [INFO ] Found NUPN structural information;
[2023-03-19 11:24:34] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-19 11:24:34] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 83 ms.
Support contains 1549 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 109 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-19 11:24:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-19 11:24:35] [INFO ] Computed 31 place invariants in 59 ms
[2023-03-19 11:24:36] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-19 11:24:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-19 11:24:36] [INFO ] Invariant cache hit.
[2023-03-19 11:24:36] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-19 11:24:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-19 11:24:36] [INFO ] Invariant cache hit.
[2023-03-19 11:24:39] [INFO ] Dead Transitions using invariants and state equation in 2930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4651 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1549 out of 1992 places after structural reductions.
[2023-03-19 11:24:40] [INFO ] Flatten gal took : 434 ms
[2023-03-19 11:24:41] [INFO ] Flatten gal took : 260 ms
[2023-03-19 11:24:42] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 48) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-19 11:24:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-19 11:24:43] [INFO ] Invariant cache hit.
[2023-03-19 11:24:46] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2023-03-19 11:24:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-19 11:24:48] [INFO ] After 2213ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-19 11:24:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 11:24:49] [INFO ] After 705ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 11:24:49] [INFO ] After 4925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 11:24:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-19 11:24:51] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 11:24:56] [INFO ] After 4578ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-19 11:25:02] [INFO ] After 6226ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :20
[2023-03-19 11:25:06] [INFO ] Deduced a trap composed of 92 places in 3155 ms of which 37 ms to minimize.
[2023-03-19 11:25:09] [INFO ] Deduced a trap composed of 17 places in 2714 ms of which 3 ms to minimize.
[2023-03-19 11:25:11] [INFO ] Deduced a trap composed of 55 places in 2043 ms of which 3 ms to minimize.
[2023-03-19 11:25:14] [INFO ] Deduced a trap composed of 110 places in 2223 ms of which 4 ms to minimize.
[2023-03-19 11:25:16] [INFO ] Deduced a trap composed of 69 places in 2077 ms of which 2 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-19 11:25:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:25:16] [INFO ] After 27059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 966 ms.
Support contains 548 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1992 transition count 2763
Reduce places removed 333 places and 0 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Iterating post reduction 1 with 385 rules applied. Total rules applied 718 place count 1659 transition count 2711
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 770 place count 1607 transition count 2711
Performed 432 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 432 Pre rules applied. Total rules applied 770 place count 1607 transition count 2279
Deduced a syphon composed of 432 places in 5 ms
Reduce places removed 432 places and 0 transitions.
Iterating global reduction 3 with 864 rules applied. Total rules applied 1634 place count 1175 transition count 2279
Applied a total of 1634 rules in 467 ms. Remains 1175 /1992 variables (removed 817) and now considering 2279/3096 (removed 817) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 1175/1992 places, 2279/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 11:25:18] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
// Phase 1: matrix 1943 rows 1175 cols
[2023-03-19 11:25:18] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-19 11:25:20] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-19 11:25:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 11:25:20] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 11:25:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-19 11:25:21] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 11:25:25] [INFO ] After 2745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 11:25:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 11:25:28] [INFO ] After 3040ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 11:25:29] [INFO ] Deduced a trap composed of 14 places in 1404 ms of which 2 ms to minimize.
[2023-03-19 11:25:31] [INFO ] Deduced a trap composed of 14 places in 1345 ms of which 2 ms to minimize.
[2023-03-19 11:25:32] [INFO ] Deduced a trap composed of 23 places in 1399 ms of which 3 ms to minimize.
[2023-03-19 11:25:34] [INFO ] Deduced a trap composed of 276 places in 1269 ms of which 2 ms to minimize.
[2023-03-19 11:25:35] [INFO ] Deduced a trap composed of 33 places in 1294 ms of which 2 ms to minimize.
[2023-03-19 11:25:37] [INFO ] Deduced a trap composed of 12 places in 1388 ms of which 2 ms to minimize.
[2023-03-19 11:25:38] [INFO ] Deduced a trap composed of 52 places in 1317 ms of which 2 ms to minimize.
[2023-03-19 11:25:40] [INFO ] Deduced a trap composed of 33 places in 1346 ms of which 2 ms to minimize.
[2023-03-19 11:25:41] [INFO ] Deduced a trap composed of 33 places in 1374 ms of which 2 ms to minimize.
[2023-03-19 11:25:43] [INFO ] Deduced a trap composed of 83 places in 1327 ms of which 3 ms to minimize.
[2023-03-19 11:25:44] [INFO ] Deduced a trap composed of 99 places in 1297 ms of which 2 ms to minimize.
[2023-03-19 11:25:45] [INFO ] Deduced a trap composed of 14 places in 1294 ms of which 2 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-19 11:25:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:25:45] [INFO ] After 25285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 582 ms.
Support contains 542 out of 1175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1175/1175 places, 2279/2279 transitions.
Applied a total of 0 rules in 101 ms. Remains 1175 /1175 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1175/1175 places, 2279/2279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 87786 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87786 steps, saw 54328 distinct states, run finished after 3009 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-19 11:25:50] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
[2023-03-19 11:25:50] [INFO ] Invariant cache hit.
[2023-03-19 11:25:51] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-19 11:25:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-19 11:25:52] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 11:25:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-19 11:25:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 11:25:55] [INFO ] After 2352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 11:25:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 11:25:57] [INFO ] After 2277ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 11:25:59] [INFO ] Deduced a trap composed of 55 places in 1243 ms of which 2 ms to minimize.
[2023-03-19 11:26:00] [INFO ] Deduced a trap composed of 30 places in 1084 ms of which 2 ms to minimize.
[2023-03-19 11:26:01] [INFO ] Deduced a trap composed of 16 places in 1067 ms of which 1 ms to minimize.
[2023-03-19 11:26:03] [INFO ] Deduced a trap composed of 16 places in 1063 ms of which 1 ms to minimize.
[2023-03-19 11:26:04] [INFO ] Deduced a trap composed of 37 places in 1045 ms of which 2 ms to minimize.
[2023-03-19 11:26:05] [INFO ] Deduced a trap composed of 34 places in 1386 ms of which 1 ms to minimize.
[2023-03-19 11:26:07] [INFO ] Deduced a trap composed of 16 places in 1344 ms of which 2 ms to minimize.
[2023-03-19 11:26:08] [INFO ] Deduced a trap composed of 36 places in 1326 ms of which 1 ms to minimize.
[2023-03-19 11:26:10] [INFO ] Deduced a trap composed of 14 places in 1010 ms of which 1 ms to minimize.
[2023-03-19 11:26:11] [INFO ] Deduced a trap composed of 15 places in 1143 ms of which 2 ms to minimize.
[2023-03-19 11:26:12] [INFO ] Deduced a trap composed of 31 places in 1070 ms of which 1 ms to minimize.
[2023-03-19 11:26:13] [INFO ] Deduced a trap composed of 81 places in 1231 ms of which 2 ms to minimize.
[2023-03-19 11:26:15] [INFO ] Deduced a trap composed of 65 places in 1321 ms of which 2 ms to minimize.
[2023-03-19 11:26:16] [INFO ] Deduced a trap composed of 14 places in 1433 ms of which 2 ms to minimize.
[2023-03-19 11:26:18] [INFO ] Deduced a trap composed of 2 places in 1272 ms of which 2 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-19 11:26:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:26:18] [INFO ] After 26293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 495 ms.
Support contains 542 out of 1175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1175/1175 places, 2279/2279 transitions.
Applied a total of 0 rules in 78 ms. Remains 1175 /1175 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1175/1175 places, 2279/2279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1175/1175 places, 2279/2279 transitions.
Applied a total of 0 rules in 77 ms. Remains 1175 /1175 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
[2023-03-19 11:26:18] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
[2023-03-19 11:26:18] [INFO ] Invariant cache hit.
[2023-03-19 11:26:19] [INFO ] Implicit Places using invariants in 720 ms returned [1159, 1160, 1161, 1162, 1163, 1172, 1173, 1174]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 727 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1167/1175 places, 2279/2279 transitions.
Applied a total of 0 rules in 84 ms. Remains 1167 /1167 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 890 ms. Remains : 1167/1175 places, 2279/2279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 85689 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85689 steps, saw 53159 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-19 11:26:23] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
// Phase 1: matrix 1943 rows 1167 cols
[2023-03-19 11:26:23] [INFO ] Computed 23 place invariants in 11 ms
[2023-03-19 11:26:25] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-19 11:26:26] [INFO ] After 1373ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:16
[2023-03-19 11:26:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 11:26:27] [INFO ] After 426ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 11:26:27] [INFO ] After 2958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 11:26:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-19 11:26:31] [INFO ] After 2439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 11:26:33] [INFO ] After 2398ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 11:26:35] [INFO ] Deduced a trap composed of 36 places in 1313 ms of which 2 ms to minimize.
[2023-03-19 11:26:36] [INFO ] Deduced a trap composed of 110 places in 1317 ms of which 2 ms to minimize.
[2023-03-19 11:26:37] [INFO ] Deduced a trap composed of 36 places in 1286 ms of which 7 ms to minimize.
[2023-03-19 11:26:39] [INFO ] Deduced a trap composed of 14 places in 1067 ms of which 1 ms to minimize.
[2023-03-19 11:26:40] [INFO ] Deduced a trap composed of 14 places in 1127 ms of which 2 ms to minimize.
[2023-03-19 11:26:41] [INFO ] Deduced a trap composed of 16 places in 1290 ms of which 1 ms to minimize.
[2023-03-19 11:26:43] [INFO ] Deduced a trap composed of 14 places in 1339 ms of which 3 ms to minimize.
[2023-03-19 11:26:44] [INFO ] Deduced a trap composed of 14 places in 1322 ms of which 4 ms to minimize.
[2023-03-19 11:26:46] [INFO ] Deduced a trap composed of 15 places in 1390 ms of which 2 ms to minimize.
[2023-03-19 11:26:47] [INFO ] Deduced a trap composed of 102 places in 1083 ms of which 2 ms to minimize.
[2023-03-19 11:26:49] [INFO ] Deduced a trap composed of 14 places in 1157 ms of which 2 ms to minimize.
[2023-03-19 11:26:50] [INFO ] Deduced a trap composed of 16 places in 1102 ms of which 1 ms to minimize.
[2023-03-19 11:26:51] [INFO ] Deduced a trap composed of 33 places in 1068 ms of which 2 ms to minimize.
[2023-03-19 11:26:52] [INFO ] Deduced a trap composed of 65 places in 1237 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-19 11:26:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:26:52] [INFO ] After 25738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 217 ms.
Support contains 542 out of 1167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 2279/2279 transitions.
Applied a total of 0 rules in 49 ms. Remains 1167 /1167 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1167/1167 places, 2279/2279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 2279/2279 transitions.
Applied a total of 0 rules in 49 ms. Remains 1167 /1167 variables (removed 0) and now considering 2279/2279 (removed 0) transitions.
[2023-03-19 11:26:53] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
[2023-03-19 11:26:53] [INFO ] Invariant cache hit.
[2023-03-19 11:26:54] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-19 11:26:54] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
[2023-03-19 11:26:54] [INFO ] Invariant cache hit.
[2023-03-19 11:26:54] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
[2023-03-19 11:26:55] [INFO ] Redundant transitions in 441 ms returned []
[2023-03-19 11:26:55] [INFO ] Flow matrix only has 1943 transitions (discarded 336 similar events)
[2023-03-19 11:26:55] [INFO ] Invariant cache hit.
[2023-03-19 11:26:58] [INFO ] Dead Transitions using invariants and state equation in 2661 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4800 ms. Remains : 1167/1167 places, 2279/2279 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-19 11:26:58] [INFO ] Flatten gal took : 138 ms
[2023-03-19 11:26:58] [INFO ] Flatten gal took : 163 ms
[2023-03-19 11:26:59] [INFO ] Input system was already deterministic with 3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:26:59] [INFO ] Flatten gal took : 88 ms
[2023-03-19 11:26:59] [INFO ] Flatten gal took : 97 ms
[2023-03-19 11:27:00] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 264 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 267 ms. Remains : 592/1992 places, 1696/3096 transitions.
[2023-03-19 11:27:00] [INFO ] Flatten gal took : 48 ms
[2023-03-19 11:27:00] [INFO ] Flatten gal took : 56 ms
[2023-03-19 11:27:00] [INFO ] Input system was already deterministic with 1696 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 1992 transition count 2753
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 1649 transition count 2753
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 686 place count 1649 transition count 2656
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 880 place count 1552 transition count 2656
Applied a total of 880 rules in 179 ms. Remains 1552 /1992 variables (removed 440) and now considering 2656/3096 (removed 440) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 1552/1992 places, 2656/3096 transitions.
[2023-03-19 11:27:00] [INFO ] Flatten gal took : 75 ms
[2023-03-19 11:27:00] [INFO ] Flatten gal took : 79 ms
[2023-03-19 11:27:01] [INFO ] Input system was already deterministic with 2656 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 94 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:01] [INFO ] Flatten gal took : 78 ms
[2023-03-19 11:27:01] [INFO ] Flatten gal took : 89 ms
[2023-03-19 11:27:01] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 407 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 407 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1807
Deduced a syphon composed of 407 places in 0 ms
Reduce places removed 407 places and 0 transitions.
Iterating global reduction 2 with 814 rules applied. Total rules applied 2578 place count 703 transition count 1807
Applied a total of 2578 rules in 135 ms. Remains 703 /1992 variables (removed 1289) and now considering 1807/3096 (removed 1289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 137 ms. Remains : 703/1992 places, 1807/3096 transitions.
[2023-03-19 11:27:01] [INFO ] Flatten gal took : 43 ms
[2023-03-19 11:27:01] [INFO ] Flatten gal took : 53 ms
[2023-03-19 11:27:01] [INFO ] Input system was already deterministic with 1807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 17 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:02] [INFO ] Flatten gal took : 76 ms
[2023-03-19 11:27:02] [INFO ] Flatten gal took : 94 ms
[2023-03-19 11:27:02] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 1992 transition count 2690
Reduce places removed 406 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 798 rules applied. Total rules applied 1204 place count 1586 transition count 2298
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1596 place count 1194 transition count 2298
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 1596 place count 1194 transition count 2186
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 1820 place count 1082 transition count 2186
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1918 place count 1033 transition count 2137
Applied a total of 1918 rules in 202 ms. Remains 1033 /1992 variables (removed 959) and now considering 2137/3096 (removed 959) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 203 ms. Remains : 1033/1992 places, 2137/3096 transitions.
[2023-03-19 11:27:02] [INFO ] Flatten gal took : 47 ms
[2023-03-19 11:27:02] [INFO ] Flatten gal took : 55 ms
[2023-03-19 11:27:02] [INFO ] Input system was already deterministic with 2137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 60 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:02] [INFO ] Flatten gal took : 69 ms
[2023-03-19 11:27:03] [INFO ] Flatten gal took : 88 ms
[2023-03-19 11:27:03] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 83 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:03] [INFO ] Flatten gal took : 65 ms
[2023-03-19 11:27:03] [INFO ] Flatten gal took : 76 ms
[2023-03-19 11:27:03] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:03] [INFO ] Flatten gal took : 64 ms
[2023-03-19 11:27:03] [INFO ] Flatten gal took : 74 ms
[2023-03-19 11:27:03] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 885 transitions
Trivial Post-agglo rules discarded 885 transitions
Performed 885 trivial Post agglomeration. Transition count delta: 885
Iterating post reduction 0 with 885 rules applied. Total rules applied 885 place count 1992 transition count 2211
Reduce places removed 885 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 886 rules applied. Total rules applied 1771 place count 1107 transition count 2210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1772 place count 1106 transition count 2210
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1772 place count 1106 transition count 1763
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2666 place count 659 transition count 1763
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2778 place count 603 transition count 1707
Applied a total of 2778 rules in 164 ms. Remains 603 /1992 variables (removed 1389) and now considering 1707/3096 (removed 1389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 603/1992 places, 1707/3096 transitions.
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 36 ms
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 44 ms
[2023-03-19 11:27:04] [INFO ] Input system was already deterministic with 1707 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 649 transition count 1753
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2798 place count 593 transition count 1697
Applied a total of 2798 rules in 144 ms. Remains 593 /1992 variables (removed 1399) and now considering 1697/3096 (removed 1399) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 593/1992 places, 1697/3096 transitions.
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 36 ms
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 42 ms
[2023-03-19 11:27:04] [INFO ] Input system was already deterministic with 1697 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 80 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 63 ms
[2023-03-19 11:27:04] [INFO ] Flatten gal took : 75 ms
[2023-03-19 11:27:04] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 80 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 65 ms
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 74 ms
[2023-03-19 11:27:05] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1754
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2796 place count 594 transition count 1698
Applied a total of 2796 rules in 152 ms. Remains 594 /1992 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 594/1992 places, 1698/3096 transitions.
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 36 ms
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 42 ms
[2023-03-19 11:27:05] [INFO ] Input system was already deterministic with 1698 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 103 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 64 ms
[2023-03-19 11:27:05] [INFO ] Flatten gal took : 74 ms
[2023-03-19 11:27:06] [INFO ] Input system was already deterministic with 3096 transitions.
[2023-03-19 11:27:06] [INFO ] Flatten gal took : 124 ms
[2023-03-19 11:27:06] [INFO ] Flatten gal took : 129 ms
[2023-03-19 11:27:07] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 59 ms.
[2023-03-19 11:27:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 17 ms.
Total runtime 153200 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 1992 NrTr: 3096 NrArc: 9584)

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

net check time: 0m 0.002sec

init dd package: 0m 3.305sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9802836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16081108 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.058sec

562729 1051640

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="Peterson-PT-7"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Peterson-PT-7, 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 r266-smll-167863541200642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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