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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 593M
-rw-r--r-- 1 mcc users 3.2M Feb 27 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16M Feb 27 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19M Feb 26 22:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 63M Feb 26 22:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6M Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7M Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7M Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2M Feb 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50M Feb 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39M Feb 27 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 131M Feb 27 09:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 406K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 235M Mar 5 18:22 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 FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679494905664

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00400M0040C020P020G001
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-22 14:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 14:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:21:53] [INFO ] Load time of PNML (sax parser for PT used): 6006 ms
[2023-03-22 14:21:56] [INFO ] Transformed 537708 places.
[2023-03-22 14:21:57] [INFO ] Transformed 508489 transitions.
[2023-03-22 14:21:57] [INFO ] Parsed PT model containing 537708 places and 508489 transitions and 1558729 arcs in 10374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 405 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 106 places and 0 transitions.
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 169240 out of 537602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537602/537602 places, 508489/508489 transitions.
Reduce places removed 1339 places and 0 transitions.
Discarding 49323 places :
Implicit places reduction removed 49323 places
Iterating post reduction 0 with 50662 rules applied. Total rules applied 50662 place count 486940 transition count 508489
Discarding 4010 places :
Symmetric choice reduction at 1 with 4010 rule applications. Total rules 54672 place count 482930 transition count 500469
Iterating global reduction 1 with 4010 rules applied. Total rules applied 58682 place count 482930 transition count 500469
Applied a total of 58682 rules in 115588 ms. Remains 482930 /537602 variables (removed 54672) and now considering 500469/508489 (removed 8020) transitions.
// Phase 1: matrix 500469 rows 482930 cols
[2023-03-22 14:26:00] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 14:26:35] [INFO ] Implicit Places using invariants in 155413 ms returned []
Implicit Place search using SMT only with invariants took 155454 ms to find 0 implicit places.
// Phase 1: matrix 500469 rows 482930 cols
[2023-03-22 14:28:36] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 14:29:35] [INFO ] Dead Transitions using invariants and state equation in 179418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 482930/537602 places, 500469/508489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450519 ms. Remains : 482930/537602 places, 500469/508489 transitions.
Support contains 169240 out of 482930 places after structural reductions.
[2023-03-22 14:29:55] [INFO ] Flatten gal took : 15051 ms
[2023-03-22 14:30:15] [INFO ] Flatten gal took : 13448 ms
[2023-03-22 14:30:45] [INFO ] Input system was already deterministic with 500469 transitions.
Support contains 169238 out of 482930 places (down from 169240) after GAL structural reductions.
Interrupted random walk after 7743 steps, including 2 resets, run timeout after 30009 ms. (steps per millisecond=0 ) properties seen 3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=0 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=1 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=1 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1298 ms. (steps per millisecond=0 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=1 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 500469 rows 482930 cols
[2023-03-22 14:33:28] [WARNING] Invariant computation timed out after 120 seconds.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 14:33:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:33:53] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 102663 out of 482930 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482930/482930 places, 500469/500469 transitions.
Graph (complete) has 734231 edges and 482930 vertex of which 479289 are kept as prefixes of interest. Removing 3641 places using SCC suffix rule.774 ms
Discarding 3641 places :
Also discarding 7640 output transitions
Drop transitions removed 7640 transitions
Discarding 32881 places :
Implicit places reduction removed 32881 places
Drop transitions removed 141548 transitions
Trivial Post-agglo rules discarded 141548 transitions
Performed 141548 trivial Post agglomeration. Transition count delta: 141548
Iterating post reduction 0 with 174429 rules applied. Total rules applied 174430 place count 446408 transition count 351281
Reduce places removed 141548 places and 0 transitions.
Performed 3013 Post agglomeration using F-continuation condition.
Performed 5774 Post agglomeration using F-continuation condition.
Performed 7955 Post agglomeration using F-continuation condition.
Performed 10600 Post agglomeration using F-continuation condition.
Performed 13492 Post agglomeration using F-continuation condition.
Performed 16394 Post agglomeration using F-continuation condition.
Performed 18856 Post agglomeration using F-continuation condition.
Performed 21823 Post agglomeration using F-continuation condition.
Performed 24746 Post agglomeration using F-continuation condition.
Performed 28004 Post agglomeration using F-continuation condition.
Performed 31099 Post agglomeration using F-continuation condition.
Performed 33283 Post agglomeration using F-continuation condition.Transition count delta: 33283
Iterating post reduction 1 with 174831 rules applied. Total rules applied 349261 place count 304860 transition count 317998
Reduce places removed 33283 places and 0 transitions.
Iterating post reduction 2 with 33283 rules applied. Total rules applied 382544 place count 271577 transition count 317998
[2023-03-22 14:45:54] [INFO ] Computed 62962 place invariants in 1313637 ms
Performed 18443 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18443 Pre rules applied. Total rules applied 382544 place count 271577 transition count 299555
Deduced a syphon composed of 18443 places in 373 ms
Ensure Unique test removed 800 places
Reduce places removed 19243 places and 0 transitions.
Iterating global reduction 3 with 37686 rules applied. Total rules applied 420230 place count 252334 transition count 299555
Discarding 399 places :
Implicit places reduction removed 399 places
Iterating post reduction 3 with 399 rules applied. Total rules applied 420629 place count 251935 transition count 299555
Performed 682 Post agglomeration using F-continuation condition.
Performed 2979 Post agglomeration using F-continuation condition.
Performed 6309 Post agglomeration using F-continuation condition.
Performed 9365 Post agglomeration using F-continuation condition.
Performed 12681 Post agglomeration using F-continuation condition.
[2023-03-22 14:49:28] [INFO ] Computed 62962 place invariants in 1372767 ms
Performed 16045 Post agglomeration using F-continuation condition.
Performed 18806 Post agglomeration using F-continuation condition.Transition count delta: 18806
Deduced a syphon composed of 18806 places in 271 ms
Reduce places removed 18806 places and 0 transitions.
Iterating global reduction 4 with 37612 rules applied. Total rules applied 458241 place count 233129 transition count 280749
Free-agglomeration rule applied 8421 times.
Iterating global reduction 4 with 8421 rules applied. Total rules applied 466662 place count 233129 transition count 272328
Ensure Unique test removed 401 places
Reduce places removed 8822 places and 0 transitions.
Ensure Unique test removed 8020 transitions
Reduce isomorphic transitions removed 8020 transitions.
Iterating post reduction 4 with 16842 rules applied. Total rules applied 483504 place count 224307 transition count 264308
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 401 Pre rules applied. Total rules applied 483504 place count 224307 transition count 263907
Deduced a syphon composed of 401 places in 282 ms
Ensure Unique test removed 401 places
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 5 with 1203 rules applied. Total rules applied 484707 place count 223505 transition count 263907
[2023-03-22 14:54:50] [INFO ] Computed 62962 place invariants in 1402543 ms
Free-agglomeration rule (complex) applied 33684 times.
Iterating global reduction 5 with 33684 rules applied. Total rules applied 518391 place count 223505 transition count 550223
Reduce places removed 33684 places and 0 transitions.
Iterating post reduction 5 with 33684 rules applied. Total rules applied 552075 place count 189821 transition count 550223
Applied a total of 552075 rules in 1451054 ms. Remains 189821 /482930 variables (removed 293109) and now considering 550223/500469 (removed -49754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451074 ms. Remains : 189821/482930 places, 550223/500469 transitions.
Computed a total of 482930 stabilizing places and 500469 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 482930 transition count 500469
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||!(!p0 U p1)||G(p2))))'
Support contains 25664 out of 482930 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482930/482930 places, 500469/500469 transitions.
Graph (complete) has 734231 edges and 482930 vertex of which 451187 are kept as prefixes of interest. Removing 31743 places using SCC suffix rule.799 ms
Discarding 31743 places :
Also discarding 46938 output transitions
Drop transitions removed 46938 transitions
Reduce places removed 401 places and 401 transitions.
Discarding 49323 places :
Implicit places reduction removed 49323 places
Drop transitions removed 256640 transitions
Trivial Post-agglo rules discarded 256640 transitions
Performed 256640 trivial Post agglomeration. Transition count delta: 256640
Iterating post reduction 0 with 305963 rules applied. Total rules applied 305964 place count 401463 transition count 196490
Reduce places removed 256640 places and 0 transitions.
Performed 8421 Post agglomeration using F-continuation condition.Transition count delta: 8421
Iterating post reduction 1 with 265061 rules applied. Total rules applied 571025 place count 144823 transition count 188069
Reduce places removed 8421 places and 0 transitions.
Iterating post reduction 2 with 8421 rules applied. Total rules applied 579446 place count 136402 transition count 188069
Performed 2406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2406 Pre rules applied. Total rules applied 579446 place count 136402 transition count 185663
Deduced a syphon composed of 2406 places in 266 ms
Ensure Unique test removed 1203 places
Reduce places removed 3609 places and 0 transitions.
Iterating global reduction 3 with 6015 rules applied. Total rules applied 585461 place count 132793 transition count 185663
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 585461 place count 132793 transition count 185262
Deduced a syphon composed of 401 places in 261 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 586263 place count 132392 transition count 185262
Performed 10959 Post agglomeration using F-continuation condition.
Performed 18446 Post agglomeration using F-continuation condition.Transition count delta: 18446
Deduced a syphon composed of 18446 places in 135 ms
Reduce places removed 18446 places and 0 transitions.
Iterating global reduction 3 with 36892 rules applied. Total rules applied 623155 place count 113946 transition count 166816
Applied a total of 623155 rules in 255503 ms. Remains 113946 /482930 variables (removed 368984) and now considering 166816/500469 (removed 333653) transitions.
// Phase 1: matrix 166816 rows 113946 cols
[2023-03-22 15:04:15] [INFO ] Computed 11230 place invariants in 111199 ms
[2023-03-22 15:04:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:04:23] [INFO ] Implicit Places using invariants in 119373 ms returned []
Implicit Place search using SMT only with invariants took 119374 ms to find 0 implicit places.
[2023-03-22 15:04:23] [INFO ] Invariant cache hit.
[2023-03-22 15:04:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:04:31] [INFO ] Dead Transitions using invariants and state equation in 8530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113946/482930 places, 166816/500469 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383418 ms. Remains : 113946/482930 places, 166816/500469 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), p1, (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s872 1) (GEQ s32149 1)) (AND (GEQ s877 1) (GEQ s27344 1)) (AND (GEQ s1086 1) (GEQ s33165 1)) (AND (GEQ s1091 1) (GEQ s28360 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration timeout after 1610 steps with 0 reset in 10039 ms.
Product exploration timeout after 2060 steps with 0 reset in 10037 ms.
Computed a total of 113946 stabilizing places and 166816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113946 transition count 166816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 984 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 7 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p2), p1, (AND p1 (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Interrupted random walk after 5029 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 9
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 9482 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5399 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7352 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6888 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 7199 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6786 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7328 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6744 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 8 properties.
[2023-03-22 15:10:31] [INFO ] Invariant cache hit.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:611)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:10:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:10:56] [INFO ] After 25113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25664 out of 113946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113946/113946 places, 166816/166816 transitions.
Free-agglomeration rule applied 24862 times.
Iterating global reduction 0 with 24862 rules applied. Total rules applied 24862 place count 113946 transition count 141954
Ensure Unique test removed 802 places
Reduce places removed 25664 places and 0 transitions.
Ensure Unique test removed 8020 transitions
Reduce isomorphic transitions removed 8020 transitions.
Iterating post reduction 0 with 33684 rules applied. Total rules applied 58546 place count 88282 transition count 133934
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 58546 place count 88282 transition count 133533
Deduced a syphon composed of 401 places in 49 ms
Ensure Unique test removed 401 places
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 1 with 1203 rules applied. Total rules applied 59749 place count 87480 transition count 133533
Free-agglomeration rule (complex) applied 25664 times.
Iterating global reduction 1 with 25664 rules applied. Total rules applied 85413 place count 87480 transition count 589069
Ensure Unique test removed 802 places
Reduce places removed 26466 places and 0 transitions.
Iterating post reduction 1 with 26466 rules applied. Total rules applied 111879 place count 61014 transition count 589069
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 111939 place count 60954 transition count 83809
Iterating global reduction 2 with 60 rules applied. Total rules applied 111999 place count 60954 transition count 83809
Ensure Unique test removed 16040 transitions
Reduce isomorphic transitions removed 16040 transitions.
Iterating post reduction 2 with 16040 rules applied. Total rules applied 128039 place count 60954 transition count 67769
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 128440 place count 60954 transition count 227768
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 128841 place count 60553 transition count 227768
Discarding 8020 places :
Symmetric choice reduction at 4 with 8020 rule applications. Total rules 136861 place count 52533 transition count 59348
Iterating global reduction 4 with 8020 rules applied. Total rules applied 144881 place count 52533 transition count 59348
Reduce places removed 401 places and 401 transitions.
Iterating global reduction 4 with 401 rules applied. Total rules applied 145282 place count 52132 transition count 58947
Applied a total of 145282 rules in 515864 ms. Remains 52132 /113946 variables (removed 61814) and now considering 58947/166816 (removed 107869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515868 ms. Remains : 52132/113946 places, 58947/166816 transitions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 p0))), (F (NOT p2)), (F p1), (F (AND (NOT p2) p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p0) p1))
Knowledge based reduction with 21 factoid took 340 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00 finished in 1284867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X(G(p1))))'
Support contains 9223 out of 482930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482930/482930 places, 500469/500469 transitions.
Discarding 49323 places :
Implicit places reduction removed 49323 places
Iterating post reduction 0 with 49323 rules applied. Total rules applied 49323 place count 433607 transition count 500469
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49333 place count 433597 transition count 496459
Iterating global reduction 1 with 10 rules applied. Total rules applied 49343 place count 433597 transition count 496459
Applied a total of 49343 rules in 43407 ms. Remains 433597 /482930 variables (removed 49333) and now considering 496459/500469 (removed 4010) transitions.
// Phase 1: matrix 496459 rows 433597 cols
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1495784 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15432328 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00400M0040C020P020G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00400M0040C020P020G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850400436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00400M0040C020P020G001.tgz
mv FamilyReunion-PT-L00400M0040C020P020G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;