/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:07:18,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:07:18,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:07:18,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:07:18,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:07:18,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:07:18,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:07:18,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:07:18,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:07:18,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:07:18,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:07:18,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:07:18,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:07:18,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:07:18,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:07:18,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:07:18,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:07:18,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:07:18,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:07:18,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:07:18,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:07:18,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:07:18,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:07:18,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:07:18,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:07:18,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:07:18,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:07:18,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:07:18,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:07:18,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:07:18,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:07:18,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:07:18,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:07:18,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:07:18,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:07:18,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:07:18,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:07:18,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:07:18,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:07:18,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:07:18,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:07:18,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:07:18,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:07:18,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:07:18,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:07:18,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:07:18,661 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:07:18,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:07:18,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:07:18,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:07:18,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:07:18,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:07:18,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:07:18,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:07:18,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:07:18,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:07:18,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:07:18,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:07:18,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:18,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:07:18,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:07:18,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:07:18,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:07:18,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:07:18,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:07:18,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:07:19,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:07:19,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:07:19,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:07:19,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:07:19,040 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:07:19,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2022-12-13 07:07:20,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:07:20,472 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:07:20,472 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2022-12-13 07:07:20,477 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d28265a7/0bed0460a5a14087ac06d08bc21326cc/FLAGe5a42dc5e [2022-12-13 07:07:20,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d28265a7/0bed0460a5a14087ac06d08bc21326cc [2022-12-13 07:07:20,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:07:20,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:07:20,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:20,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:07:20,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:07:20,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eddfaa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20, skipping insertion in model container [2022-12-13 07:07:20,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:07:20,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:07:20,664 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3305,3318] [2022-12-13 07:07:20,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:20,700 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:07:20,745 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3305,3318] [2022-12-13 07:07:20,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:20,769 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:07:20,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20 WrapperNode [2022-12-13 07:07:20,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:20,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:20,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:07:20,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:07:20,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,843 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 282 [2022-12-13 07:07:20,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:20,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:07:20,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:07:20,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:07:20,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:07:20,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:07:20,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:07:20,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:07:20,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (1/1) ... [2022-12-13 07:07:20,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:20,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:07:20,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:07:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:07:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:07:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:07:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:07:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:07:20,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:07:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:07:20,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:07:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:07:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:07:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:07:20,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:07:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:07:20,978 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:07:21,136 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:07:21,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:07:21,563 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:07:21,574 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:07:21,575 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 07:07:21,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:21 BoogieIcfgContainer [2022-12-13 07:07:21,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:07:21,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:07:21,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:07:21,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:07:21,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:07:20" (1/3) ... [2022-12-13 07:07:21,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8304d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:21, skipping insertion in model container [2022-12-13 07:07:21,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:20" (2/3) ... [2022-12-13 07:07:21,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8304d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:21, skipping insertion in model container [2022-12-13 07:07:21,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:21" (3/3) ... [2022-12-13 07:07:21,584 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2022-12-13 07:07:21,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:07:21,601 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:07:21,601 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:07:21,722 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 07:07:21,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 331 transitions, 678 flow [2022-12-13 07:07:21,945 INFO L130 PetriNetUnfolder]: 28/329 cut-off events. [2022-12-13 07:07:21,945 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:07:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 329 events. 28/329 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 330 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 258. Up to 2 conditions per place. [2022-12-13 07:07:21,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 331 transitions, 678 flow [2022-12-13 07:07:21,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 321 transitions, 654 flow [2022-12-13 07:07:21,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:21,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 321 transitions, 654 flow [2022-12-13 07:07:21,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 321 transitions, 654 flow [2022-12-13 07:07:22,050 INFO L130 PetriNetUnfolder]: 28/321 cut-off events. [2022-12-13 07:07:22,050 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:07:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 321 events. 28/321 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 331 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 258. Up to 2 conditions per place. [2022-12-13 07:07:22,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 321 transitions, 654 flow [2022-12-13 07:07:22,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 6048 [2022-12-13 07:07:33,514 INFO L241 LiptonReduction]: Total number of compositions: 295 [2022-12-13 07:07:33,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:07:33,533 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5020b8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:07:33,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 07:07:33,539 INFO L130 PetriNetUnfolder]: 6/25 cut-off events. [2022-12-13 07:07:33,540 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:07:33,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:33,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:33,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1474223832, now seen corresponding path program 1 times [2022-12-13 07:07:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:33,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685841810] [2022-12-13 07:07:33,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:33,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685841810] [2022-12-13 07:07:33,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685841810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:33,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:33,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:07:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006703346] [2022-12-13 07:07:33,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:33,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:07:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:33,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:07:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:07:33,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 07:07:33,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:33,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:33,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 07:07:33,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:34,063 INFO L130 PetriNetUnfolder]: 55/109 cut-off events. [2022-12-13 07:07:34,063 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 07:07:34,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 109 events. 55/109 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 27 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 195. Up to 79 conditions per place. [2022-12-13 07:07:34,068 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 07:07:34,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:07:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:07:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 07:07:34,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-13 07:07:34,084 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-13 07:07:34,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:34,088 INFO L89 Accepts]: Start accepts. Operand has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:34,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:34,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 31 transitions, 137 flow [2022-12-13 07:07:34,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-13 07:07:34,256 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:07:34,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 07:07:34,257 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 133 flow [2022-12-13 07:07:34,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:34,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:34,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:34,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:07:34,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2024896285, now seen corresponding path program 1 times [2022-12-13 07:07:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:34,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754004237] [2022-12-13 07:07:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754004237] [2022-12-13 07:07:34,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754004237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:34,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:34,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:07:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088634037] [2022-12-13 07:07:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:34,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:07:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:07:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:07:34,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 07:07:34,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:34,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:34,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 07:07:34,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:34,548 INFO L130 PetriNetUnfolder]: 49/104 cut-off events. [2022-12-13 07:07:34,549 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-13 07:07:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 104 events. 49/104 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 259 event pairs, 27 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 267. Up to 103 conditions per place. [2022-12-13 07:07:34,550 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-13 07:07:34,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:07:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:07:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 07:07:34,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 07:07:34,553 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-13 07:07:34,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:34,556 INFO L89 Accepts]: Start accepts. Operand has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:34,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:34,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 31 transitions, 197 flow [2022-12-13 07:07:34,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-13 07:07:35,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:07:35,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1229 [2022-12-13 07:07:35,785 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 191 flow [2022-12-13 07:07:35,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:35,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:35,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:07:35,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1952288344, now seen corresponding path program 1 times [2022-12-13 07:07:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108197033] [2022-12-13 07:07:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108197033] [2022-12-13 07:07:35,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108197033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:35,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:35,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:07:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402754064] [2022-12-13 07:07:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:35,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:07:35,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:07:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:07:35,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 07:07:35,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:35,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:35,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 07:07:35,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:35,986 INFO L130 PetriNetUnfolder]: 55/115 cut-off events. [2022-12-13 07:07:35,986 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 07:07:35,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 115 events. 55/115 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 289 event pairs, 33 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 388. Up to 114 conditions per place. [2022-12-13 07:07:35,987 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 07:07:35,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:07:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:07:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-13 07:07:35,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2022-12-13 07:07:35,989 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-13 07:07:35,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:35,991 INFO L89 Accepts]: Start accepts. Operand has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:35,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:35,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 259 flow [2022-12-13 07:07:35,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:36,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:07:36,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 07:07:36,278 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 251 flow [2022-12-13 07:07:36,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:36,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:36,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:07:36,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1653833965, now seen corresponding path program 1 times [2022-12-13 07:07:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:36,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64035577] [2022-12-13 07:07:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:36,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64035577] [2022-12-13 07:07:36,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64035577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114387160] [2022-12-13 07:07:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:36,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 07:07:36,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:36,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:36,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 07:07:36,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:36,579 INFO L130 PetriNetUnfolder]: 109/229 cut-off events. [2022-12-13 07:07:36,579 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 07:07:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 229 events. 109/229 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 751 event pairs, 66 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 478. Up to 229 conditions per place. [2022-12-13 07:07:36,581 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 51 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2022-12-13 07:07:36,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-13 07:07:36,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2022-12-13 07:07:36,584 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-13 07:07:36,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:36,587 INFO L89 Accepts]: Start accepts. Operand has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:36,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:36,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 60 transitions, 624 flow [2022-12-13 07:07:36,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:37,040 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:07:37,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 456 [2022-12-13 07:07:37,042 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 58 transitions, 604 flow [2022-12-13 07:07:37,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:37,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:37,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:37,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:07:37,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash 995776198, now seen corresponding path program 1 times [2022-12-13 07:07:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:37,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77198114] [2022-12-13 07:07:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77198114] [2022-12-13 07:07:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77198114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:37,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:37,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:07:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714184409] [2022-12-13 07:07:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:37,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:07:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:37,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:07:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:07:37,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:37,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 58 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:37,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:37,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:37,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:37,271 INFO L130 PetriNetUnfolder]: 109/229 cut-off events. [2022-12-13 07:07:37,271 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 07:07:37,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 229 events. 109/229 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 749 event pairs, 66 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 574. Up to 229 conditions per place. [2022-12-13 07:07:37,273 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 55 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2022-12-13 07:07:37,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:07:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:07:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-13 07:07:37,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26851851851851855 [2022-12-13 07:07:37,276 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-13 07:07:37,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:37,281 INFO L89 Accepts]: Start accepts. Operand has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:37,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:37,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:37,285 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:37,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:07:37,288 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 60 transitions, 744 flow [2022-12-13 07:07:37,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:37,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:37,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:07:37,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1247842738, now seen corresponding path program 1 times [2022-12-13 07:07:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:37,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475569759] [2022-12-13 07:07:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475569759] [2022-12-13 07:07:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475569759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:38,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:38,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:07:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084787498] [2022-12-13 07:07:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:38,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:07:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:07:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:07:38,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:38,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 60 transitions, 744 flow. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:38,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:38,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:39,411 INFO L130 PetriNetUnfolder]: 179/413 cut-off events. [2022-12-13 07:07:39,411 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-13 07:07:39,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 413 events. 179/413 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2033 event pairs, 14 based on Foata normal form. 2/385 useless extension candidates. Maximal degree in co-relation 1221. Up to 413 conditions per place. [2022-12-13 07:07:39,415 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 108 selfloop transitions, 20 changer transitions 14/142 dead transitions. [2022-12-13 07:07:39,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 142 transitions, 2072 flow [2022-12-13 07:07:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:07:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:07:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-12-13 07:07:39,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24074074074074073 [2022-12-13 07:07:39,420 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2022-12-13 07:07:39,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 142 transitions, 2072 flow [2022-12-13 07:07:39,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 128 transitions, 1864 flow [2022-12-13 07:07:39,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:39,428 INFO L89 Accepts]: Start accepts. Operand has 45 places, 128 transitions, 1864 flow [2022-12-13 07:07:39,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:39,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:39,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 128 transitions, 1864 flow [2022-12-13 07:07:39,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 128 transitions, 1864 flow [2022-12-13 07:07:39,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:39,435 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:39,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:07:39,435 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 128 transitions, 1864 flow [2022-12-13 07:07:39,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:39,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:39,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:39,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:07:39,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash 119469762, now seen corresponding path program 2 times [2022-12-13 07:07:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:39,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26083677] [2022-12-13 07:07:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26083677] [2022-12-13 07:07:41,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26083677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:41,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:41,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:07:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860828067] [2022-12-13 07:07:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:41,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:07:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:07:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:07:41,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:41,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 128 transitions, 1864 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:41,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:41,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:41,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:42,980 INFO L130 PetriNetUnfolder]: 187/453 cut-off events. [2022-12-13 07:07:42,980 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-13 07:07:42,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 453 events. 187/453 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2322 event pairs, 12 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 1516. Up to 453 conditions per place. [2022-12-13 07:07:42,984 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 181 selfloop transitions, 17 changer transitions 16/214 dead transitions. [2022-12-13 07:07:42,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 214 transitions, 3520 flow [2022-12-13 07:07:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 07:07:42,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26851851851851855 [2022-12-13 07:07:42,986 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 25 predicate places. [2022-12-13 07:07:42,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 214 transitions, 3520 flow [2022-12-13 07:07:42,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 198 transitions, 3252 flow [2022-12-13 07:07:42,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:42,995 INFO L89 Accepts]: Start accepts. Operand has 50 places, 198 transitions, 3252 flow [2022-12-13 07:07:42,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:42,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:42,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 198 transitions, 3252 flow [2022-12-13 07:07:43,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 198 transitions, 3252 flow [2022-12-13 07:07:43,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:43,003 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:43,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:07:43,004 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 198 transitions, 3252 flow [2022-12-13 07:07:43,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:43,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:43,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:43,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:07:43,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1025818708, now seen corresponding path program 1 times [2022-12-13 07:07:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:43,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338879798] [2022-12-13 07:07:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338879798] [2022-12-13 07:07:43,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338879798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:43,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:43,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:07:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855071720] [2022-12-13 07:07:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:43,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:07:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:43,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:07:43,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:07:43,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:43,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 198 transitions, 3252 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:43,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:43,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:43,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:43,939 INFO L130 PetriNetUnfolder]: 203/549 cut-off events. [2022-12-13 07:07:43,939 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-13 07:07:43,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5024 conditions, 549 events. 203/549 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3278 event pairs, 14 based on Foata normal form. 4/523 useless extension candidates. Maximal degree in co-relation 1938. Up to 549 conditions per place. [2022-12-13 07:07:43,944 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 228 selfloop transitions, 38 changer transitions 38/304 dead transitions. [2022-12-13 07:07:43,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 304 transitions, 5658 flow [2022-12-13 07:07:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 07:07:43,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30864197530864196 [2022-12-13 07:07:43,946 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2022-12-13 07:07:43,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 304 transitions, 5658 flow [2022-12-13 07:07:43,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 266 transitions, 4926 flow [2022-12-13 07:07:43,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:43,960 INFO L89 Accepts]: Start accepts. Operand has 54 places, 266 transitions, 4926 flow [2022-12-13 07:07:43,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:43,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:43,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 266 transitions, 4926 flow [2022-12-13 07:07:43,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 266 transitions, 4926 flow [2022-12-13 07:07:43,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:43,969 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:43,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:07:43,971 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 266 transitions, 4926 flow [2022-12-13 07:07:43,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:43,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:43,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:07:43,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -380891608, now seen corresponding path program 2 times [2022-12-13 07:07:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851204248] [2022-12-13 07:07:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:44,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851204248] [2022-12-13 07:07:44,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851204248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:44,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:44,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:07:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306957621] [2022-12-13 07:07:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:44,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:07:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:07:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:07:44,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:44,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 266 transitions, 4926 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:44,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:44,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:44,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:44,890 INFO L130 PetriNetUnfolder]: 183/523 cut-off events. [2022-12-13 07:07:44,890 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-13 07:07:44,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 523 events. 183/523 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3151 event pairs, 2 based on Foata normal form. 4/497 useless extension candidates. Maximal degree in co-relation 2098. Up to 523 conditions per place. [2022-12-13 07:07:44,896 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 216 selfloop transitions, 36 changer transitions 38/290 dead transitions. [2022-12-13 07:07:44,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 290 transitions, 5962 flow [2022-12-13 07:07:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-13 07:07:44,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-13 07:07:44,898 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 32 predicate places. [2022-12-13 07:07:44,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 290 transitions, 5962 flow [2022-12-13 07:07:44,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 252 transitions, 5166 flow [2022-12-13 07:07:44,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:44,910 INFO L89 Accepts]: Start accepts. Operand has 57 places, 252 transitions, 5166 flow [2022-12-13 07:07:44,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:44,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:44,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 252 transitions, 5166 flow [2022-12-13 07:07:44,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 252 transitions, 5166 flow [2022-12-13 07:07:44,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:44,920 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:44,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:07:44,922 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 252 transitions, 5166 flow [2022-12-13 07:07:44,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:44,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:44,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:44,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:07:44,924 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 463116772, now seen corresponding path program 3 times [2022-12-13 07:07:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:44,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582017514] [2022-12-13 07:07:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582017514] [2022-12-13 07:07:45,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582017514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:45,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:45,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:07:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267436891] [2022-12-13 07:07:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:07:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:07:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:07:45,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:45,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 252 transitions, 5166 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:45,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:45,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:45,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:45,656 INFO L130 PetriNetUnfolder]: 169/491 cut-off events. [2022-12-13 07:07:45,657 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-13 07:07:45,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 491 events. 169/491 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2963 event pairs, 4 based on Foata normal form. 4/465 useless extension candidates. Maximal degree in co-relation 2171. Up to 491 conditions per place. [2022-12-13 07:07:45,662 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 206 selfloop transitions, 14 changer transitions 46/266 dead transitions. [2022-12-13 07:07:45,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 266 transitions, 5990 flow [2022-12-13 07:07:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 07:07:45,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2022-12-13 07:07:45,665 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 35 predicate places. [2022-12-13 07:07:45,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 266 transitions, 5990 flow [2022-12-13 07:07:45,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 220 transitions, 4942 flow [2022-12-13 07:07:45,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:45,677 INFO L89 Accepts]: Start accepts. Operand has 59 places, 220 transitions, 4942 flow [2022-12-13 07:07:45,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:45,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:45,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 220 transitions, 4942 flow [2022-12-13 07:07:45,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 220 transitions, 4942 flow [2022-12-13 07:07:45,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:45,687 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:45,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:07:45,688 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 220 transitions, 4942 flow [2022-12-13 07:07:45,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:45,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:45,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:45,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:07:45,689 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:45,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash -538614638, now seen corresponding path program 3 times [2022-12-13 07:07:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:45,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658096908] [2022-12-13 07:07:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:45,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:46,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658096908] [2022-12-13 07:07:46,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658096908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:46,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:46,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:07:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401127261] [2022-12-13 07:07:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:46,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:07:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:07:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:07:46,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:46,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 220 transitions, 4942 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:46,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:46,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:46,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:47,140 INFO L130 PetriNetUnfolder]: 195/605 cut-off events. [2022-12-13 07:07:47,140 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-13 07:07:47,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7314 conditions, 605 events. 195/605 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3996 event pairs, 14 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 2887. Up to 605 conditions per place. [2022-12-13 07:07:47,150 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 267 selfloop transitions, 37 changer transitions 24/328 dead transitions. [2022-12-13 07:07:47,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 328 transitions, 8040 flow [2022-12-13 07:07:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-12-13 07:07:47,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30092592592592593 [2022-12-13 07:07:47,152 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 39 predicate places. [2022-12-13 07:07:47,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 328 transitions, 8040 flow [2022-12-13 07:07:47,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 304 transitions, 7440 flow [2022-12-13 07:07:47,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:47,169 INFO L89 Accepts]: Start accepts. Operand has 65 places, 304 transitions, 7440 flow [2022-12-13 07:07:47,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:47,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:47,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 304 transitions, 7440 flow [2022-12-13 07:07:47,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 304 transitions, 7440 flow [2022-12-13 07:07:47,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:47,180 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:47,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:07:47,181 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 304 transitions, 7440 flow [2022-12-13 07:07:47,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:47,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:47,181 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:47,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 07:07:47,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -253860728, now seen corresponding path program 4 times [2022-12-13 07:07:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:47,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891043301] [2022-12-13 07:07:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:48,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891043301] [2022-12-13 07:07:48,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891043301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:48,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:48,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:07:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240256185] [2022-12-13 07:07:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:48,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:07:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:07:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:07:48,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:48,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 304 transitions, 7440 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:48,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:48,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:48,615 INFO L130 PetriNetUnfolder]: 185/561 cut-off events. [2022-12-13 07:07:48,615 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2022-12-13 07:07:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 561 events. 185/561 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3596 event pairs, 2 based on Foata normal form. 2/535 useless extension candidates. Maximal degree in co-relation 2944. Up to 561 conditions per place. [2022-12-13 07:07:48,620 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 249 selfloop transitions, 35 changer transitions 18/302 dead transitions. [2022-12-13 07:07:48,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 302 transitions, 7996 flow [2022-12-13 07:07:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-12-13 07:07:48,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27314814814814814 [2022-12-13 07:07:48,622 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 45 predicate places. [2022-12-13 07:07:48,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 302 transitions, 7996 flow [2022-12-13 07:07:48,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 284 transitions, 7510 flow [2022-12-13 07:07:48,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:48,634 INFO L89 Accepts]: Start accepts. Operand has 70 places, 284 transitions, 7510 flow [2022-12-13 07:07:48,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:48,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:48,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 284 transitions, 7510 flow [2022-12-13 07:07:48,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 284 transitions, 7510 flow [2022-12-13 07:07:48,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:48,644 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:48,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:07:48,645 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 284 transitions, 7510 flow [2022-12-13 07:07:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:48,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:48,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 07:07:48,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1823483586, now seen corresponding path program 4 times [2022-12-13 07:07:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:48,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765365369] [2022-12-13 07:07:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765365369] [2022-12-13 07:07:49,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765365369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:49,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:49,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:07:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455235681] [2022-12-13 07:07:49,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:49,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:07:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:49,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:07:49,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:07:49,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:49,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 284 transitions, 7510 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:49,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:49,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:49,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:49,409 INFO L130 PetriNetUnfolder]: 193/565 cut-off events. [2022-12-13 07:07:49,410 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 07:07:49,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7958 conditions, 565 events. 193/565 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3577 event pairs, 6 based on Foata normal form. 8/545 useless extension candidates. Maximal degree in co-relation 3243. Up to 565 conditions per place. [2022-12-13 07:07:49,414 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 187 selfloop transitions, 20 changer transitions 83/290 dead transitions. [2022-12-13 07:07:49,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 290 transitions, 8258 flow [2022-12-13 07:07:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 07:07:49,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30864197530864196 [2022-12-13 07:07:49,416 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2022-12-13 07:07:49,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 290 transitions, 8258 flow [2022-12-13 07:07:49,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 207 transitions, 5892 flow [2022-12-13 07:07:49,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:49,428 INFO L89 Accepts]: Start accepts. Operand has 69 places, 207 transitions, 5892 flow [2022-12-13 07:07:49,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:49,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:49,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 207 transitions, 5892 flow [2022-12-13 07:07:49,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 207 transitions, 5892 flow [2022-12-13 07:07:49,439 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:49,440 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:49,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:07:49,441 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 207 transitions, 5892 flow [2022-12-13 07:07:49,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:49,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:49,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:49,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:07:49,442 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -654652132, now seen corresponding path program 5 times [2022-12-13 07:07:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:49,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483769507] [2022-12-13 07:07:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483769507] [2022-12-13 07:07:50,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483769507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:50,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:50,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:07:50,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301855115] [2022-12-13 07:07:50,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:50,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:07:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:07:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:07:50,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:50,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 207 transitions, 5892 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:50,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:50,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:50,761 INFO L130 PetriNetUnfolder]: 167/477 cut-off events. [2022-12-13 07:07:50,761 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-12-13 07:07:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 477 events. 167/477 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2828 event pairs, 6 based on Foata normal form. 2/463 useless extension candidates. Maximal degree in co-relation 2956. Up to 477 conditions per place. [2022-12-13 07:07:50,765 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 177 selfloop transitions, 24 changer transitions 24/225 dead transitions. [2022-12-13 07:07:50,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 225 transitions, 6858 flow [2022-12-13 07:07:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:07:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:07:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-13 07:07:50,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.291005291005291 [2022-12-13 07:07:50,767 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2022-12-13 07:07:50,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 225 transitions, 6858 flow [2022-12-13 07:07:50,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 201 transitions, 6120 flow [2022-12-13 07:07:50,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:50,778 INFO L89 Accepts]: Start accepts. Operand has 72 places, 201 transitions, 6120 flow [2022-12-13 07:07:50,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:50,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:50,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 201 transitions, 6120 flow [2022-12-13 07:07:50,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 201 transitions, 6120 flow [2022-12-13 07:07:50,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:50,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:50,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:07:50,788 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 201 transitions, 6120 flow [2022-12-13 07:07:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:50,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:50,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:07:50,788 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2087093846, now seen corresponding path program 6 times [2022-12-13 07:07:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:50,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154510593] [2022-12-13 07:07:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:52,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154510593] [2022-12-13 07:07:52,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154510593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:52,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:52,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:07:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137682543] [2022-12-13 07:07:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:52,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:07:52,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:07:52,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:07:52,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 07:07:52,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 201 transitions, 6120 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:52,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:52,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 07:07:52,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:53,373 INFO L130 PetriNetUnfolder]: 155/441 cut-off events. [2022-12-13 07:07:53,374 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-13 07:07:53,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7098 conditions, 441 events. 155/441 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2566 event pairs, 6 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 2927. Up to 441 conditions per place. [2022-12-13 07:07:53,377 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 148 selfloop transitions, 18 changer transitions 33/199 dead transitions. [2022-12-13 07:07:53,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 199 transitions, 6458 flow [2022-12-13 07:07:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:07:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:07:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-13 07:07:53,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26455026455026454 [2022-12-13 07:07:53,379 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 51 predicate places. [2022-12-13 07:07:53,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 199 transitions, 6458 flow [2022-12-13 07:07:53,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 166 transitions, 5384 flow [2022-12-13 07:07:53,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:53,388 INFO L89 Accepts]: Start accepts. Operand has 75 places, 166 transitions, 5384 flow [2022-12-13 07:07:53,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:53,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:53,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 166 transitions, 5384 flow [2022-12-13 07:07:53,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 166 transitions, 5384 flow [2022-12-13 07:07:53,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:53,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L51-->L51-1: Formula: (= (select (select |v_#memory_int_2| v_~get_5~0.base_1) (+ v_~get_5~0.offset_1 (* v_~id_3~0_1 4))) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {~id_3~0=v_~id_3~0_1, #memory_int=|v_#memory_int_2|, ~get_5~0.offset=v_~get_5~0.offset_1, ~get_5~0.base=v_~get_5~0.base_1} OutVars{~id_3~0=v_~id_3~0_1, #memory_int=|v_#memory_int_2|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~get_5~0.offset=v_~get_5~0.offset_1, ~get_5~0.base=v_~get_5~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1] and [1198] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_80| |v_ULTIMATE.start_main_#t~pre33#1_53|) (= (store |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre33#1_53|)) |v_#memory_int_245|) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_246|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_29|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_245|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_15|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 07:07:53,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L51-->L51-1: Formula: (= (select (select |v_#memory_int_2| v_~get_5~0.base_1) (+ v_~get_5~0.offset_1 (* v_~id_3~0_1 4))) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {~id_3~0=v_~id_3~0_1, #memory_int=|v_#memory_int_2|, ~get_5~0.offset=v_~get_5~0.offset_1, ~get_5~0.base=v_~get_5~0.base_1} OutVars{~id_3~0=v_~id_3~0_1, #memory_int=|v_#memory_int_2|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~get_5~0.offset=v_~get_5~0.offset_1, ~get_5~0.base=v_~get_5~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1] and [1198] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_80| |v_ULTIMATE.start_main_#t~pre33#1_53|) (= (store |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre33#1_53|)) |v_#memory_int_245|) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_246|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_29|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_245|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_15|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 07:07:53,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:07:53,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 07:07:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 165 transitions, 5362 flow [2022-12-13 07:07:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:53,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:53,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 07:07:53,570 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2137626981, now seen corresponding path program 1 times [2022-12-13 07:07:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538925716] [2022-12-13 07:07:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:54,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538925716] [2022-12-13 07:07:54,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538925716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:54,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:54,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:07:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316114597] [2022-12-13 07:07:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:07:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:07:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:07:54,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:07:54,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 165 transitions, 5362 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:54,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:54,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:07:54,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:54,464 INFO L130 PetriNetUnfolder]: 157/425 cut-off events. [2022-12-13 07:07:54,464 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-13 07:07:54,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7322 conditions, 425 events. 157/425 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2328 event pairs, 4 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2723. Up to 425 conditions per place. [2022-12-13 07:07:54,468 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 186 selfloop transitions, 19 changer transitions 20/225 dead transitions. [2022-12-13 07:07:54,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 225 transitions, 7798 flow [2022-12-13 07:07:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 07:07:54,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2265625 [2022-12-13 07:07:54,471 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 52 predicate places. [2022-12-13 07:07:54,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 225 transitions, 7798 flow [2022-12-13 07:07:54,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 205 transitions, 7094 flow [2022-12-13 07:07:54,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:54,482 INFO L89 Accepts]: Start accepts. Operand has 78 places, 205 transitions, 7094 flow [2022-12-13 07:07:54,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:54,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:54,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 205 transitions, 7094 flow [2022-12-13 07:07:54,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 205 transitions, 7094 flow [2022-12-13 07:07:54,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:54,493 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:54,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:07:54,493 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 205 transitions, 7094 flow [2022-12-13 07:07:54,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:54,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:54,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 07:07:54,494 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 555814103, now seen corresponding path program 2 times [2022-12-13 07:07:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373221103] [2022-12-13 07:07:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373221103] [2022-12-13 07:07:55,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373221103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:55,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:55,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:07:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296200174] [2022-12-13 07:07:55,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:55,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:07:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:07:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:07:55,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:07:55,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 205 transitions, 7094 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:55,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:55,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:07:55,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:55,409 INFO L130 PetriNetUnfolder]: 147/409 cut-off events. [2022-12-13 07:07:55,410 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-13 07:07:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 409 events. 147/409 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2241 event pairs, 4 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2808. Up to 409 conditions per place. [2022-12-13 07:07:55,414 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 182 selfloop transitions, 15 changer transitions 20/217 dead transitions. [2022-12-13 07:07:55,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 217 transitions, 7948 flow [2022-12-13 07:07:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-13 07:07:55,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.203125 [2022-12-13 07:07:55,416 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2022-12-13 07:07:55,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 217 transitions, 7948 flow [2022-12-13 07:07:55,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 197 transitions, 7210 flow [2022-12-13 07:07:55,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:55,427 INFO L89 Accepts]: Start accepts. Operand has 83 places, 197 transitions, 7210 flow [2022-12-13 07:07:55,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:55,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:55,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 197 transitions, 7210 flow [2022-12-13 07:07:55,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 197 transitions, 7210 flow [2022-12-13 07:07:55,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:55,436 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:55,437 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:07:55,437 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 197 transitions, 7210 flow [2022-12-13 07:07:55,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:55,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:55,437 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:55,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 07:07:55,437 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash 628816609, now seen corresponding path program 3 times [2022-12-13 07:07:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:55,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493236773] [2022-12-13 07:07:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:56,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493236773] [2022-12-13 07:07:56,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493236773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:56,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:56,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:07:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491397946] [2022-12-13 07:07:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:56,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:07:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:07:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:07:56,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:07:56,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 197 transitions, 7210 flow. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:56,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:56,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:07:56,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:56,575 INFO L130 PetriNetUnfolder]: 137/389 cut-off events. [2022-12-13 07:07:56,575 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-13 07:07:56,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 389 events. 137/389 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2098 event pairs, 4 based on Foata normal form. 2/381 useless extension candidates. Maximal degree in co-relation 2771. Up to 389 conditions per place. [2022-12-13 07:07:56,578 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 180 selfloop transitions, 9 changer transitions 24/213 dead transitions. [2022-12-13 07:07:56,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 213 transitions, 8230 flow [2022-12-13 07:07:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-13 07:07:56,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2552083333333333 [2022-12-13 07:07:56,581 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 61 predicate places. [2022-12-13 07:07:56,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 213 transitions, 8230 flow [2022-12-13 07:07:56,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 189 transitions, 7294 flow [2022-12-13 07:07:56,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:56,591 INFO L89 Accepts]: Start accepts. Operand has 86 places, 189 transitions, 7294 flow [2022-12-13 07:07:56,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:56,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:56,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 189 transitions, 7294 flow [2022-12-13 07:07:56,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 189 transitions, 7294 flow [2022-12-13 07:07:56,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:56,599 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:56,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:07:56,602 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 189 transitions, 7294 flow [2022-12-13 07:07:56,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:56,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:56,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 07:07:56,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1120463331, now seen corresponding path program 4 times [2022-12-13 07:07:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018357960] [2022-12-13 07:07:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018357960] [2022-12-13 07:07:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018357960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:57,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:57,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:07:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310394118] [2022-12-13 07:07:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:07:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:07:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:07:57,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:07:57,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 189 transitions, 7294 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:57,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:57,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:07:57,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:57,640 INFO L130 PetriNetUnfolder]: 125/353 cut-off events. [2022-12-13 07:07:57,641 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-13 07:07:57,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7140 conditions, 353 events. 125/353 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1827 event pairs, 4 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 2714. Up to 353 conditions per place. [2022-12-13 07:07:57,644 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 156 selfloop transitions, 9 changer transitions 22/187 dead transitions. [2022-12-13 07:07:57,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 187 transitions, 7592 flow [2022-12-13 07:07:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-12-13 07:07:57,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19921875 [2022-12-13 07:07:57,646 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 66 predicate places. [2022-12-13 07:07:57,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 187 transitions, 7592 flow [2022-12-13 07:07:57,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 165 transitions, 6694 flow [2022-12-13 07:07:57,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:57,656 INFO L89 Accepts]: Start accepts. Operand has 89 places, 165 transitions, 6694 flow [2022-12-13 07:07:57,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:57,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:57,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 165 transitions, 6694 flow [2022-12-13 07:07:57,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 165 transitions, 6694 flow [2022-12-13 07:07:57,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:57,664 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:57,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:07:57,666 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 165 transitions, 6694 flow [2022-12-13 07:07:57,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:57,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:57,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:57,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 07:07:57,666 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1399822483, now seen corresponding path program 5 times [2022-12-13 07:07:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450715056] [2022-12-13 07:07:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:58,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450715056] [2022-12-13 07:07:58,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450715056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:58,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:58,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:07:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35999650] [2022-12-13 07:07:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:07:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:07:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:07:58,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:07:58,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 165 transitions, 6694 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:58,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:58,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:07:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:58,544 INFO L130 PetriNetUnfolder]: 121/325 cut-off events. [2022-12-13 07:07:58,544 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-13 07:07:58,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 325 events. 121/325 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1581 event pairs, 4 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 2637. Up to 325 conditions per place. [2022-12-13 07:07:58,548 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 134 selfloop transitions, 3 changer transitions 26/163 dead transitions. [2022-12-13 07:07:58,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 163 transitions, 6940 flow [2022-12-13 07:07:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:07:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:07:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-12-13 07:07:58,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16796875 [2022-12-13 07:07:58,549 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2022-12-13 07:07:58,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 163 transitions, 6940 flow [2022-12-13 07:07:58,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 137 transitions, 5830 flow [2022-12-13 07:07:58,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:58,559 INFO L89 Accepts]: Start accepts. Operand has 76 places, 137 transitions, 5830 flow [2022-12-13 07:07:58,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:58,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:58,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 137 transitions, 5830 flow [2022-12-13 07:07:58,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 137 transitions, 5830 flow [2022-12-13 07:07:58,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:58,568 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:58,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:07:58,569 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 137 transitions, 5830 flow [2022-12-13 07:07:58,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:58,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:58,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:58,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 07:07:58,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:07:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1710399054, now seen corresponding path program 1 times [2022-12-13 07:07:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175716380] [2022-12-13 07:07:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:07:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175716380] [2022-12-13 07:07:59,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175716380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:59,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:59,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:07:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275190422] [2022-12-13 07:07:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:59,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:07:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:07:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:07:59,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:07:59,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 137 transitions, 5830 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:59,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:59,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:07:59,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:00,515 INFO L130 PetriNetUnfolder]: 113/331 cut-off events. [2022-12-13 07:08:00,515 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-13 07:08:00,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 331 events. 113/331 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1706 event pairs, 4 based on Foata normal form. 4/327 useless extension candidates. Maximal degree in co-relation 2672. Up to 332 conditions per place. [2022-12-13 07:08:00,518 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 128 selfloop transitions, 41 changer transitions 44/213 dead transitions. [2022-12-13 07:08:00,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 213 transitions, 9514 flow [2022-12-13 07:08:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:08:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:08:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-12-13 07:08:00,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-13 07:08:00,520 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 57 predicate places. [2022-12-13 07:08:00,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 213 transitions, 9514 flow [2022-12-13 07:08:00,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 169 transitions, 7530 flow [2022-12-13 07:08:00,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:00,527 INFO L89 Accepts]: Start accepts. Operand has 83 places, 169 transitions, 7530 flow [2022-12-13 07:08:00,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:00,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:00,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 169 transitions, 7530 flow [2022-12-13 07:08:00,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 169 transitions, 7530 flow [2022-12-13 07:08:00,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:00,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:00,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:08:00,536 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 169 transitions, 7530 flow [2022-12-13 07:08:00,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:00,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:00,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:00,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 07:08:00,537 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1363129923, now seen corresponding path program 1 times [2022-12-13 07:08:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:00,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468166126] [2022-12-13 07:08:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468166126] [2022-12-13 07:08:01,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468166126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:01,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:01,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:08:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977751020] [2022-12-13 07:08:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:08:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:08:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:08:01,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:08:01,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 169 transitions, 7530 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:01,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:01,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:08:01,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:01,854 INFO L130 PetriNetUnfolder]: 89/273 cut-off events. [2022-12-13 07:08:01,854 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-13 07:08:01,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 273 events. 89/273 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1301 event pairs, 0 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 2375. Up to 274 conditions per place. [2022-12-13 07:08:01,857 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 162 selfloop transitions, 7 changer transitions 24/193 dead transitions. [2022-12-13 07:08:01,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 193 transitions, 8996 flow [2022-12-13 07:08:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:08:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:08:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-13 07:08:01,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23979591836734693 [2022-12-13 07:08:01,858 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 62 predicate places. [2022-12-13 07:08:01,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 193 transitions, 8996 flow [2022-12-13 07:08:01,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 169 transitions, 7868 flow [2022-12-13 07:08:01,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:01,865 INFO L89 Accepts]: Start accepts. Operand has 86 places, 169 transitions, 7868 flow [2022-12-13 07:08:01,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:01,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:01,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 169 transitions, 7868 flow [2022-12-13 07:08:01,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 169 transitions, 7868 flow [2022-12-13 07:08:01,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:01,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:01,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:08:01,875 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 169 transitions, 7868 flow [2022-12-13 07:08:01,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:01,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:01,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:01,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 07:08:01,876 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1995152964, now seen corresponding path program 2 times [2022-12-13 07:08:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:01,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038236865] [2022-12-13 07:08:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038236865] [2022-12-13 07:08:02,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038236865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:02,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:02,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:08:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804030155] [2022-12-13 07:08:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:02,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:08:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:02,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:08:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:08:02,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:08:02,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 169 transitions, 7868 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:02,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:02,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:08:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:03,338 INFO L130 PetriNetUnfolder]: 83/285 cut-off events. [2022-12-13 07:08:03,338 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 07:08:03,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6906 conditions, 285 events. 83/285 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1504 event pairs, 0 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 2670. Up to 286 conditions per place. [2022-12-13 07:08:03,341 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 108 selfloop transitions, 31 changer transitions 66/205 dead transitions. [2022-12-13 07:08:03,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 205 transitions, 9964 flow [2022-12-13 07:08:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:08:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:08:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-12-13 07:08:03,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-13 07:08:03,343 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 67 predicate places. [2022-12-13 07:08:03,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 205 transitions, 9964 flow [2022-12-13 07:08:03,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 139 transitions, 6736 flow [2022-12-13 07:08:03,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:03,349 INFO L89 Accepts]: Start accepts. Operand has 92 places, 139 transitions, 6736 flow [2022-12-13 07:08:03,353 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:03,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:03,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 139 transitions, 6736 flow [2022-12-13 07:08:03,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 139 transitions, 6736 flow [2022-12-13 07:08:03,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:03,358 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:03,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:08:03,359 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 139 transitions, 6736 flow [2022-12-13 07:08:03,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:03,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:03,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:03,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 07:08:03,360 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1987760913, now seen corresponding path program 2 times [2022-12-13 07:08:03,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106621865] [2022-12-13 07:08:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106621865] [2022-12-13 07:08:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106621865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:04,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:08:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582181568] [2022-12-13 07:08:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:04,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:08:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:08:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:08:04,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:08:04,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 139 transitions, 6736 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:04,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:04,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:08:04,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:04,805 INFO L130 PetriNetUnfolder]: 55/189 cut-off events. [2022-12-13 07:08:04,805 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-13 07:08:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 189 events. 55/189 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 805 event pairs, 0 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 1823. Up to 190 conditions per place. [2022-12-13 07:08:04,807 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 102 selfloop transitions, 3 changer transitions 32/137 dead transitions. [2022-12-13 07:08:04,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 6914 flow [2022-12-13 07:08:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:08:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:08:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-13 07:08:04,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20918367346938777 [2022-12-13 07:08:04,809 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 71 predicate places. [2022-12-13 07:08:04,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 137 transitions, 6914 flow [2022-12-13 07:08:04,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 105 transitions, 5296 flow [2022-12-13 07:08:04,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:04,815 INFO L89 Accepts]: Start accepts. Operand has 91 places, 105 transitions, 5296 flow [2022-12-13 07:08:04,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:04,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:04,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 105 transitions, 5296 flow [2022-12-13 07:08:04,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 105 transitions, 5296 flow [2022-12-13 07:08:04,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:04,823 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:04,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:08:04,824 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 5296 flow [2022-12-13 07:08:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:04,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:04,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:04,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 07:08:04,824 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash -621311908, now seen corresponding path program 3 times [2022-12-13 07:08:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:04,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901431766] [2022-12-13 07:08:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901431766] [2022-12-13 07:08:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901431766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:06,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:06,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:08:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109371300] [2022-12-13 07:08:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:06,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:08:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:06,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:08:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:08:06,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 07:08:06,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 5296 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:06,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:06,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 07:08:06,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:06,429 INFO L130 PetriNetUnfolder]: 43/153 cut-off events. [2022-12-13 07:08:06,430 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-13 07:08:06,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 153 events. 43/153 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 585 event pairs, 0 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 1424. Up to 154 conditions per place. [2022-12-13 07:08:06,431 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 82 selfloop transitions, 11 changer transitions 24/117 dead transitions. [2022-12-13 07:08:06,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 6142 flow [2022-12-13 07:08:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:08:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:08:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-12-13 07:08:06,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1752136752136752 [2022-12-13 07:08:06,432 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 72 predicate places. [2022-12-13 07:08:06,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 117 transitions, 6142 flow [2022-12-13 07:08:06,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 93 transitions, 4876 flow [2022-12-13 07:08:06,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:06,436 INFO L89 Accepts]: Start accepts. Operand has 95 places, 93 transitions, 4876 flow [2022-12-13 07:08:06,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:06,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:06,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 93 transitions, 4876 flow [2022-12-13 07:08:06,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 93 transitions, 4876 flow [2022-12-13 07:08:06,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:06,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:06,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:08:06,446 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 4876 flow [2022-12-13 07:08:06,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:06,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:06,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:06,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 07:08:06,447 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1594361560, now seen corresponding path program 4 times [2022-12-13 07:08:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:06,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604537590] [2022-12-13 07:08:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:07,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604537590] [2022-12-13 07:08:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604537590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:07,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:07,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:08:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995719442] [2022-12-13 07:08:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:08:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:08:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:08:07,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 07:08:07,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 4876 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:07,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:07,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 07:08:07,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:08,551 INFO L130 PetriNetUnfolder]: 37/143 cut-off events. [2022-12-13 07:08:08,551 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 07:08:08,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 143 events. 37/143 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 534 event pairs, 0 based on Foata normal form. 4/139 useless extension candidates. Maximal degree in co-relation 1369. Up to 144 conditions per place. [2022-12-13 07:08:08,552 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 50 selfloop transitions, 6 changer transitions 55/111 dead transitions. [2022-12-13 07:08:08,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 111 transitions, 6046 flow [2022-12-13 07:08:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:08:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:08:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-12-13 07:08:08,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-13 07:08:08,554 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2022-12-13 07:08:08,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 111 transitions, 6046 flow [2022-12-13 07:08:08,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 56 transitions, 3042 flow [2022-12-13 07:08:08,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:08,558 INFO L89 Accepts]: Start accepts. Operand has 99 places, 56 transitions, 3042 flow [2022-12-13 07:08:08,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:08,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:08,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 56 transitions, 3042 flow [2022-12-13 07:08:08,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 56 transitions, 3042 flow [2022-12-13 07:08:08,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:08,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:08,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:08:08,564 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 56 transitions, 3042 flow [2022-12-13 07:08:08,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:08,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:08,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:08,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 07:08:08,564 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1223192178, now seen corresponding path program 7 times [2022-12-13 07:08:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:08,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691713232] [2022-12-13 07:08:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:08:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:09,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691713232] [2022-12-13 07:08:09,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691713232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:09,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:09,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:08:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276146130] [2022-12-13 07:08:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:08:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:09,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:08:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:08:09,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 07:08:09,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 56 transitions, 3042 flow. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:09,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:09,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 07:08:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:09,930 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2022-12-13 07:08:09,930 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 07:08:09,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 65 events. 17/65 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 704. Up to 66 conditions per place. [2022-12-13 07:08:09,930 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2022-12-13 07:08:09,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 54 transitions, 3042 flow [2022-12-13 07:08:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:08:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:08:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-12-13 07:08:09,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12962962962962962 [2022-12-13 07:08:09,936 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 79 predicate places. [2022-12-13 07:08:09,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 54 transitions, 3042 flow [2022-12-13 07:08:09,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 07:08:09,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:09,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:08:09,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:08:09,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:09,939 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:09,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 07:08:09,940 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 07:08:09,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:09,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 07:08:09,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 07:08:09,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 07:08:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 07:08:09,943 INFO L445 BasicCegarLoop]: Path program histogram: [7, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2022-12-13 07:08:09,950 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:08:09,950 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:08:09,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:08:09 BasicIcfg [2022-12-13 07:08:09,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:08:09,953 INFO L158 Benchmark]: Toolchain (without parser) took 49461.80ms. Allocated memory was 187.7MB in the beginning and 924.8MB in the end (delta: 737.1MB). Free memory was 164.2MB in the beginning and 497.4MB in the end (delta: -333.2MB). Peak memory consumption was 403.9MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,953 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:08:09,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.29ms. Allocated memory is still 187.7MB. Free memory was 164.2MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.40ms. Allocated memory is still 187.7MB. Free memory was 151.1MB in the beginning and 148.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,954 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 187.7MB. Free memory was 148.5MB in the beginning and 146.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,954 INFO L158 Benchmark]: RCFGBuilder took 668.45ms. Allocated memory is still 187.7MB. Free memory was 146.4MB in the beginning and 121.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,954 INFO L158 Benchmark]: TraceAbstraction took 48373.18ms. Allocated memory was 187.7MB in the beginning and 924.8MB in the end (delta: 737.1MB). Free memory was 120.2MB in the beginning and 497.4MB in the end (delta: -377.2MB). Peak memory consumption was 359.9MB. Max. memory is 8.0GB. [2022-12-13 07:08:09,956 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.29ms. Allocated memory is still 187.7MB. Free memory was 164.2MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.40ms. Allocated memory is still 187.7MB. Free memory was 151.1MB in the beginning and 148.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 187.7MB. Free memory was 148.5MB in the beginning and 146.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 668.45ms. Allocated memory is still 187.7MB. Free memory was 146.4MB in the beginning and 121.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 48373.18ms. Allocated memory was 187.7MB in the beginning and 924.8MB in the end (delta: 737.1MB). Free memory was 120.2MB in the beginning and 497.4MB in the end (delta: -377.2MB). Peak memory consumption was 359.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5s, 300 PlacesBefore, 27 PlacesAfterwards, 321 TransitionsBefore, 26 TransitionsAfterwards, 6048 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 185 TrivialYvCompositions, 88 ConcurrentYvCompositions, 22 ChoiceCompositions, 295 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 3849, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3514, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3514, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3891, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3514, unknown conditional: 0, unknown unconditional: 3514] , Statistics on independence cache: Total cache size (in pairs): 7168, Positive cache size: 7141, Positive conditional cache size: 0, Positive unconditional cache size: 7141, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 29 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 31 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 37 PlacesBefore, 35 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 252 TransitionsBefore, 252 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 304 TransitionsBefore, 304 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 284 TransitionsBefore, 284 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 201 TransitionsBefore, 201 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 75 PlacesBefore, 72 PlacesAfterwards, 166 TransitionsBefore, 165 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 396 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.2s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1727 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4696 IncrementalHoareTripleChecker+Invalid, 4827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 9 mSDtfsCounter, 4696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7868occurred in iteration=22, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 9892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 07:08:10,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...