/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/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:20:37,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:20:37,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:20:37,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:20:37,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:20:37,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:20:37,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:20:37,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:20:37,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:20:37,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:20:37,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:20:37,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:20:37,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:20:37,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:20:37,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:20:37,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:20:37,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:20:37,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:20:37,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:20:37,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:20:37,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:20:37,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:20:37,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:20:37,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:20:37,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:20:37,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:20:37,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:20:37,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:20:37,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:20:37,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:20:37,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:20:37,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:20:37,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:20:37,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:20:37,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:20:37,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:20:37,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:20:37,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:20:37,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:20:37,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:20:37,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:20:37,795 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:20:37,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:20:37,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:20:37,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:20:37,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:20:37,822 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:20:37,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:20:37,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:20:37,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:20:37,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:20:37,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:20:37,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:20:37,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:20:37,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:20:37,825 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:20:37,825 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:20:38,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:20:38,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:20:38,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:20:38,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:20:38,105 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:20:38,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-13 07:20:39,082 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:20:39,323 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:20:39,324 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-13 07:20:39,329 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35e421a5/2860186ed33c4580b413e95acb07d41f/FLAGffcd8ab90 [2022-12-13 07:20:39,343 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35e421a5/2860186ed33c4580b413e95acb07d41f [2022-12-13 07:20:39,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:20:39,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:20:39,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:20:39,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:20:39,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:20:39,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b304d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39, skipping insertion in model container [2022-12-13 07:20:39,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:20:39,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:20:39,543 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/fibonacci.wvr.c[2330,2343] [2022-12-13 07:20:39,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:20:39,565 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:20:39,599 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/fibonacci.wvr.c[2330,2343] [2022-12-13 07:20:39,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:20:39,619 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:20:39,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39 WrapperNode [2022-12-13 07:20:39,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:20:39,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:20:39,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:20:39,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:20:39,628 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:20:39" (1/1) ... [2022-12-13 07:20:39,643 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:20:39" (1/1) ... [2022-12-13 07:20:39,669 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 162 [2022-12-13 07:20:39,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:20:39,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:20:39,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:20:39,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:20:39,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,701 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:20:39,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:20:39,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:20:39,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:20:39,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (1/1) ... [2022-12-13 07:20:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:20:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:39,739 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:20:39,745 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:20:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:20:39,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:20:39,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:20:39,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:20:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:20:39,767 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:20:39,852 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:20:39,853 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:20:40,154 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:20:40,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:20:40,167 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 07:20:40,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:20:40 BoogieIcfgContainer [2022-12-13 07:20:40,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:20:40,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:20:40,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:20:40,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:20:40,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:20:39" (1/3) ... [2022-12-13 07:20:40,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c564737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:20:40, skipping insertion in model container [2022-12-13 07:20:40,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:20:39" (2/3) ... [2022-12-13 07:20:40,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c564737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:20:40, skipping insertion in model container [2022-12-13 07:20:40,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:20:40" (3/3) ... [2022-12-13 07:20:40,175 INFO L112 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2022-12-13 07:20:40,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:20:40,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:20:40,190 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:20:40,286 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 07:20:40,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 189 transitions, 394 flow [2022-12-13 07:20:40,417 INFO L130 PetriNetUnfolder]: 14/187 cut-off events. [2022-12-13 07:20:40,418 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:20:40,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 14/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-13 07:20:40,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 189 transitions, 394 flow [2022-12-13 07:20:40,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 179 transitions, 370 flow [2022-12-13 07:20:40,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:40,438 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-13 07:20:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 179 transitions, 370 flow [2022-12-13 07:20:40,476 INFO L130 PetriNetUnfolder]: 14/179 cut-off events. [2022-12-13 07:20:40,477 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:20:40,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 14/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-13 07:20:40,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-13 07:20:40,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 7452 [2022-12-13 07:20:46,566 INFO L241 LiptonReduction]: Total number of compositions: 164 [2022-12-13 07:20:46,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:20:46,580 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;@6a6a7905, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:20:46,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 07:20:46,584 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 07:20:46,585 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:20:46,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:46,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:46,585 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:20:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2113518840, now seen corresponding path program 1 times [2022-12-13 07:20:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:46,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691261011] [2022-12-13 07:20:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:47,062 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:20:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691261011] [2022-12-13 07:20:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691261011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:47,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:47,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:20:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515412770] [2022-12-13 07:20:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:47,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:47,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:47,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:20:47,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:47,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:47,249 INFO L130 PetriNetUnfolder]: 64/119 cut-off events. [2022-12-13 07:20:47,249 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 07:20:47,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 119 events. 64/119 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 334 event pairs, 7 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 181. Up to 85 conditions per place. [2022-12-13 07:20:47,251 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 23 selfloop transitions, 5 changer transitions 5/35 dead transitions. [2022-12-13 07:20:47,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 35 transitions, 166 flow [2022-12-13 07:20:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 07:20:47,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 07:20:47,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 07:20:47,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 35 transitions, 166 flow [2022-12-13 07:20:47,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 30 transitions, 140 flow [2022-12-13 07:20:47,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:47,269 INFO L89 Accepts]: Start accepts. Operand has 23 places, 30 transitions, 140 flow [2022-12-13 07:20:47,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:47,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:47,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 30 transitions, 140 flow [2022-12-13 07:20:47,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 30 transitions, 140 flow [2022-12-13 07:20:47,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 07:20:47,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:47,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:20:47,283 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 30 transitions, 140 flow [2022-12-13 07:20:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:20:47,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:47,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:20:47,287 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:20:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1937234240, now seen corresponding path program 2 times [2022-12-13 07:20:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688775244] [2022-12-13 07:20:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:47,574 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:20:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:47,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688775244] [2022-12-13 07:20:47,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688775244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:47,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:47,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:20:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981397095] [2022-12-13 07:20:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:47,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:47,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 30 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:20:47,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:47,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:47,676 INFO L130 PetriNetUnfolder]: 63/111 cut-off events. [2022-12-13 07:20:47,677 INFO L131 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-12-13 07:20:47,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 111 events. 63/111 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 281 event pairs, 4 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 271. Up to 85 conditions per place. [2022-12-13 07:20:47,679 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 22 selfloop transitions, 6 changer transitions 5/35 dead transitions. [2022-12-13 07:20:47,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 35 transitions, 229 flow [2022-12-13 07:20:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 07:20:47,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-13 07:20:47,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-13 07:20:47,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 35 transitions, 229 flow [2022-12-13 07:20:47,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 30 transitions, 193 flow [2022-12-13 07:20:47,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:47,686 INFO L89 Accepts]: Start accepts. Operand has 26 places, 30 transitions, 193 flow [2022-12-13 07:20:47,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:47,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:47,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 30 transitions, 193 flow [2022-12-13 07:20:47,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 30 transitions, 193 flow [2022-12-13 07:20:47,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 07:20:47,691 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:47,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:20:47,693 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 30 transitions, 193 flow [2022-12-13 07:20:47,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:20:47,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:47,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:47,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:20:47,694 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:20:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash 274276736, now seen corresponding path program 1 times [2022-12-13 07:20:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216854065] [2022-12-13 07:20:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216854065] [2022-12-13 07:20:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216854065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201260012] [2022-12-13 07:20:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:47,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:47,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:20:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:47,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:47,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:47,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201260012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:47,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:47,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:20:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749637893] [2022-12-13 07:20:47,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:20:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:20:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:20:47,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:47,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 30 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 2.5) 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:20:47,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:47,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:47,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:48,096 INFO L130 PetriNetUnfolder]: 93/168 cut-off events. [2022-12-13 07:20:48,096 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 07:20:48,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 168 events. 93/168 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 503 event pairs, 5 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 528. Up to 113 conditions per place. [2022-12-13 07:20:48,097 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 50 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2022-12-13 07:20:48,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 07:20:48,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 07:20:48,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-13 07:20:48,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:48,102 INFO L89 Accepts]: Start accepts. Operand has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:48,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:48,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:48,105 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:48,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:20:48,105 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 56 transitions, 465 flow [2022-12-13 07:20:48,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) 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:20:48,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:48,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:48,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:48,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:48,325 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:20:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1141521254, now seen corresponding path program 2 times [2022-12-13 07:20:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:48,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248391526] [2022-12-13 07:20:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:48,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248391526] [2022-12-13 07:20:48,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248391526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:48,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086583022] [2022-12-13 07:20:48,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:20:48,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:48,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:48,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:48,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:20:48,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:20:48,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:48,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:48,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:48,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:48,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086583022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:48,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:48,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006290967] [2022-12-13 07:20:48,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:48,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:20:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:20:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:20:48,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:48,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 56 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:48,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:48,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:48,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:48,639 INFO L130 PetriNetUnfolder]: 130/241 cut-off events. [2022-12-13 07:20:48,639 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-13 07:20:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 241 events. 130/241 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 824 event pairs, 12 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 1020. Up to 177 conditions per place. [2022-12-13 07:20:48,643 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 78 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2022-12-13 07:20:48,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 07:20:48,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-13 07:20:48,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 07:20:48,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:48,650 INFO L89 Accepts]: Start accepts. Operand has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:48,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:48,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:48,654 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:48,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:20:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 92 transitions, 951 flow [2022-12-13 07:20:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:48,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:48,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:48,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:48,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 07:20:48,861 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:20:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -229843935, now seen corresponding path program 1 times [2022-12-13 07:20:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:48,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747276608] [2022-12-13 07:20:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747276608] [2022-12-13 07:20:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747276608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:48,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:48,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:20:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743742708] [2022-12-13 07:20:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:48,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:48,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:48,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 92 transitions, 951 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:48,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:48,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:48,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:48,985 INFO L130 PetriNetUnfolder]: 129/244 cut-off events. [2022-12-13 07:20:48,985 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-13 07:20:48,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 244 events. 129/244 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 860 event pairs, 12 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 1250. Up to 177 conditions per place. [2022-12-13 07:20:48,987 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 78 selfloop transitions, 11 changer transitions 10/99 dead transitions. [2022-12-13 07:20:48,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 99 transitions, 1218 flow [2022-12-13 07:20:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 07:20:48,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 07:20:48,991 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-13 07:20:48,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 99 transitions, 1218 flow [2022-12-13 07:20:48,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 89 transitions, 1093 flow [2022-12-13 07:20:48,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:48,994 INFO L89 Accepts]: Start accepts. Operand has 37 places, 89 transitions, 1093 flow [2022-12-13 07:20:48,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:48,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:48,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 89 transitions, 1093 flow [2022-12-13 07:20:48,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 89 transitions, 1093 flow [2022-12-13 07:20:48,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:48,997 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:48,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:20:48,998 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 89 transitions, 1093 flow [2022-12-13 07:20:48,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:48,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:49,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:49,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:20:49,000 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:20:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 17592907, now seen corresponding path program 2 times [2022-12-13 07:20:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:49,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926038088] [2022-12-13 07:20:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926038088] [2022-12-13 07:20:49,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926038088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714176988] [2022-12-13 07:20:49,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:20:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:49,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:49,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:49,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:20:49,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:20:49,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:49,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:49,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714176988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:49,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:49,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:20:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443132129] [2022-12-13 07:20:49,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:49,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:20:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:20:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:20:49,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:49,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 89 transitions, 1093 flow. Second operand has 8 states, 8 states have (on average 2.5) 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:20:49,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:49,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:49,236 INFO L130 PetriNetUnfolder]: 129/238 cut-off events. [2022-12-13 07:20:49,236 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-13 07:20:49,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 238 events. 129/238 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 807 event pairs, 4 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 1456. Up to 187 conditions per place. [2022-12-13 07:20:49,238 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 86 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2022-12-13 07:20:49,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 07:20:49,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 07:20:49,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-13 07:20:49,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:49,246 INFO L89 Accepts]: Start accepts. Operand has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:49,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:49,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:49,249 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:49,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:20:49,250 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 99 transitions, 1410 flow [2022-12-13 07:20:49,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) 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:20:49,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:49,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:49,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:49,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:49,455 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:20:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -417707974, now seen corresponding path program 3 times [2022-12-13 07:20:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124851500] [2022-12-13 07:20:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124851500] [2022-12-13 07:20:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124851500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41966617] [2022-12-13 07:20:49,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:20:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:49,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:49,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:20:49,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:20:49,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:49,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:49,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:49,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41966617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:49,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:49,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72360439] [2022-12-13 07:20:49,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:49,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:20:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:20:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:20:49,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:49,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 99 transitions, 1410 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:49,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:49,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:49,845 INFO L130 PetriNetUnfolder]: 131/246 cut-off events. [2022-12-13 07:20:49,846 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 07:20:49,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 246 events. 131/246 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 864 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 1733. Up to 195 conditions per place. [2022-12-13 07:20:49,849 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 86 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2022-12-13 07:20:49,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:20:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:20:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-13 07:20:49,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-13 07:20:49,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2022-12-13 07:20:49,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:49,857 INFO L89 Accepts]: Start accepts. Operand has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:49,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:49,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:49,860 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:49,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:20:49,860 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 104 transitions, 1691 flow [2022-12-13 07:20:49,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:49,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:49,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:49,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:50,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:50,066 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:20:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -333401792, now seen corresponding path program 4 times [2022-12-13 07:20:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984086684] [2022-12-13 07:20:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984086684] [2022-12-13 07:20:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984086684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:50,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:50,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:20:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135373017] [2022-12-13 07:20:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:50,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:50,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:50,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 104 transitions, 1691 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:50,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:50,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:50,181 INFO L130 PetriNetUnfolder]: 123/230 cut-off events. [2022-12-13 07:20:50,182 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-13 07:20:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 230 events. 123/230 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 780 event pairs, 0 based on Foata normal form. 6/188 useless extension candidates. Maximal degree in co-relation 1826. Up to 179 conditions per place. [2022-12-13 07:20:50,184 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 81 selfloop transitions, 13 changer transitions 6/100 dead transitions. [2022-12-13 07:20:50,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 1824 flow [2022-12-13 07:20:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:20:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:20:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 07:20:50,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 07:20:50,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 33 predicate places. [2022-12-13 07:20:50,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 100 transitions, 1824 flow [2022-12-13 07:20:50,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 94 transitions, 1713 flow [2022-12-13 07:20:50,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:50,190 INFO L89 Accepts]: Start accepts. Operand has 52 places, 94 transitions, 1713 flow [2022-12-13 07:20:50,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:50,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:50,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 94 transitions, 1713 flow [2022-12-13 07:20:50,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 94 transitions, 1713 flow [2022-12-13 07:20:50,193 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:50,193 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:50,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:20:50,194 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 94 transitions, 1713 flow [2022-12-13 07:20:50,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:50,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:50,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:20:50,195 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:20:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 552912597, now seen corresponding path program 3 times [2022-12-13 07:20:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:50,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464521213] [2022-12-13 07:20:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464521213] [2022-12-13 07:20:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464521213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140427730] [2022-12-13 07:20:50,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:20:50,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:50,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:50,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:20:50,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:20:50,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:50,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:50,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140427730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:50,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:50,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:50,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620942218] [2022-12-13 07:20:50,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:50,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:20:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:20:50,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:20:50,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:50,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 94 transitions, 1713 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:50,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:50,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:50,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:50,418 INFO L130 PetriNetUnfolder]: 127/232 cut-off events. [2022-12-13 07:20:50,418 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 07:20:50,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 232 events. 127/232 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 758 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 2051. Up to 189 conditions per place. [2022-12-13 07:20:50,420 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 86 selfloop transitions, 12 changer transitions 0/98 dead transitions. [2022-12-13 07:20:50,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 07:20:50,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 07:20:50,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 07:20:50,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:50,426 INFO L89 Accepts]: Start accepts. Operand has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:50,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:50,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:50,432 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:50,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:20:50,433 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 98 transitions, 1981 flow [2022-12-13 07:20:50,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:50,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:50,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:50,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:50,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:50,637 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:20:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -790822856, now seen corresponding path program 5 times [2022-12-13 07:20:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:50,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134022197] [2022-12-13 07:20:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:50,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134022197] [2022-12-13 07:20:50,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134022197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:50,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:20:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574696647] [2022-12-13 07:20:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:50,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:50,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:50,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 98 transitions, 1981 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:50,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:50,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:50,748 INFO L130 PetriNetUnfolder]: 126/233 cut-off events. [2022-12-13 07:20:50,748 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 07:20:50,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 233 events. 126/233 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 772 event pairs, 0 based on Foata normal form. 2/189 useless extension candidates. Maximal degree in co-relation 2270. Up to 189 conditions per place. [2022-12-13 07:20:50,750 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 89 selfloop transitions, 12 changer transitions 4/105 dead transitions. [2022-12-13 07:20:50,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 2330 flow [2022-12-13 07:20:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 07:20:50,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-13 07:20:50,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-13 07:20:50,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 105 transitions, 2330 flow [2022-12-13 07:20:50,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 101 transitions, 2246 flow [2022-12-13 07:20:50,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:50,757 INFO L89 Accepts]: Start accepts. Operand has 59 places, 101 transitions, 2246 flow [2022-12-13 07:20:50,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:50,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:50,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 101 transitions, 2246 flow [2022-12-13 07:20:50,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 101 transitions, 2246 flow [2022-12-13 07:20:50,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:50,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:50,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:20:50,760 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 101 transitions, 2246 flow [2022-12-13 07:20:50,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:50,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:50,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:20:50,760 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:20:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1225827436, now seen corresponding path program 6 times [2022-12-13 07:20:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428937110] [2022-12-13 07:20:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:50,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428937110] [2022-12-13 07:20:50,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428937110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:20:50,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:20:50,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:20:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736979347] [2022-12-13 07:20:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:20:50,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:20:50,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:20:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:20:50,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:50,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 101 transitions, 2246 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:50,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:50,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:50,892 INFO L130 PetriNetUnfolder]: 116/211 cut-off events. [2022-12-13 07:20:50,892 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-13 07:20:50,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2528 conditions, 211 events. 116/211 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 668 event pairs, 0 based on Foata normal form. 6/175 useless extension candidates. Maximal degree in co-relation 2242. Up to 173 conditions per place. [2022-12-13 07:20:50,894 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 74 selfloop transitions, 12 changer transitions 6/92 dead transitions. [2022-12-13 07:20:50,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 2226 flow [2022-12-13 07:20:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:20:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:20:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-13 07:20:50,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-13 07:20:50,895 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 43 predicate places. [2022-12-13 07:20:50,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 92 transitions, 2226 flow [2022-12-13 07:20:50,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 86 transitions, 2079 flow [2022-12-13 07:20:50,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:50,899 INFO L89 Accepts]: Start accepts. Operand has 59 places, 86 transitions, 2079 flow [2022-12-13 07:20:50,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:50,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:50,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 86 transitions, 2079 flow [2022-12-13 07:20:50,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 86 transitions, 2079 flow [2022-12-13 07:20:50,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:50,901 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:50,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:20:50,902 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 86 transitions, 2079 flow [2022-12-13 07:20:50,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:20:50,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:50,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:50,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 07:20:50,903 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:20:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2112141825, now seen corresponding path program 4 times [2022-12-13 07:20:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:50,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999847445] [2022-12-13 07:20:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:50,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999847445] [2022-12-13 07:20:50,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999847445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:50,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885438637] [2022-12-13 07:20:50,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:20:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:50,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:50,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:20:51,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:20:51,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:20:51,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:51,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:51,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885438637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:51,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:51,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858692091] [2022-12-13 07:20:51,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:51,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:20:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:20:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:20:51,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:51,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 86 transitions, 2079 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:51,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:51,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:51,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:51,148 INFO L130 PetriNetUnfolder]: 110/193 cut-off events. [2022-12-13 07:20:51,148 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-13 07:20:51,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 193 events. 110/193 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 576 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 2220. Up to 163 conditions per place. [2022-12-13 07:20:51,151 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 65 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2022-12-13 07:20:51,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:20:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:20:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-12-13 07:20:51,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 07:20:51,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2022-12-13 07:20:51,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:51,156 INFO L89 Accepts]: Start accepts. Operand has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:51,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:51,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:51,158 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:51,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:20:51,159 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 82 transitions, 2141 flow [2022-12-13 07:20:51,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:20:51,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:51,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:51,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:51,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:51,367 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:20:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1920760145, now seen corresponding path program 1 times [2022-12-13 07:20:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:51,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598858078] [2022-12-13 07:20:51,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598858078] [2022-12-13 07:20:51,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598858078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122397454] [2022-12-13 07:20:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:51,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:51,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:51,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:51,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:20:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:51,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:51,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:51,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:51,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122397454] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:51,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:51,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435541903] [2022-12-13 07:20:51,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:51,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:20:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:20:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:20:51,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:51,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 82 transitions, 2141 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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:20:51,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:51,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:51,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:52,126 INFO L130 PetriNetUnfolder]: 152/272 cut-off events. [2022-12-13 07:20:52,126 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-13 07:20:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 272 events. 152/272 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 934 event pairs, 4 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 3343. Up to 236 conditions per place. [2022-12-13 07:20:52,129 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 92 selfloop transitions, 22 changer transitions 5/125 dead transitions. [2022-12-13 07:20:52,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 3524 flow [2022-12-13 07:20:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-13 07:20:52,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-13 07:20:52,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 50 predicate places. [2022-12-13 07:20:52,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 125 transitions, 3524 flow [2022-12-13 07:20:52,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 120 transitions, 3378 flow [2022-12-13 07:20:52,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:52,138 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 3378 flow [2022-12-13 07:20:52,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:52,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:52,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 3378 flow [2022-12-13 07:20:52,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 3378 flow [2022-12-13 07:20:52,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:52,143 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:52,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:20:52,144 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 3378 flow [2022-12-13 07:20:52,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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:20:52,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:52,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:52,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:52,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:52,350 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:20:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1138003613, now seen corresponding path program 2 times [2022-12-13 07:20:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646819913] [2022-12-13 07:20:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646819913] [2022-12-13 07:20:52,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646819913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562677641] [2022-12-13 07:20:52,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:20:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:52,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:52,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:20:52,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:20:52,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:52,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:52,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:52,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:52,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562677641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:52,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:52,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:20:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110252498] [2022-12-13 07:20:52,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:52,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:20:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:52,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:20:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:20:52,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:52,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 3378 flow. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:20:52,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:52,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:52,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:52,981 INFO L130 PetriNetUnfolder]: 164/298 cut-off events. [2022-12-13 07:20:52,981 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2022-12-13 07:20:52,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 298 events. 164/298 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1070 event pairs, 0 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 3924. Up to 262 conditions per place. [2022-12-13 07:20:52,986 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 105 selfloop transitions, 22 changer transitions 5/138 dead transitions. [2022-12-13 07:20:52,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 4161 flow [2022-12-13 07:20:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-13 07:20:52,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2022-12-13 07:20:52,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2022-12-13 07:20:52,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 138 transitions, 4161 flow [2022-12-13 07:20:53,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 133 transitions, 4005 flow [2022-12-13 07:20:53,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:53,005 INFO L89 Accepts]: Start accepts. Operand has 74 places, 133 transitions, 4005 flow [2022-12-13 07:20:53,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:53,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:53,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 133 transitions, 4005 flow [2022-12-13 07:20:53,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 133 transitions, 4005 flow [2022-12-13 07:20:53,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:53,009 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:53,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:20:53,009 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 133 transitions, 4005 flow [2022-12-13 07:20:53,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:20:53,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:53,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:53,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:53,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 07:20:53,210 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:20:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1403383763, now seen corresponding path program 3 times [2022-12-13 07:20:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:53,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029495213] [2022-12-13 07:20:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:53,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029495213] [2022-12-13 07:20:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029495213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414750337] [2022-12-13 07:20:53,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:20:53,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:53,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:53,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:53,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:20:53,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:20:53,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:53,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:53,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:53,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414750337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:53,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:53,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 07:20:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845162956] [2022-12-13 07:20:53,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:53,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:20:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:20:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:20:53,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:53,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 133 transitions, 4005 flow. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 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:20:53,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:53,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:53,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:53,936 INFO L130 PetriNetUnfolder]: 163/291 cut-off events. [2022-12-13 07:20:53,936 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 07:20:53,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4574 conditions, 291 events. 163/291 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1026 event pairs, 0 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 4086. Up to 255 conditions per place. [2022-12-13 07:20:53,940 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 102 selfloop transitions, 23 changer transitions 5/136 dead transitions. [2022-12-13 07:20:53,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 4355 flow [2022-12-13 07:20:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-13 07:20:53,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-13 07:20:53,941 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 60 predicate places. [2022-12-13 07:20:53,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 136 transitions, 4355 flow [2022-12-13 07:20:53,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 131 transitions, 4189 flow [2022-12-13 07:20:53,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:53,950 INFO L89 Accepts]: Start accepts. Operand has 79 places, 131 transitions, 4189 flow [2022-12-13 07:20:53,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:53,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:53,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 131 transitions, 4189 flow [2022-12-13 07:20:53,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 131 transitions, 4189 flow [2022-12-13 07:20:53,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:53,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:53,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:20:53,955 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 131 transitions, 4189 flow [2022-12-13 07:20:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 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:20:53,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:53,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:53,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:54,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:20:54,162 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:20:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash 512280785, now seen corresponding path program 4 times [2022-12-13 07:20:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:54,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970841667] [2022-12-13 07:20:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:54,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970841667] [2022-12-13 07:20:54,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970841667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:54,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926222329] [2022-12-13 07:20:54,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:20:54,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:54,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:54,400 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:54,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:20:54,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:20:54,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:54,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:54,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:54,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:54,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926222329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:54,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:54,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 07:20:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421596129] [2022-12-13 07:20:54,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:54,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:20:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:20:54,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:20:54,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:54,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 131 transitions, 4189 flow. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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:20:54,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:54,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:54,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:54,844 INFO L130 PetriNetUnfolder]: 186/332 cut-off events. [2022-12-13 07:20:54,845 INFO L131 PetriNetUnfolder]: For 1137/1137 co-relation queries the response was YES. [2022-12-13 07:20:54,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 332 events. 186/332 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1234 event pairs, 4 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 4997. Up to 292 conditions per place. [2022-12-13 07:20:54,850 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 127 selfloop transitions, 22 changer transitions 5/160 dead transitions. [2022-12-13 07:20:54,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 5431 flow [2022-12-13 07:20:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-12-13 07:20:54,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-13 07:20:54,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 65 predicate places. [2022-12-13 07:20:54,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 160 transitions, 5431 flow [2022-12-13 07:20:54,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 155 transitions, 5255 flow [2022-12-13 07:20:54,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:54,865 INFO L89 Accepts]: Start accepts. Operand has 84 places, 155 transitions, 5255 flow [2022-12-13 07:20:54,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:54,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:54,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 155 transitions, 5255 flow [2022-12-13 07:20:54,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 155 transitions, 5255 flow [2022-12-13 07:20:54,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:54,872 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:54,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:20:54,873 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 155 transitions, 5255 flow [2022-12-13 07:20:54,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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:20:54,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:54,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:54,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:20:55,079 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:20:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 511091493, now seen corresponding path program 5 times [2022-12-13 07:20:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390045973] [2022-12-13 07:20:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:55,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390045973] [2022-12-13 07:20:55,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390045973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:55,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051919290] [2022-12-13 07:20:55,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:20:55,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:55,419 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:55,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:20:55,492 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:20:55,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:55,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:55,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:55,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:55,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051919290] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:55,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-13 07:20:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031935738] [2022-12-13 07:20:55,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:55,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:20:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:55,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:20:55,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:20:55,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:20:55,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 155 transitions, 5255 flow. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:20:55,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:55,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:20:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:55,870 INFO L130 PetriNetUnfolder]: 200/360 cut-off events. [2022-12-13 07:20:55,870 INFO L131 PetriNetUnfolder]: For 1541/1541 co-relation queries the response was YES. [2022-12-13 07:20:55,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6323 conditions, 360 events. 200/360 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1374 event pairs, 0 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 5742. Up to 320 conditions per place. [2022-12-13 07:20:55,873 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 140 selfloop transitions, 22 changer transitions 5/173 dead transitions. [2022-12-13 07:20:55,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 173 transitions, 6216 flow [2022-12-13 07:20:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-13 07:20:55,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-13 07:20:55,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 70 predicate places. [2022-12-13 07:20:55,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 173 transitions, 6216 flow [2022-12-13 07:20:55,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 168 transitions, 6030 flow [2022-12-13 07:20:55,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:55,879 INFO L89 Accepts]: Start accepts. Operand has 89 places, 168 transitions, 6030 flow [2022-12-13 07:20:55,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:55,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:55,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 168 transitions, 6030 flow [2022-12-13 07:20:55,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 168 transitions, 6030 flow [2022-12-13 07:20:55,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:55,884 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:55,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:20:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 168 transitions, 6030 flow [2022-12-13 07:20:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:20:55,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:55,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:55,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 07:20:56,090 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:20:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 245711343, now seen corresponding path program 6 times [2022-12-13 07:20:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947872593] [2022-12-13 07:20:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:56,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:56,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947872593] [2022-12-13 07:20:56,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947872593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:56,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658027156] [2022-12-13 07:20:56,385 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:20:56,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:56,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:56,386 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:56,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:20:56,452 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:20:56,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:56,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 07:20:56,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:56,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:56,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658027156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:56,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2022-12-13 07:20:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936942172] [2022-12-13 07:20:56,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:20:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:20:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:20:56,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 07:20:56,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 168 transitions, 6030 flow. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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:20:56,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:56,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 07:20:56,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:56,851 INFO L130 PetriNetUnfolder]: 199/353 cut-off events. [2022-12-13 07:20:56,851 INFO L131 PetriNetUnfolder]: For 1752/1752 co-relation queries the response was YES. [2022-12-13 07:20:56,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6535 conditions, 353 events. 199/353 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1345 event pairs, 0 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 5963. Up to 313 conditions per place. [2022-12-13 07:20:56,854 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 138 selfloop transitions, 25 changer transitions 5/171 dead transitions. [2022-12-13 07:20:56,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 6474 flow [2022-12-13 07:20:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:20:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:20:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-12-13 07:20:56,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-13 07:20:56,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-13 07:20:56,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 171 transitions, 6474 flow [2022-12-13 07:20:56,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 166 transitions, 6278 flow [2022-12-13 07:20:56,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:56,860 INFO L89 Accepts]: Start accepts. Operand has 95 places, 166 transitions, 6278 flow [2022-12-13 07:20:56,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:56,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:56,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 166 transitions, 6278 flow [2022-12-13 07:20:56,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 166 transitions, 6278 flow [2022-12-13 07:20:56,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:56,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:56,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:20:56,865 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 166 transitions, 6278 flow [2022-12-13 07:20:56,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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:20:56,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:56,865 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:56,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:57,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:20:57,070 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:20:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1495412193, now seen corresponding path program 7 times [2022-12-13 07:20:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:57,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148305236] [2022-12-13 07:20:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148305236] [2022-12-13 07:20:57,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148305236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567387442] [2022-12-13 07:20:57,117 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:20:57,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:57,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:20:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:57,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:20:57,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567387442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:57,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:57,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:20:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920986631] [2022-12-13 07:20:57,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:57,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:20:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:20:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:20:57,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:57,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 166 transitions, 6278 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:20:57,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:57,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:57,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:57,415 INFO L130 PetriNetUnfolder]: 228/403 cut-off events. [2022-12-13 07:20:57,416 INFO L131 PetriNetUnfolder]: For 1759/1759 co-relation queries the response was YES. [2022-12-13 07:20:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 403 events. 228/403 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1569 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 7270. Up to 363 conditions per place. [2022-12-13 07:20:57,419 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 158 selfloop transitions, 30 changer transitions 0/188 dead transitions. [2022-12-13 07:20:57,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:20:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:20:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-13 07:20:57,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 07:20:57,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 81 predicate places. [2022-12-13 07:20:57,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:57,426 INFO L89 Accepts]: Start accepts. Operand has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:57,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:57,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:57,432 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:57,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:20:57,432 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 188 transitions, 7488 flow [2022-12-13 07:20:57,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:20:57,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:57,432 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:57,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:57,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:57,638 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:20:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 586493152, now seen corresponding path program 8 times [2022-12-13 07:20:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:57,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167160873] [2022-12-13 07:20:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167160873] [2022-12-13 07:20:57,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167160873] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585663547] [2022-12-13 07:20:57,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:20:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:57,691 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:57,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:20:57,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:20:57,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:57,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:20:57,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:57,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585663547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:57,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:57,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:20:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531315109] [2022-12-13 07:20:57,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:20:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:20:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:20:57,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:57,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 188 transitions, 7488 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:20:57,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:57,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:57,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:58,040 INFO L130 PetriNetUnfolder]: 230/413 cut-off events. [2022-12-13 07:20:58,040 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2022-12-13 07:20:58,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8508 conditions, 413 events. 230/413 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1663 event pairs, 0 based on Foata normal form. 4/345 useless extension candidates. Maximal degree in co-relation 7855. Up to 373 conditions per place. [2022-12-13 07:20:58,043 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 153 selfloop transitions, 53 changer transitions 14/220 dead transitions. [2022-12-13 07:20:58,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 9190 flow [2022-12-13 07:20:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:20:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:20:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-12-13 07:20:58,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2022-12-13 07:20:58,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 91 predicate places. [2022-12-13 07:20:58,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 220 transitions, 9190 flow [2022-12-13 07:20:58,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 206 transitions, 8604 flow [2022-12-13 07:20:58,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:58,051 INFO L89 Accepts]: Start accepts. Operand has 109 places, 206 transitions, 8604 flow [2022-12-13 07:20:58,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:58,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:58,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 206 transitions, 8604 flow [2022-12-13 07:20:58,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 206 transitions, 8604 flow [2022-12-13 07:20:58,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:58,059 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:58,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:20:58,059 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 206 transitions, 8604 flow [2022-12-13 07:20:58,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:20:58,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:58,059 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:58,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:58,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:58,264 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:20:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -554708190, now seen corresponding path program 9 times [2022-12-13 07:20:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:58,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393725314] [2022-12-13 07:20:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393725314] [2022-12-13 07:20:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393725314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552124379] [2022-12-13 07:20:58,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:20:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:58,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:58,313 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:58,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 07:20:58,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:20:58,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:58,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:20:58,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:58,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:58,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552124379] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:58,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:58,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:20:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97748292] [2022-12-13 07:20:58,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:58,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:20:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:20:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:20:58,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:58,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 206 transitions, 8604 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:20:58,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:58,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:58,773 INFO L130 PetriNetUnfolder]: 291/536 cut-off events. [2022-12-13 07:20:58,773 INFO L131 PetriNetUnfolder]: For 1415/1415 co-relation queries the response was YES. [2022-12-13 07:20:58,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 536 events. 291/536 cut-off events. For 1415/1415 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2366 event pairs, 0 based on Foata normal form. 8/438 useless extension candidates. Maximal degree in co-relation 10893. Up to 500 conditions per place. [2022-12-13 07:20:58,777 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 208 selfloop transitions, 73 changer transitions 8/289 dead transitions. [2022-12-13 07:20:58,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 289 transitions, 12716 flow [2022-12-13 07:20:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:20:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:20:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2022-12-13 07:20:58,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2022-12-13 07:20:58,779 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2022-12-13 07:20:58,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 289 transitions, 12716 flow [2022-12-13 07:20:58,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 281 transitions, 12358 flow [2022-12-13 07:20:58,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:58,788 INFO L89 Accepts]: Start accepts. Operand has 126 places, 281 transitions, 12358 flow [2022-12-13 07:20:58,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:58,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:58,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 281 transitions, 12358 flow [2022-12-13 07:20:58,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 281 transitions, 12358 flow [2022-12-13 07:20:58,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:58,796 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:58,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:20:58,797 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 281 transitions, 12358 flow [2022-12-13 07:20:58,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:20:58,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:58,797 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:58,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:59,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:59,002 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:20:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 132119650, now seen corresponding path program 10 times [2022-12-13 07:20:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:59,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441469803] [2022-12-13 07:20:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:59,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441469803] [2022-12-13 07:20:59,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441469803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836708904] [2022-12-13 07:20:59,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:20:59,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:59,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:59,053 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:59,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:20:59,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:20:59,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:59,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:20:59,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836708904] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:59,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:59,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:20:59,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678535851] [2022-12-13 07:20:59,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:59,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:20:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:20:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:20:59,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:59,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 281 transitions, 12358 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:20:59,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:59,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:59,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:59,519 INFO L130 PetriNetUnfolder]: 281/516 cut-off events. [2022-12-13 07:20:59,519 INFO L131 PetriNetUnfolder]: For 1406/1406 co-relation queries the response was YES. [2022-12-13 07:20:59,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11741 conditions, 516 events. 281/516 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2228 event pairs, 0 based on Foata normal form. 4/420 useless extension candidates. Maximal degree in co-relation 10932. Up to 480 conditions per place. [2022-12-13 07:20:59,525 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 195 selfloop transitions, 69 changer transitions 13/277 dead transitions. [2022-12-13 07:20:59,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 277 transitions, 12733 flow [2022-12-13 07:20:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:20:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:20:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 92 transitions. [2022-12-13 07:20:59,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2022-12-13 07:20:59,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 123 predicate places. [2022-12-13 07:20:59,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 277 transitions, 12733 flow [2022-12-13 07:20:59,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 264 transitions, 12126 flow [2022-12-13 07:20:59,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:20:59,540 INFO L89 Accepts]: Start accepts. Operand has 141 places, 264 transitions, 12126 flow [2022-12-13 07:20:59,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:20:59,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:20:59,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 264 transitions, 12126 flow [2022-12-13 07:20:59,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 264 transitions, 12126 flow [2022-12-13 07:20:59,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:20:59,549 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:20:59,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:20:59,550 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 264 transitions, 12126 flow [2022-12-13 07:20:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:20:59,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:20:59,550 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:20:59,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:59,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 07:20:59,756 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:20:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:20:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 519800216, now seen corresponding path program 11 times [2022-12-13 07:20:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:20:59,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107311604] [2022-12-13 07:20:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:20:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:20:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:20:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:20:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107311604] [2022-12-13 07:20:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107311604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:20:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050684152] [2022-12-13 07:20:59,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:20:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:20:59,836 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:20:59,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:20:59,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:20:59,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:20:59,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:20:59,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:20:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:20:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:20:59,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050684152] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:20:59,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:20:59,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:20:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740052253] [2022-12-13 07:20:59,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:20:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:20:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:20:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:20:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:20:59,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:20:59,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 264 transitions, 12126 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:20:59,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:20:59,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:20:59,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:00,228 INFO L130 PetriNetUnfolder]: 283/528 cut-off events. [2022-12-13 07:21:00,229 INFO L131 PetriNetUnfolder]: For 1411/1411 co-relation queries the response was YES. [2022-12-13 07:21:00,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12547 conditions, 528 events. 283/528 cut-off events. For 1411/1411 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2292 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 11605. Up to 492 conditions per place. [2022-12-13 07:21:00,234 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 225 selfloop transitions, 57 changer transitions 0/282 dead transitions. [2022-12-13 07:21:00,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:21:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:21:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2022-12-13 07:21:00,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-13 07:21:00,235 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 132 predicate places. [2022-12-13 07:21:00,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:00,247 INFO L89 Accepts]: Start accepts. Operand has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:00,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:00,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:00,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:00,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:21:00,258 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 282 transitions, 13530 flow [2022-12-13 07:21:00,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:21:00,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:00,258 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:00,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:00,464 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:21:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash -366514173, now seen corresponding path program 12 times [2022-12-13 07:21:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046775932] [2022-12-13 07:21:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:00,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046775932] [2022-12-13 07:21:00,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046775932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268301021] [2022-12-13 07:21:00,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:00,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:00,514 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:00,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:21:00,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:21:00,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:00,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:00,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:00,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:00,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268301021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:00,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:00,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712949397] [2022-12-13 07:21:00,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:00,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:00,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:00,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 282 transitions, 13530 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:00,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:00,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:01,092 INFO L130 PetriNetUnfolder]: 389/748 cut-off events. [2022-12-13 07:21:01,092 INFO L131 PetriNetUnfolder]: For 1452/1452 co-relation queries the response was YES. [2022-12-13 07:21:01,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18601 conditions, 748 events. 389/748 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3689 event pairs, 0 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 17212. Up to 712 conditions per place. [2022-12-13 07:21:01,100 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 338 selfloop transitions, 104 changer transitions 2/444 dead transitions. [2022-12-13 07:21:01,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 444 transitions, 22258 flow [2022-12-13 07:21:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 07:21:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 07:21:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-12-13 07:21:01,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 07:21:01,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2022-12-13 07:21:01,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 444 transitions, 22258 flow [2022-12-13 07:21:01,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 442 transitions, 22158 flow [2022-12-13 07:21:01,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:01,121 INFO L89 Accepts]: Start accepts. Operand has 171 places, 442 transitions, 22158 flow [2022-12-13 07:21:01,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:01,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:01,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 442 transitions, 22158 flow [2022-12-13 07:21:01,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 442 transitions, 22158 flow [2022-12-13 07:21:01,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:01,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:01,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 07:21:01,140 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 442 transitions, 22158 flow [2022-12-13 07:21:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:01,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:01,141 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:01,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:01,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:01,346 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:21:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -633083615, now seen corresponding path program 13 times [2022-12-13 07:21:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684072048] [2022-12-13 07:21:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:01,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:01,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684072048] [2022-12-13 07:21:01,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684072048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:01,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777020525] [2022-12-13 07:21:01,399 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:01,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:01,400 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:01,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 07:21:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:01,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:01,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:01,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:01,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777020525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:01,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:01,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574894634] [2022-12-13 07:21:01,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:01,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:01,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:01,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 442 transitions, 22158 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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:21:01,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:01,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:01,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:01,959 INFO L130 PetriNetUnfolder]: 384/735 cut-off events. [2022-12-13 07:21:01,959 INFO L131 PetriNetUnfolder]: For 1545/1545 co-relation queries the response was YES. [2022-12-13 07:21:01,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19011 conditions, 735 events. 384/735 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3618 event pairs, 0 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 17726. Up to 699 conditions per place. [2022-12-13 07:21:01,966 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 368 selfloop transitions, 70 changer transitions 0/438 dead transitions. [2022-12-13 07:21:01,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:21:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:21:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-12-13 07:21:01,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2022-12-13 07:21:01,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 162 predicate places. [2022-12-13 07:21:01,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:01,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:02,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:02,005 INFO L89 Accepts]: Start accepts. Operand has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:02,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:02,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:02,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:02,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:02,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:02,021 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:02,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:21:02,021 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 438 transitions, 22831 flow [2022-12-13 07:21:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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:21:02,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:02,022 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:02,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:02,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:02,227 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:21:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash -784173439, now seen corresponding path program 14 times [2022-12-13 07:21:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:02,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818579770] [2022-12-13 07:21:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:02,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818579770] [2022-12-13 07:21:02,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818579770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75372262] [2022-12-13 07:21:02,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:02,278 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:02,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 07:21:02,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:02,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:02,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:02,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:21:02,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75372262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:02,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:21:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382546634] [2022-12-13 07:21:02,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:02,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:02,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 438 transitions, 22831 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:02,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:02,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:03,038 INFO L130 PetriNetUnfolder]: 491/984 cut-off events. [2022-12-13 07:21:03,039 INFO L131 PetriNetUnfolder]: For 1591/1591 co-relation queries the response was YES. [2022-12-13 07:21:03,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26502 conditions, 984 events. 491/984 cut-off events. For 1591/1591 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5482 event pairs, 0 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 24508. Up to 948 conditions per place. [2022-12-13 07:21:03,048 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 461 selfloop transitions, 139 changer transitions 2/602 dead transitions. [2022-12-13 07:21:03,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 602 transitions, 32659 flow [2022-12-13 07:21:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:21:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:21:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-12-13 07:21:03,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2022-12-13 07:21:03,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 182 predicate places. [2022-12-13 07:21:03,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 602 transitions, 32659 flow [2022-12-13 07:21:03,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 600 transitions, 32551 flow [2022-12-13 07:21:03,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:03,074 INFO L89 Accepts]: Start accepts. Operand has 202 places, 600 transitions, 32551 flow [2022-12-13 07:21:03,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:03,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:03,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 600 transitions, 32551 flow [2022-12-13 07:21:03,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 600 transitions, 32551 flow [2022-12-13 07:21:03,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:03,101 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:03,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 07:21:03,102 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 600 transitions, 32551 flow [2022-12-13 07:21:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:03,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:03,102 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:03,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:03,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 07:21:03,307 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:21:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1050742881, now seen corresponding path program 15 times [2022-12-13 07:21:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:03,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823409903] [2022-12-13 07:21:03,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:03,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823409903] [2022-12-13 07:21:03,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823409903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:03,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329042979] [2022-12-13 07:21:03,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:03,418 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:03,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 07:21:03,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:21:03,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:03,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:03,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329042979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:03,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:03,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:21:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927361782] [2022-12-13 07:21:03,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:03,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:03,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:03,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 600 transitions, 32551 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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:21:03,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:03,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:04,205 INFO L130 PetriNetUnfolder]: 562/1121 cut-off events. [2022-12-13 07:21:04,205 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2022-12-13 07:21:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31337 conditions, 1121 events. 562/1121 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6446 event pairs, 0 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 29213. Up to 1085 conditions per place. [2022-12-13 07:21:04,215 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 558 selfloop transitions, 124 changer transitions 0/682 dead transitions. [2022-12-13 07:21:04,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:21:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:21:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2022-12-13 07:21:04,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2022-12-13 07:21:04,217 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 195 predicate places. [2022-12-13 07:21:04,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:04,245 INFO L89 Accepts]: Start accepts. Operand has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:04,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:04,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:04,274 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:04,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 07:21:04,274 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 682 transitions, 38385 flow [2022-12-13 07:21:04,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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:21:04,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:04,275 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:04,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 07:21:04,480 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash -747305387, now seen corresponding path program 16 times [2022-12-13 07:21:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426031034] [2022-12-13 07:21:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426031034] [2022-12-13 07:21:04,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426031034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272062598] [2022-12-13 07:21:04,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:04,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:04,576 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:04,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 07:21:04,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:04,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:04,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:04,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:04,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272062598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:04,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:04,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 07:21:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463996656] [2022-12-13 07:21:04,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:04,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:04,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:04,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 682 transitions, 38385 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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:21:04,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:04,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:04,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:05,349 INFO L130 PetriNetUnfolder]: 626/1251 cut-off events. [2022-12-13 07:21:05,350 INFO L131 PetriNetUnfolder]: For 1530/1530 co-relation queries the response was YES. [2022-12-13 07:21:05,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36242 conditions, 1251 events. 626/1251 cut-off events. For 1530/1530 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7346 event pairs, 0 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 33807. Up to 1215 conditions per place. [2022-12-13 07:21:05,361 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 580 selfloop transitions, 178 changer transitions 4/762 dead transitions. [2022-12-13 07:21:05,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 762 transitions, 44428 flow [2022-12-13 07:21:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 07:21:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 07:21:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 98 transitions. [2022-12-13 07:21:05,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2022-12-13 07:21:05,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 214 predicate places. [2022-12-13 07:21:05,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 762 transitions, 44428 flow [2022-12-13 07:21:05,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 758 transitions, 44196 flow [2022-12-13 07:21:05,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:05,403 INFO L89 Accepts]: Start accepts. Operand has 232 places, 758 transitions, 44196 flow [2022-12-13 07:21:05,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:05,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:05,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 758 transitions, 44196 flow [2022-12-13 07:21:05,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 758 transitions, 44196 flow [2022-12-13 07:21:05,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:05,433 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:05,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 07:21:05,436 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 758 transitions, 44196 flow [2022-12-13 07:21:05,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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:21:05,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:05,436 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:05,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 07:21:05,641 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1514283212, now seen corresponding path program 17 times [2022-12-13 07:21:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:05,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013605749] [2022-12-13 07:21:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:05,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:05,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013605749] [2022-12-13 07:21:05,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013605749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:05,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125447467] [2022-12-13 07:21:05,731 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:21:05,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:05,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:05,733 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:05,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 07:21:05,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:05,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:05,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:05,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:05,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:05,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125447467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:05,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:05,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:21:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183003598] [2022-12-13 07:21:05,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:05,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:21:05,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:21:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:21:05,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:05,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 758 transitions, 44196 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:21:05,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:05,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:05,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:06,403 INFO L130 PetriNetUnfolder]: 661/1324 cut-off events. [2022-12-13 07:21:06,403 INFO L131 PetriNetUnfolder]: For 1728/1728 co-relation queries the response was YES. [2022-12-13 07:21:06,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39692 conditions, 1324 events. 661/1324 cut-off events. For 1728/1728 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7932 event pairs, 0 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 36991. Up to 1288 conditions per place. [2022-12-13 07:21:06,415 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 731 selfloop transitions, 79 changer transitions 0/810 dead transitions. [2022-12-13 07:21:06,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-13 07:21:06,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2022-12-13 07:21:06,416 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 218 predicate places. [2022-12-13 07:21:06,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:06,451 INFO L89 Accepts]: Start accepts. Operand has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:06,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:06,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:06,482 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:06,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 07:21:06,483 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 810 transitions, 48824 flow [2022-12-13 07:21:06,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:21:06,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:06,483 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:06,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 07:21:06,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:06,688 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash 310788811, now seen corresponding path program 18 times [2022-12-13 07:21:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:06,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704142126] [2022-12-13 07:21:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704142126] [2022-12-13 07:21:06,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704142126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52703657] [2022-12-13 07:21:06,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:06,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:06,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:06,785 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:06,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 07:21:06,872 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:21:06,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:06,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:06,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:06,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52703657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:06,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 07:21:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808900434] [2022-12-13 07:21:06,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:06,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:06,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 810 transitions, 48824 flow. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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:21:06,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:06,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:06,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:07,849 INFO L130 PetriNetUnfolder]: 749/1506 cut-off events. [2022-12-13 07:21:07,850 INFO L131 PetriNetUnfolder]: For 1669/1669 co-relation queries the response was YES. [2022-12-13 07:21:07,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46678 conditions, 1506 events. 749/1506 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9339 event pairs, 0 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 43573. Up to 1470 conditions per place. [2022-12-13 07:21:07,922 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 860 selfloop transitions, 64 changer transitions 0/924 dead transitions. [2022-12-13 07:21:07,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:21:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:21:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2022-12-13 07:21:07,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4717948717948718 [2022-12-13 07:21:07,926 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 230 predicate places. [2022-12-13 07:21:07,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:07,967 INFO L89 Accepts]: Start accepts. Operand has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:07,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:07,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:07,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:08,000 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:08,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 07:21:08,001 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 924 transitions, 57569 flow [2022-12-13 07:21:08,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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:21:08,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:08,001 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:08,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 07:21:08,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:08,202 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1554540310, now seen corresponding path program 19 times [2022-12-13 07:21:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:08,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193612397] [2022-12-13 07:21:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193612397] [2022-12-13 07:21:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193612397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257765035] [2022-12-13 07:21:08,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:08,271 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 07:21:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:08,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:08,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:08,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257765035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:08,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:08,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 07:21:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684563405] [2022-12-13 07:21:08,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:08,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:08,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 924 transitions, 57569 flow. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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:21:08,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:08,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:09,740 INFO L130 PetriNetUnfolder]: 808/1653 cut-off events. [2022-12-13 07:21:09,741 INFO L131 PetriNetUnfolder]: For 1694/1694 co-relation queries the response was YES. [2022-12-13 07:21:09,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52908 conditions, 1653 events. 808/1653 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10691 event pairs, 0 based on Foata normal form. 8/1337 useless extension candidates. Maximal degree in co-relation 49314. Up to 1617 conditions per place. [2022-12-13 07:21:09,761 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 849 selfloop transitions, 163 changer transitions 12/1024 dead transitions. [2022-12-13 07:21:09,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1024 transitions, 65874 flow [2022-12-13 07:21:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 07:21:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 07:21:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 122 transitions. [2022-12-13 07:21:09,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3536231884057971 [2022-12-13 07:21:09,763 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 252 predicate places. [2022-12-13 07:21:09,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 1024 transitions, 65874 flow [2022-12-13 07:21:09,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 1012 transitions, 65097 flow [2022-12-13 07:21:09,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:09,822 INFO L89 Accepts]: Start accepts. Operand has 268 places, 1012 transitions, 65097 flow [2022-12-13 07:21:09,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:09,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:09,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 1012 transitions, 65097 flow [2022-12-13 07:21:09,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 1012 transitions, 65097 flow [2022-12-13 07:21:09,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:09,866 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:09,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 07:21:09,867 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1012 transitions, 65097 flow [2022-12-13 07:21:09,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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:21:09,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:09,867 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:09,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 07:21:10,072 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 206548043, now seen corresponding path program 20 times [2022-12-13 07:21:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:10,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954767880] [2022-12-13 07:21:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954767880] [2022-12-13 07:21:10,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954767880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490032000] [2022-12-13 07:21:10,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:10,144 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:10,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 07:21:10,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:10,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:10,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:10,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:10,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490032000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:10,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:10,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:21:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121354558] [2022-12-13 07:21:10,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:10,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:21:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:21:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:21:10,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:10,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1012 transitions, 65097 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:21:10,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:10,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:11,511 INFO L130 PetriNetUnfolder]: 803/1640 cut-off events. [2022-12-13 07:21:11,511 INFO L131 PetriNetUnfolder]: For 1781/1781 co-relation queries the response was YES. [2022-12-13 07:21:11,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54130 conditions, 1640 events. 803/1640 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10553 event pairs, 0 based on Foata normal form. 2/1322 useless extension candidates. Maximal degree in co-relation 50425. Up to 1604 conditions per place. [2022-12-13 07:21:11,530 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 839 selfloop transitions, 170 changer transitions 6/1015 dead transitions. [2022-12-13 07:21:11,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1015 transitions, 67319 flow [2022-12-13 07:21:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:21:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:21:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-12-13 07:21:11,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-13 07:21:11,532 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 258 predicate places. [2022-12-13 07:21:11,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 1015 transitions, 67319 flow [2022-12-13 07:21:11,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 1009 transitions, 66939 flow [2022-12-13 07:21:11,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:11,588 INFO L89 Accepts]: Start accepts. Operand has 276 places, 1009 transitions, 66939 flow [2022-12-13 07:21:11,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:11,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:11,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 1009 transitions, 66939 flow [2022-12-13 07:21:11,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 1009 transitions, 66939 flow [2022-12-13 07:21:11,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:11,645 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:11,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 07:21:11,646 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 1009 transitions, 66939 flow [2022-12-13 07:21:11,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:21:11,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:11,646 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:11,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:11,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 07:21:11,847 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -852356008, now seen corresponding path program 21 times [2022-12-13 07:21:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:11,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443667749] [2022-12-13 07:21:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:11,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443667749] [2022-12-13 07:21:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443667749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:11,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675985514] [2022-12-13 07:21:11,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:11,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:11,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:11,903 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 07:21:11,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:21:11,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:11,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:11,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:12,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675985514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:12,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:12,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837708115] [2022-12-13 07:21:12,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:12,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:12,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:12,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:12,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1009 transitions, 66939 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:21:12,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:12,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:12,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:13,340 INFO L130 PetriNetUnfolder]: 828/1689 cut-off events. [2022-12-13 07:21:13,340 INFO L131 PetriNetUnfolder]: For 1686/1686 co-relation queries the response was YES. [2022-12-13 07:21:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57456 conditions, 1689 events. 828/1689 cut-off events. For 1686/1686 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10929 event pairs, 0 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 53571. Up to 1655 conditions per place. [2022-12-13 07:21:13,363 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 971 selfloop transitions, 75 changer transitions 0/1046 dead transitions. [2022-12-13 07:21:13,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:21:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:21:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-12-13 07:21:13,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 07:21:13,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 266 predicate places. [2022-12-13 07:21:13,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:13,422 INFO L89 Accepts]: Start accepts. Operand has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:13,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:13,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:13,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:13,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 07:21:13,476 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1046 transitions, 71482 flow [2022-12-13 07:21:13,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:21:13,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:13,476 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:13,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:13,681 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1739859689, now seen corresponding path program 22 times [2022-12-13 07:21:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470587670] [2022-12-13 07:21:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:13,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470587670] [2022-12-13 07:21:13,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470587670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355781002] [2022-12-13 07:21:13,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:13,759 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:13,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 07:21:13,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:13,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:13,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:13,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:13,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355781002] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:13,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852249117] [2022-12-13 07:21:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:13,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:13,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1046 transitions, 71482 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:13,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:13,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:15,303 INFO L130 PetriNetUnfolder]: 953/1972 cut-off events. [2022-12-13 07:21:15,304 INFO L131 PetriNetUnfolder]: For 1752/1752 co-relation queries the response was YES. [2022-12-13 07:21:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69087 conditions, 1972 events. 953/1972 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13468 event pairs, 0 based on Foata normal form. 0/1582 useless extension candidates. Maximal degree in co-relation 64237. Up to 1938 conditions per place. [2022-12-13 07:21:15,385 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1085 selfloop transitions, 143 changer transitions 0/1228 dead transitions. [2022-12-13 07:21:15,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:21:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:21:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-13 07:21:15,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2022-12-13 07:21:15,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 278 predicate places. [2022-12-13 07:21:15,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:15,458 INFO L89 Accepts]: Start accepts. Operand has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:15,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:15,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:15,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:15,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 07:21:15,515 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 1228 transitions, 86422 flow [2022-12-13 07:21:15,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:15,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:15,515 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:15,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:15,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:15,720 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1271603583, now seen corresponding path program 23 times [2022-12-13 07:21:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:15,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539138428] [2022-12-13 07:21:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539138428] [2022-12-13 07:21:15,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539138428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091483074] [2022-12-13 07:21:15,778 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:21:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:15,780 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:15,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 07:21:15,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:15,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:15,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:15,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:15,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091483074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:15,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:15,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 07:21:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752663204] [2022-12-13 07:21:15,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:15,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:15,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:15,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 1228 transitions, 86422 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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:21:15,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:15,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:17,774 INFO L130 PetriNetUnfolder]: 1028/2123 cut-off events. [2022-12-13 07:21:17,774 INFO L131 PetriNetUnfolder]: For 1671/1671 co-relation queries the response was YES. [2022-12-13 07:21:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76509 conditions, 2123 events. 1028/2123 cut-off events. For 1671/1671 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 14757 event pairs, 0 based on Foata normal form. 4/1707 useless extension candidates. Maximal degree in co-relation 71303. Up to 2089 conditions per place. [2022-12-13 07:21:17,795 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1085 selfloop transitions, 228 changer transitions 6/1319 dead transitions. [2022-12-13 07:21:17,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 1319 transitions, 95469 flow [2022-12-13 07:21:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:21:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:21:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-12-13 07:21:17,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-13 07:21:17,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 299 predicate places. [2022-12-13 07:21:17,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 1319 transitions, 95469 flow [2022-12-13 07:21:17,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 1313 transitions, 95037 flow [2022-12-13 07:21:17,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:17,859 INFO L89 Accepts]: Start accepts. Operand has 317 places, 1313 transitions, 95037 flow [2022-12-13 07:21:17,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:17,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:17,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 1313 transitions, 95037 flow [2022-12-13 07:21:17,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 1313 transitions, 95037 flow [2022-12-13 07:21:17,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:17,914 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:17,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 07:21:17,914 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 1313 transitions, 95037 flow [2022-12-13 07:21:17,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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:21:17,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:17,914 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:17,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:18,118 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1701802345, now seen corresponding path program 24 times [2022-12-13 07:21:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862244961] [2022-12-13 07:21:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862244961] [2022-12-13 07:21:18,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862244961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:18,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759214184] [2022-12-13 07:21:18,177 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:18,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:18,178 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 07:21:18,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:21:18,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:18,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:18,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:18,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759214184] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:18,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:18,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:21:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590853442] [2022-12-13 07:21:18,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:18,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:18,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:18,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 1313 transitions, 95037 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:18,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:18,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:18,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:20,056 INFO L130 PetriNetUnfolder]: 1021/2110 cut-off events. [2022-12-13 07:21:20,056 INFO L131 PetriNetUnfolder]: For 1673/1673 co-relation queries the response was YES. [2022-12-13 07:21:20,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78152 conditions, 2110 events. 1021/2110 cut-off events. For 1673/1673 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14660 event pairs, 0 based on Foata normal form. 2/1698 useless extension candidates. Maximal degree in co-relation 72803. Up to 2076 conditions per place. [2022-12-13 07:21:20,078 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1077 selfloop transitions, 230 changer transitions 4/1311 dead transitions. [2022-12-13 07:21:20,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1311 transitions, 97515 flow [2022-12-13 07:21:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 07:21:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 07:21:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 81 transitions. [2022-12-13 07:21:20,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3176470588235294 [2022-12-13 07:21:20,079 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 313 predicate places. [2022-12-13 07:21:20,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 1311 transitions, 97515 flow [2022-12-13 07:21:20,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 1307 transitions, 97219 flow [2022-12-13 07:21:20,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:20,143 INFO L89 Accepts]: Start accepts. Operand has 330 places, 1307 transitions, 97219 flow [2022-12-13 07:21:20,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:20,165 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:20,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 1307 transitions, 97219 flow [2022-12-13 07:21:20,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 1307 transitions, 97219 flow [2022-12-13 07:21:20,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:20,200 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:20,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 07:21:20,201 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1307 transitions, 97219 flow [2022-12-13 07:21:20,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:20,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:20,201 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:20,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 07:21:20,406 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1496665652, now seen corresponding path program 25 times [2022-12-13 07:21:20,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:20,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832388842] [2022-12-13 07:21:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832388842] [2022-12-13 07:21:20,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832388842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246686016] [2022-12-13 07:21:20,450 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:20,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:20,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:20,451 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 07:21:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:20,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:20,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:20,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:20,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246686016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:20,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:20,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:21:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689927417] [2022-12-13 07:21:20,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:20,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:20,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:20,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1307 transitions, 97219 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:21:20,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:20,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:20,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:22,699 INFO L130 PetriNetUnfolder]: 1041/2152 cut-off events. [2022-12-13 07:21:22,699 INFO L131 PetriNetUnfolder]: For 1672/1672 co-relation queries the response was YES. [2022-12-13 07:21:22,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81862 conditions, 2152 events. 1041/2152 cut-off events. For 1672/1672 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 15013 event pairs, 0 based on Foata normal form. 4/1736 useless extension candidates. Maximal degree in co-relation 76293. Up to 2118 conditions per place. [2022-12-13 07:21:22,721 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1138 selfloop transitions, 198 changer transitions 4/1340 dead transitions. [2022-12-13 07:21:22,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1340 transitions, 102350 flow [2022-12-13 07:21:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:21:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:21:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-12-13 07:21:22,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2920634920634921 [2022-12-13 07:21:22,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 330 predicate places. [2022-12-13 07:21:22,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 1340 transitions, 102350 flow [2022-12-13 07:21:22,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 1336 transitions, 102043 flow [2022-12-13 07:21:22,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:22,790 INFO L89 Accepts]: Start accepts. Operand has 349 places, 1336 transitions, 102043 flow [2022-12-13 07:21:22,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:22,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:22,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 349 places, 1336 transitions, 102043 flow [2022-12-13 07:21:22,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 1336 transitions, 102043 flow [2022-12-13 07:21:22,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:22,851 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:22,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 07:21:22,851 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 1336 transitions, 102043 flow [2022-12-13 07:21:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:21:22,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:22,851 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:22,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 07:21:23,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 07:21:23,052 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2053174133, now seen corresponding path program 26 times [2022-12-13 07:21:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:23,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494569741] [2022-12-13 07:21:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:23,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:23,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494569741] [2022-12-13 07:21:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494569741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:23,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119938689] [2022-12-13 07:21:23,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:23,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:23,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:23,102 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:23,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 07:21:23,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:23,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:23,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:23,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:23,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:23,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119938689] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:23,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:23,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:21:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104487765] [2022-12-13 07:21:23,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:23,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:23,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:23,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1336 transitions, 102043 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:23,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:23,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:23,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:24,918 INFO L130 PetriNetUnfolder]: 1034/2125 cut-off events. [2022-12-13 07:21:24,918 INFO L131 PetriNetUnfolder]: For 1667/1667 co-relation queries the response was YES. [2022-12-13 07:21:24,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82957 conditions, 2125 events. 1034/2125 cut-off events. For 1667/1667 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 14723 event pairs, 0 based on Foata normal form. 2/1713 useless extension candidates. Maximal degree in co-relation 77401. Up to 2091 conditions per place. [2022-12-13 07:21:24,940 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1109 selfloop transitions, 208 changer transitions 2/1319 dead transitions. [2022-12-13 07:21:24,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1319 transitions, 103377 flow [2022-12-13 07:21:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 07:21:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 07:21:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-12-13 07:21:24,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3215686274509804 [2022-12-13 07:21:24,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 344 predicate places. [2022-12-13 07:21:24,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 1319 transitions, 103377 flow [2022-12-13 07:21:24,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 1317 transitions, 103221 flow [2022-12-13 07:21:25,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:25,012 INFO L89 Accepts]: Start accepts. Operand has 361 places, 1317 transitions, 103221 flow [2022-12-13 07:21:25,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:25,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:25,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 361 places, 1317 transitions, 103221 flow [2022-12-13 07:21:25,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 361 places, 1317 transitions, 103221 flow [2022-12-13 07:21:25,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:25,078 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:25,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 07:21:25,079 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 1317 transitions, 103221 flow [2022-12-13 07:21:25,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:25,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:25,079 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:25,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 07:21:25,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 07:21:25,284 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1166859744, now seen corresponding path program 27 times [2022-12-13 07:21:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:25,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323034790] [2022-12-13 07:21:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323034790] [2022-12-13 07:21:25,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323034790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925700232] [2022-12-13 07:21:25,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:25,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:25,360 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:25,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 07:21:25,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:21:25,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:25,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:25,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:25,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:25,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925700232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:25,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:25,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:21:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269014885] [2022-12-13 07:21:25,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:25,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:21:25,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:25,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 1317 transitions, 103221 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:21:25,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:25,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:25,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:27,547 INFO L130 PetriNetUnfolder]: 1169/2394 cut-off events. [2022-12-13 07:21:27,547 INFO L131 PetriNetUnfolder]: For 1805/1805 co-relation queries the response was YES. [2022-12-13 07:21:27,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95865 conditions, 2394 events. 1169/2394 cut-off events. For 1805/1805 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 16927 event pairs, 0 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 89520. Up to 2360 conditions per place. [2022-12-13 07:21:27,576 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1310 selfloop transitions, 175 changer transitions 0/1485 dead transitions. [2022-12-13 07:21:27,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:21:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:21:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 93 transitions. [2022-12-13 07:21:27,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2022-12-13 07:21:27,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 354 predicate places. [2022-12-13 07:21:27,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:27,723 INFO L89 Accepts]: Start accepts. Operand has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:27,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:27,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:27,792 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:27,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 07:21:27,792 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 1485 transitions, 119361 flow [2022-12-13 07:21:27,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:21:27,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:27,793 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:27,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:27,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 07:21:27,993 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1926864414, now seen corresponding path program 28 times [2022-12-13 07:21:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:27,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605635461] [2022-12-13 07:21:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:28,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:28,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605635461] [2022-12-13 07:21:28,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605635461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:28,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619169156] [2022-12-13 07:21:28,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:28,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:28,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:28,037 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:28,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 07:21:28,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:28,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:28,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:28,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:28,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619169156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:28,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:28,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325590465] [2022-12-13 07:21:28,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:28,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:28,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:28,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1485 transitions, 119361 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:21:28,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:28,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:28,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:30,965 INFO L130 PetriNetUnfolder]: 1151/2346 cut-off events. [2022-12-13 07:21:30,966 INFO L131 PetriNetUnfolder]: For 1774/1774 co-relation queries the response was YES. [2022-12-13 07:21:30,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96283 conditions, 2346 events. 1151/2346 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 16380 event pairs, 0 based on Foata normal form. 4/1880 useless extension candidates. Maximal degree in co-relation 90030. Up to 2312 conditions per place. [2022-12-13 07:21:31,002 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1209 selfloop transitions, 242 changer transitions 4/1455 dead transitions. [2022-12-13 07:21:31,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1455 transitions, 119844 flow [2022-12-13 07:21:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 07:21:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 07:21:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2022-12-13 07:21:31,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3017543859649123 [2022-12-13 07:21:31,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 370 predicate places. [2022-12-13 07:21:31,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 390 places, 1455 transitions, 119844 flow [2022-12-13 07:21:31,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 386 places, 1451 transitions, 119513 flow [2022-12-13 07:21:31,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:31,102 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1451 transitions, 119513 flow [2022-12-13 07:21:31,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:31,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:31,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1451 transitions, 119513 flow [2022-12-13 07:21:31,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 1451 transitions, 119513 flow [2022-12-13 07:21:31,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:31,172 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:31,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 07:21:31,173 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1451 transitions, 119513 flow [2022-12-13 07:21:31,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:21:31,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:31,173 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:31,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 07:21:31,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 07:21:31,375 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1738670397, now seen corresponding path program 29 times [2022-12-13 07:21:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282412886] [2022-12-13 07:21:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:31,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282412886] [2022-12-13 07:21:31,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282412886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:31,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905932127] [2022-12-13 07:21:31,418 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:21:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:31,419 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:31,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 07:21:31,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:31,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:31,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:21:31,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:31,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905932127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:31,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247744951] [2022-12-13 07:21:31,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:31,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:21:31,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1451 transitions, 119513 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:31,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:31,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:21:31,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:33,512 INFO L130 PetriNetUnfolder]: 1142/2325 cut-off events. [2022-12-13 07:21:33,512 INFO L131 PetriNetUnfolder]: For 1771/1771 co-relation queries the response was YES. [2022-12-13 07:21:33,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97745 conditions, 2325 events. 1142/2325 cut-off events. For 1771/1771 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 16200 event pairs, 0 based on Foata normal form. 2/1865 useless extension candidates. Maximal degree in co-relation 91426. Up to 2291 conditions per place. [2022-12-13 07:21:33,538 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1169 selfloop transitions, 269 changer transitions 2/1440 dead transitions. [2022-12-13 07:21:33,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1440 transitions, 121485 flow [2022-12-13 07:21:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:21:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:21:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 90 transitions. [2022-12-13 07:21:33,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 07:21:33,539 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 381 predicate places. [2022-12-13 07:21:33,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 1440 transitions, 121485 flow [2022-12-13 07:21:33,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 1438 transitions, 121317 flow [2022-12-13 07:21:33,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:33,618 INFO L89 Accepts]: Start accepts. Operand has 397 places, 1438 transitions, 121317 flow [2022-12-13 07:21:33,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:33,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:33,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 1438 transitions, 121317 flow [2022-12-13 07:21:33,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 1438 transitions, 121317 flow [2022-12-13 07:21:33,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:33,692 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:33,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 07:21:33,692 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1438 transitions, 121317 flow [2022-12-13 07:21:33,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:21:33,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:33,692 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:33,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-13 07:21:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:33,894 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash -886346770, now seen corresponding path program 30 times [2022-12-13 07:21:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:33,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914880821] [2022-12-13 07:21:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914880821] [2022-12-13 07:21:34,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914880821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547805658] [2022-12-13 07:21:34,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:34,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:34,260 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:34,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 07:21:34,361 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:21:34,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:34,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:34,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:34,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547805658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:34,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:21:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814172746] [2022-12-13 07:21:34,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:34,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:34,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:34,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1438 transitions, 121317 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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:21:34,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:34,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:37,056 INFO L130 PetriNetUnfolder]: 1243/2537 cut-off events. [2022-12-13 07:21:37,056 INFO L131 PetriNetUnfolder]: For 2518/2518 co-relation queries the response was YES. [2022-12-13 07:21:37,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109147 conditions, 2537 events. 1243/2537 cut-off events. For 2518/2518 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 18120 event pairs, 0 based on Foata normal form. 7/2050 useless extension candidates. Maximal degree in co-relation 102112. Up to 2497 conditions per place. [2022-12-13 07:21:37,084 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1411 selfloop transitions, 86 changer transitions 56/1563 dead transitions. [2022-12-13 07:21:37,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1563 transitions, 135013 flow [2022-12-13 07:21:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:21:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:21:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2022-12-13 07:21:37,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-13 07:21:37,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 388 predicate places. [2022-12-13 07:21:37,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 408 places, 1563 transitions, 135013 flow [2022-12-13 07:21:37,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 406 places, 1507 transitions, 130140 flow [2022-12-13 07:21:37,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:37,171 INFO L89 Accepts]: Start accepts. Operand has 406 places, 1507 transitions, 130140 flow [2022-12-13 07:21:37,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:37,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:37,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 1507 transitions, 130140 flow [2022-12-13 07:21:37,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 1507 transitions, 130140 flow [2022-12-13 07:21:37,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:37,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:37,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 07:21:37,257 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 1507 transitions, 130140 flow [2022-12-13 07:21:37,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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:21:37,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:37,257 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:37,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:37,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:37,462 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1218419856, now seen corresponding path program 31 times [2022-12-13 07:21:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:37,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728268482] [2022-12-13 07:21:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:37,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:37,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728268482] [2022-12-13 07:21:37,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728268482] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:37,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402201948] [2022-12-13 07:21:37,774 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:37,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:37,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:37,788 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:37,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 07:21:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:37,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:37,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:37,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:38,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402201948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:38,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:38,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-13 07:21:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868269152] [2022-12-13 07:21:38,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:38,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:21:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:21:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:21:38,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:38,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 1507 transitions, 130140 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 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:21:38,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:38,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:41,518 INFO L130 PetriNetUnfolder]: 1326/2700 cut-off events. [2022-12-13 07:21:41,518 INFO L131 PetriNetUnfolder]: For 3071/3071 co-relation queries the response was YES. [2022-12-13 07:21:41,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118842 conditions, 2700 events. 1326/2700 cut-off events. For 3071/3071 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 19473 event pairs, 0 based on Foata normal form. 3/2171 useless extension candidates. Maximal degree in co-relation 111115. Up to 2660 conditions per place. [2022-12-13 07:21:41,551 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1523 selfloop transitions, 114 changer transitions 15/1662 dead transitions. [2022-12-13 07:21:41,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1662 transitions, 146876 flow [2022-12-13 07:21:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:21:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:21:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-13 07:21:41,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 07:21:41,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 395 predicate places. [2022-12-13 07:21:41,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 415 places, 1662 transitions, 146876 flow [2022-12-13 07:21:41,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 1647 transitions, 145538 flow [2022-12-13 07:21:41,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:41,669 INFO L89 Accepts]: Start accepts. Operand has 414 places, 1647 transitions, 145538 flow [2022-12-13 07:21:41,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:41,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:41,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 1647 transitions, 145538 flow [2022-12-13 07:21:41,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 414 places, 1647 transitions, 145538 flow [2022-12-13 07:21:41,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:41,768 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:41,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 07:21:41,769 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 1647 transitions, 145538 flow [2022-12-13 07:21:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 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:21:41,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:41,769 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:41,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:41,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:41,974 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -953039706, now seen corresponding path program 32 times [2022-12-13 07:21:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956540177] [2022-12-13 07:21:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956540177] [2022-12-13 07:21:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956540177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:42,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955849899] [2022-12-13 07:21:42,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:42,482 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:42,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 07:21:42,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:42,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:42,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:42,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:42,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955849899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:42,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:42,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-12-13 07:21:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140521325] [2022-12-13 07:21:42,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:21:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:21:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:21:42,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:42,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 1647 transitions, 145538 flow. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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:21:42,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:42,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:42,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:45,747 INFO L130 PetriNetUnfolder]: 1317/2671 cut-off events. [2022-12-13 07:21:45,748 INFO L131 PetriNetUnfolder]: For 3648/3648 co-relation queries the response was YES. [2022-12-13 07:21:45,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120202 conditions, 2671 events. 1317/2671 cut-off events. For 3648/3648 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 19123 event pairs, 0 based on Foata normal form. 5/2156 useless extension candidates. Maximal degree in co-relation 112666. Up to 2631 conditions per place. [2022-12-13 07:21:45,792 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1490 selfloop transitions, 113 changer transitions 29/1642 dead transitions. [2022-12-13 07:21:45,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1642 transitions, 148362 flow [2022-12-13 07:21:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:21:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:21:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-13 07:21:45,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-13 07:21:45,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 405 predicate places. [2022-12-13 07:21:45,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 1642 transitions, 148362 flow [2022-12-13 07:21:45,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 421 places, 1613 transitions, 145722 flow [2022-12-13 07:21:45,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:45,910 INFO L89 Accepts]: Start accepts. Operand has 421 places, 1613 transitions, 145722 flow [2022-12-13 07:21:45,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:45,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:45,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 1613 transitions, 145722 flow [2022-12-13 07:21:46,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 421 places, 1613 transitions, 145722 flow [2022-12-13 07:21:46,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:46,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:46,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 07:21:46,038 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 1613 transitions, 145722 flow [2022-12-13 07:21:46,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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:21:46,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:46,038 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:46,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:46,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 07:21:46,239 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2027548112, now seen corresponding path program 33 times [2022-12-13 07:21:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:46,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52935640] [2022-12-13 07:21:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52935640] [2022-12-13 07:21:46,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52935640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585511881] [2022-12-13 07:21:46,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:46,555 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:46,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 07:21:46,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:21:46,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:46,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:46,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:46,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:46,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585511881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:46,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:46,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 07:21:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043019422] [2022-12-13 07:21:46,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:21:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:21:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:21:46,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:46,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 1613 transitions, 145722 flow. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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:21:46,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:46,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:46,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:50,117 INFO L130 PetriNetUnfolder]: 1310/2631 cut-off events. [2022-12-13 07:21:50,117 INFO L131 PetriNetUnfolder]: For 4508/4508 co-relation queries the response was YES. [2022-12-13 07:21:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120994 conditions, 2631 events. 1310/2631 cut-off events. For 4508/4508 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 18648 event pairs, 0 based on Foata normal form. 4/2125 useless extension candidates. Maximal degree in co-relation 113713. Up to 2591 conditions per place. [2022-12-13 07:21:50,151 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1478 selfloop transitions, 101 changer transitions 20/1609 dead transitions. [2022-12-13 07:21:50,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1609 transitions, 148560 flow [2022-12-13 07:21:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:21:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:21:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-13 07:21:50,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 07:21:50,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 411 predicate places. [2022-12-13 07:21:50,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 1609 transitions, 148560 flow [2022-12-13 07:21:50,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 1589 transitions, 146696 flow [2022-12-13 07:21:50,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:50,256 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1589 transitions, 146696 flow [2022-12-13 07:21:50,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:50,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:50,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1589 transitions, 146696 flow [2022-12-13 07:21:50,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1589 transitions, 146696 flow [2022-12-13 07:21:50,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:50,358 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:50,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 07:21:50,358 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1589 transitions, 146696 flow [2022-12-13 07:21:50,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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:21:50,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:50,359 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:50,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:50,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 07:21:50,559 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -514203026, now seen corresponding path program 34 times [2022-12-13 07:21:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60746040] [2022-12-13 07:21:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:50,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60746040] [2022-12-13 07:21:50,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60746040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566603944] [2022-12-13 07:21:50,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:50,965 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:50,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 07:21:51,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:51,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:51,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:51,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:51,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:51,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566603944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:51,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:51,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2022-12-13 07:21:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428429772] [2022-12-13 07:21:51,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:51,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:21:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:21:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:21:51,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:51,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1589 transitions, 146696 flow. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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:21:51,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:51,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:53,976 INFO L130 PetriNetUnfolder]: 1330/2681 cut-off events. [2022-12-13 07:21:53,977 INFO L131 PetriNetUnfolder]: For 4994/4994 co-relation queries the response was YES. [2022-12-13 07:21:53,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125949 conditions, 2681 events. 1330/2681 cut-off events. For 4994/4994 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 19093 event pairs, 0 based on Foata normal form. 4/2173 useless extension candidates. Maximal degree in co-relation 118418. Up to 2641 conditions per place. [2022-12-13 07:21:54,010 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1544 selfloop transitions, 71 changer transitions 20/1645 dead transitions. [2022-12-13 07:21:54,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1645 transitions, 155151 flow [2022-12-13 07:21:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-13 07:21:54,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 07:21:54,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 417 predicate places. [2022-12-13 07:21:54,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 1645 transitions, 155151 flow [2022-12-13 07:21:54,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 1625 transitions, 153247 flow [2022-12-13 07:21:54,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:54,126 INFO L89 Accepts]: Start accepts. Operand has 436 places, 1625 transitions, 153247 flow [2022-12-13 07:21:54,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:54,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:54,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 436 places, 1625 transitions, 153247 flow [2022-12-13 07:21:54,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 1625 transitions, 153247 flow [2022-12-13 07:21:54,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:54,293 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:54,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 07:21:54,293 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 1625 transitions, 153247 flow [2022-12-13 07:21:54,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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:21:54,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:54,294 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:54,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-13 07:21:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 07:21:54,494 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -515392318, now seen corresponding path program 35 times [2022-12-13 07:21:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:54,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078063968] [2022-12-13 07:21:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078063968] [2022-12-13 07:21:54,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078063968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631590534] [2022-12-13 07:21:54,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:21:54,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:54,753 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:54,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 07:21:54,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:21:54,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:54,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:21:54,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:55,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:21:55,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631590534] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:55,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:55,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2022-12-13 07:21:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196448507] [2022-12-13 07:21:55,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:55,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:21:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:21:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:21:55,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:21:55,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 1625 transitions, 153247 flow. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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:21:55,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:55,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:21:55,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:59,169 INFO L130 PetriNetUnfolder]: 1382/2789 cut-off events. [2022-12-13 07:21:59,170 INFO L131 PetriNetUnfolder]: For 5766/5766 co-relation queries the response was YES. [2022-12-13 07:21:59,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133797 conditions, 2789 events. 1382/2789 cut-off events. For 5766/5766 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 19953 event pairs, 0 based on Foata normal form. 4/2253 useless extension candidates. Maximal degree in co-relation 125721. Up to 2749 conditions per place. [2022-12-13 07:21:59,209 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1586 selfloop transitions, 91 changer transitions 24/1711 dead transitions. [2022-12-13 07:21:59,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1711 transitions, 164793 flow [2022-12-13 07:21:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-12-13 07:21:59,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 07:21:59,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 423 predicate places. [2022-12-13 07:21:59,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 443 places, 1711 transitions, 164793 flow [2022-12-13 07:21:59,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 1687 transitions, 162465 flow [2022-12-13 07:21:59,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:59,522 INFO L89 Accepts]: Start accepts. Operand has 442 places, 1687 transitions, 162465 flow [2022-12-13 07:21:59,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:59,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:59,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 1687 transitions, 162465 flow [2022-12-13 07:21:59,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 1687 transitions, 162465 flow [2022-12-13 07:21:59,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:59,641 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:59,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 07:21:59,642 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1687 transitions, 162465 flow [2022-12-13 07:21:59,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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:21:59,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:59,642 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:59,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-13 07:21:59,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 07:21:59,847 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:21:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -780772468, now seen corresponding path program 36 times [2022-12-13 07:21:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594789351] [2022-12-13 07:21:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:00,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594789351] [2022-12-13 07:22:00,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594789351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:00,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210078848] [2022-12-13 07:22:00,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:22:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:00,172 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:00,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 07:22:00,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:22:00,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:00,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:00,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:00,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:00,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210078848] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:00,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:00,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2022-12-13 07:22:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107085415] [2022-12-13 07:22:00,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:00,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:22:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:00,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:22:00,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:22:00,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:00,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1687 transitions, 162465 flow. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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:22:00,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:00,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:00,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:06,120 INFO L130 PetriNetUnfolder]: 1376/2755 cut-off events. [2022-12-13 07:22:06,120 INFO L131 PetriNetUnfolder]: For 6599/6599 co-relation queries the response was YES. [2022-12-13 07:22:06,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134883 conditions, 2755 events. 1376/2755 cut-off events. For 6599/6599 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 19564 event pairs, 0 based on Foata normal form. 4/2227 useless extension candidates. Maximal degree in co-relation 127038. Up to 2715 conditions per place. [2022-12-13 07:22:06,155 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1564 selfloop transitions, 89 changer transitions 20/1683 dead transitions. [2022-12-13 07:22:06,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 1683 transitions, 165427 flow [2022-12-13 07:22:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:22:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:22:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-13 07:22:06,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2022-12-13 07:22:06,156 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 429 predicate places. [2022-12-13 07:22:06,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 449 places, 1683 transitions, 165427 flow [2022-12-13 07:22:06,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 448 places, 1663 transitions, 163443 flow [2022-12-13 07:22:06,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:06,268 INFO L89 Accepts]: Start accepts. Operand has 448 places, 1663 transitions, 163443 flow [2022-12-13 07:22:06,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:06,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:06,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 1663 transitions, 163443 flow [2022-12-13 07:22:06,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 448 places, 1663 transitions, 163443 flow [2022-12-13 07:22:06,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:06,379 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:06,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 07:22:06,380 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 1663 transitions, 163443 flow [2022-12-13 07:22:06,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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:22:06,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:06,380 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:06,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:06,581 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash 204832166, now seen corresponding path program 37 times [2022-12-13 07:22:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:06,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025927210] [2022-12-13 07:22:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:06,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025927210] [2022-12-13 07:22:06,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025927210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:06,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874740237] [2022-12-13 07:22:06,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:22:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:06,875 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:06,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 07:22:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:06,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:06,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:07,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874740237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:07,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:07,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:22:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52586669] [2022-12-13 07:22:07,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:22:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:22:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:22:07,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:07,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 1663 transitions, 163443 flow. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 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:22:07,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:07,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:07,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:11,846 INFO L130 PetriNetUnfolder]: 1472/2982 cut-off events. [2022-12-13 07:22:11,846 INFO L131 PetriNetUnfolder]: For 8169/8169 co-relation queries the response was YES. [2022-12-13 07:22:11,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148917 conditions, 2982 events. 1472/2982 cut-off events. For 8169/8169 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 21792 event pairs, 0 based on Foata normal form. 9/2423 useless extension candidates. Maximal degree in co-relation 140256. Up to 2938 conditions per place. [2022-12-13 07:22:11,885 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1657 selfloop transitions, 104 changer transitions 63/1834 dead transitions. [2022-12-13 07:22:11,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1834 transitions, 183939 flow [2022-12-13 07:22:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:22:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:22:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-13 07:22:11,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-13 07:22:11,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 439 predicate places. [2022-12-13 07:22:11,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 459 places, 1834 transitions, 183939 flow [2022-12-13 07:22:11,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 457 places, 1771 transitions, 177585 flow [2022-12-13 07:22:12,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:12,004 INFO L89 Accepts]: Start accepts. Operand has 457 places, 1771 transitions, 177585 flow [2022-12-13 07:22:12,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:12,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:12,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 457 places, 1771 transitions, 177585 flow [2022-12-13 07:22:12,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 457 places, 1771 transitions, 177585 flow [2022-12-13 07:22:12,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:12,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:12,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 07:22:12,143 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 1771 transitions, 177585 flow [2022-12-13 07:22:12,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 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:22:12,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:12,143 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:12,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:12,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 07:22:12,347 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1698614480, now seen corresponding path program 38 times [2022-12-13 07:22:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627367615] [2022-12-13 07:22:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627367615] [2022-12-13 07:22:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627367615] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385668988] [2022-12-13 07:22:12,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:22:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:12,603 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:12,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 07:22:12,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:22:12,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:12,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:12,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:12,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385668988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:12,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:12,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2022-12-13 07:22:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831392954] [2022-12-13 07:22:12,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:22:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:22:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:22:12,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:12,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1771 transitions, 177585 flow. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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:22:12,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:12,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:17,247 INFO L130 PetriNetUnfolder]: 1580/3193 cut-off events. [2022-12-13 07:22:17,247 INFO L131 PetriNetUnfolder]: For 9228/9228 co-relation queries the response was YES. [2022-12-13 07:22:17,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162652 conditions, 3193 events. 1580/3193 cut-off events. For 9228/9228 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 23541 event pairs, 0 based on Foata normal form. 8/2583 useless extension candidates. Maximal degree in co-relation 153152. Up to 3149 conditions per place. [2022-12-13 07:22:17,296 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1787 selfloop transitions, 108 changer transitions 52/1957 dead transitions. [2022-12-13 07:22:17,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1957 transitions, 200208 flow [2022-12-13 07:22:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:22:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:22:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2022-12-13 07:22:17,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2022-12-13 07:22:17,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 446 predicate places. [2022-12-13 07:22:17,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 1957 transitions, 200208 flow [2022-12-13 07:22:17,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 464 places, 1905 transitions, 194847 flow [2022-12-13 07:22:17,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:17,473 INFO L89 Accepts]: Start accepts. Operand has 464 places, 1905 transitions, 194847 flow [2022-12-13 07:22:17,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:17,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:17,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 464 places, 1905 transitions, 194847 flow [2022-12-13 07:22:17,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 464 places, 1905 transitions, 194847 flow [2022-12-13 07:22:17,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:17,774 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:17,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-13 07:22:17,775 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 1905 transitions, 194847 flow [2022-12-13 07:22:17,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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:22:17,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:17,775 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:17,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:17,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 07:22:17,976 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 166774822, now seen corresponding path program 39 times [2022-12-13 07:22:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070868458] [2022-12-13 07:22:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:18,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070868458] [2022-12-13 07:22:18,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070868458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:18,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993606525] [2022-12-13 07:22:18,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:22:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:18,301 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:18,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 07:22:18,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:22:18,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:18,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:18,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:18,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:18,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993606525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:18,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:18,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-12-13 07:22:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458004785] [2022-12-13 07:22:18,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:18,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:22:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:22:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:22:18,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:18,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1905 transitions, 194847 flow. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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:22:18,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:18,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:23,555 INFO L130 PetriNetUnfolder]: 1662/3358 cut-off events. [2022-12-13 07:22:23,555 INFO L131 PetriNetUnfolder]: For 10325/10325 co-relation queries the response was YES. [2022-12-13 07:22:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174403 conditions, 3358 events. 1662/3358 cut-off events. For 10325/10325 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25031 event pairs, 0 based on Foata normal form. 3/2705 useless extension candidates. Maximal degree in co-relation 164040. Up to 3314 conditions per place. [2022-12-13 07:22:23,603 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1913 selfloop transitions, 127 changer transitions 15/2065 dead transitions. [2022-12-13 07:22:23,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 2065 transitions, 215367 flow [2022-12-13 07:22:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:22:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:22:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-12-13 07:22:23,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2022-12-13 07:22:23,605 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 453 predicate places. [2022-12-13 07:22:23,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 473 places, 2065 transitions, 215367 flow [2022-12-13 07:22:23,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 2050 transitions, 213789 flow [2022-12-13 07:22:23,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:23,761 INFO L89 Accepts]: Start accepts. Operand has 472 places, 2050 transitions, 213789 flow [2022-12-13 07:22:23,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:23,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:23,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 472 places, 2050 transitions, 213789 flow [2022-12-13 07:22:23,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 472 places, 2050 transitions, 213789 flow [2022-12-13 07:22:23,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:23,926 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:23,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 07:22:23,926 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 2050 transitions, 213789 flow [2022-12-13 07:22:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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:22:23,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:23,927 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:23,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:24,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-13 07:22:24,131 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash -98605328, now seen corresponding path program 40 times [2022-12-13 07:22:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:24,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450880323] [2022-12-13 07:22:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:24,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450880323] [2022-12-13 07:22:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450880323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085926745] [2022-12-13 07:22:24,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:22:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:24,382 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:24,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 07:22:24,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:22:24,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:24,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:24,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:24,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:24,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085926745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:24,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:24,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-13 07:22:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932788681] [2022-12-13 07:22:24,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:24,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:22:24,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:22:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:22:24,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:24,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 2050 transitions, 213789 flow. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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:22:24,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:24,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:24,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:30,280 INFO L130 PetriNetUnfolder]: 1659/3337 cut-off events. [2022-12-13 07:22:30,280 INFO L131 PetriNetUnfolder]: For 11475/11475 co-relation queries the response was YES. [2022-12-13 07:22:30,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176609 conditions, 3337 events. 1659/3337 cut-off events. For 11475/11475 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 24674 event pairs, 0 based on Foata normal form. 3/2690 useless extension candidates. Maximal degree in co-relation 166371. Up to 3293 conditions per place. [2022-12-13 07:22:30,326 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1894 selfloop transitions, 128 changer transitions 15/2047 dead transitions. [2022-12-13 07:22:30,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 2047 transitions, 217551 flow [2022-12-13 07:22:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:22:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:22:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2022-12-13 07:22:30,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-13 07:22:30,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 461 predicate places. [2022-12-13 07:22:30,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 2047 transitions, 217551 flow [2022-12-13 07:22:30,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 480 places, 2032 transitions, 215943 flow [2022-12-13 07:22:30,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:30,478 INFO L89 Accepts]: Start accepts. Operand has 480 places, 2032 transitions, 215943 flow [2022-12-13 07:22:30,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:30,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:30,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 480 places, 2032 transitions, 215943 flow [2022-12-13 07:22:30,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 480 places, 2032 transitions, 215943 flow [2022-12-13 07:22:30,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:30,620 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:30,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 07:22:30,620 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 2032 transitions, 215943 flow [2022-12-13 07:22:30,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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:22:30,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:30,621 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:30,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-13 07:22:30,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:30,825 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash 167964114, now seen corresponding path program 41 times [2022-12-13 07:22:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:30,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912215990] [2022-12-13 07:22:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:31,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912215990] [2022-12-13 07:22:31,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912215990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:31,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286352432] [2022-12-13 07:22:31,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:22:31,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:31,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:31,150 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:31,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 07:22:31,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:22:31,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:31,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:31,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:31,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286352432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:31,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:31,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 07:22:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577822954] [2022-12-13 07:22:31,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:31,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:22:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:22:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:22:31,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:31,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 2032 transitions, 215943 flow. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:22:31,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:31,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:37,044 INFO L130 PetriNetUnfolder]: 1650/3310 cut-off events. [2022-12-13 07:22:37,044 INFO L131 PetriNetUnfolder]: For 12693/12693 co-relation queries the response was YES. [2022-12-13 07:22:37,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178449 conditions, 3310 events. 1650/3310 cut-off events. For 12693/12693 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 24428 event pairs, 0 based on Foata normal form. 3/2675 useless extension candidates. Maximal degree in co-relation 168348. Up to 3266 conditions per place. [2022-12-13 07:22:37,089 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1883 selfloop transitions, 121 changer transitions 15/2029 dead transitions. [2022-12-13 07:22:37,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 2029 transitions, 219663 flow [2022-12-13 07:22:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:22:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:22:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-12-13 07:22:37,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2022-12-13 07:22:37,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 470 predicate places. [2022-12-13 07:22:37,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 490 places, 2029 transitions, 219663 flow [2022-12-13 07:22:37,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 489 places, 2014 transitions, 218025 flow [2022-12-13 07:22:37,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:37,247 INFO L89 Accepts]: Start accepts. Operand has 489 places, 2014 transitions, 218025 flow [2022-12-13 07:22:37,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:37,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:37,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 489 places, 2014 transitions, 218025 flow [2022-12-13 07:22:37,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 489 places, 2014 transitions, 218025 flow [2022-12-13 07:22:37,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:37,404 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:37,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 07:22:37,404 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 2014 transitions, 218025 flow [2022-12-13 07:22:37,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:22:37,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:37,404 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:37,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:37,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:37,609 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1787224560, now seen corresponding path program 42 times [2022-12-13 07:22:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893457337] [2022-12-13 07:22:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893457337] [2022-12-13 07:22:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893457337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356076165] [2022-12-13 07:22:37,860 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:22:37,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:37,862 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:37,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 07:22:37,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:22:37,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:37,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:37,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:38,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:38,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356076165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:38,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:38,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2022-12-13 07:22:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673965838] [2022-12-13 07:22:38,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:38,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:22:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:38,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:22:38,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:22:38,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:38,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 2014 transitions, 218025 flow. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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:22:38,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:38,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:43,551 INFO L130 PetriNetUnfolder]: 1647/3288 cut-off events. [2022-12-13 07:22:43,551 INFO L131 PetriNetUnfolder]: For 13961/13961 co-relation queries the response was YES. [2022-12-13 07:22:43,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180510 conditions, 3288 events. 1647/3288 cut-off events. For 13961/13961 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 24047 event pairs, 0 based on Foata normal form. 4/2660 useless extension candidates. Maximal degree in co-relation 170613. Up to 3244 conditions per place. [2022-12-13 07:22:43,598 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1899 selfloop transitions, 81 changer transitions 20/2010 dead transitions. [2022-12-13 07:22:43,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 2010 transitions, 221593 flow [2022-12-13 07:22:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:22:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:22:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-12-13 07:22:43,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 07:22:43,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 477 predicate places. [2022-12-13 07:22:43,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 2010 transitions, 221593 flow [2022-12-13 07:22:43,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 496 places, 1990 transitions, 219369 flow [2022-12-13 07:22:43,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:43,744 INFO L89 Accepts]: Start accepts. Operand has 496 places, 1990 transitions, 219369 flow [2022-12-13 07:22:43,822 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:43,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:43,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 496 places, 1990 transitions, 219369 flow [2022-12-13 07:22:43,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 496 places, 1990 transitions, 219369 flow [2022-12-13 07:22:43,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:43,900 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:43,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 07:22:43,900 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 1990 transitions, 219369 flow [2022-12-13 07:22:43,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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:22:43,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:43,900 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:43,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:44,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:44,105 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1433234330, now seen corresponding path program 43 times [2022-12-13 07:22:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:44,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189099107] [2022-12-13 07:22:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189099107] [2022-12-13 07:22:44,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189099107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217547957] [2022-12-13 07:22:44,418 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:22:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:44,420 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:44,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 07:22:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:44,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:22:44,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:44,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:44,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217547957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:44,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:44,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2022-12-13 07:22:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178062700] [2022-12-13 07:22:44,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:44,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:22:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:22:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:22:44,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:22:44,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1990 transitions, 219369 flow. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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:22:44,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:44,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:22:44,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:49,448 INFO L130 PetriNetUnfolder]: 1635/3251 cut-off events. [2022-12-13 07:22:49,448 INFO L131 PetriNetUnfolder]: For 15287/15287 co-relation queries the response was YES. [2022-12-13 07:22:49,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181685 conditions, 3251 events. 1635/3251 cut-off events. For 15287/15287 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 23619 event pairs, 0 based on Foata normal form. 5/2640 useless extension candidates. Maximal degree in co-relation 172119. Up to 3207 conditions per place. [2022-12-13 07:22:49,505 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1847 selfloop transitions, 103 changer transitions 25/1985 dead transitions. [2022-12-13 07:22:49,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 1985 transitions, 222769 flow [2022-12-13 07:22:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:22:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:22:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-12-13 07:22:49,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 07:22:49,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 483 predicate places. [2022-12-13 07:22:49,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 503 places, 1985 transitions, 222769 flow [2022-12-13 07:22:49,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 502 places, 1960 transitions, 219939 flow [2022-12-13 07:22:49,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:49,773 INFO L89 Accepts]: Start accepts. Operand has 502 places, 1960 transitions, 219939 flow [2022-12-13 07:22:49,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:49,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:49,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 502 places, 1960 transitions, 219939 flow [2022-12-13 07:22:49,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 502 places, 1960 transitions, 219939 flow [2022-12-13 07:22:49,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:49,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:49,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 07:22:49,910 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 1960 transitions, 219939 flow [2022-12-13 07:22:49,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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:22:49,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:49,911 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:49,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:50,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-13 07:22:50,111 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:22:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 700255904, now seen corresponding path program 44 times [2022-12-13 07:22:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:50,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895367578] [2022-12-13 07:22:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:50,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895367578] [2022-12-13 07:22:50,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895367578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:50,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413866241] [2022-12-13 07:22:50,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:22:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:50,185 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:50,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 07:22:50,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:22:50,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:50,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:22:50,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:50,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:22:50,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413866241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:50,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:50,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 07:22:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119111345] [2022-12-13 07:22:50,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:50,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:22:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:22:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:22:50,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:22:50,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1960 transitions, 219939 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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:22:50,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:50,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:22:50,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:00,103 INFO L130 PetriNetUnfolder]: 2182/4363 cut-off events. [2022-12-13 07:23:00,103 INFO L131 PetriNetUnfolder]: For 15490/15490 co-relation queries the response was YES. [2022-12-13 07:23:00,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248428 conditions, 4363 events. 2182/4363 cut-off events. For 15490/15490 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 33654 event pairs, 0 based on Foata normal form. 0/3527 useless extension candidates. Maximal degree in co-relation 235302. Up to 4319 conditions per place. [2022-12-13 07:23:00,172 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 2423 selfloop transitions, 248 changer transitions 0/2671 dead transitions. [2022-12-13 07:23:00,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:23:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:23:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-12-13 07:23:00,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-13 07:23:00,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 490 predicate places. [2022-12-13 07:23:00,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:00,407 INFO L89 Accepts]: Start accepts. Operand has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:00,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:00,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:00,656 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:00,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-13 07:23:00,657 INFO L495 AbstractCegarLoop]: Abstraction has has 510 places, 2671 transitions, 305180 flow [2022-12-13 07:23:00,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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:23:00,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:00,657 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:00,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 07:23:00,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 07:23:00,859 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:23:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1706430591, now seen corresponding path program 45 times [2022-12-13 07:23:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:00,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368172265] [2022-12-13 07:23:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368172265] [2022-12-13 07:23:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368172265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563285605] [2022-12-13 07:23:00,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:23:00,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:00,919 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:00,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 07:23:01,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:23:01,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:23:01,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:23:01,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:01,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:01,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563285605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:01,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:01,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 07:23:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355170550] [2022-12-13 07:23:01,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:23:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:23:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:23:01,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:23:01,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 2671 transitions, 305180 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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:23:01,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:01,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:23:01,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:12,590 INFO L130 PetriNetUnfolder]: 2187/4380 cut-off events. [2022-12-13 07:23:12,590 INFO L131 PetriNetUnfolder]: For 15485/15485 co-relation queries the response was YES. [2022-12-13 07:23:12,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253781 conditions, 4380 events. 2187/4380 cut-off events. For 15485/15485 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 33802 event pairs, 0 based on Foata normal form. 4/3548 useless extension candidates. Maximal degree in co-relation 240426. Up to 4336 conditions per place. [2022-12-13 07:23:12,658 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2193 selfloop transitions, 471 changer transitions 18/2682 dead transitions. [2022-12-13 07:23:12,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 2682 transitions, 311807 flow [2022-12-13 07:23:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:23:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:23:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-12-13 07:23:12,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 07:23:12,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 503 predicate places. [2022-12-13 07:23:12,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 523 places, 2682 transitions, 311807 flow [2022-12-13 07:23:12,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 520 places, 2664 transitions, 309746 flow [2022-12-13 07:23:12,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:12,993 INFO L89 Accepts]: Start accepts. Operand has 520 places, 2664 transitions, 309746 flow [2022-12-13 07:23:13,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:13,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:13,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 520 places, 2664 transitions, 309746 flow [2022-12-13 07:23:13,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 520 places, 2664 transitions, 309746 flow [2022-12-13 07:23:13,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:13,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:13,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-13 07:23:13,264 INFO L495 AbstractCegarLoop]: Abstraction has has 520 places, 2664 transitions, 309746 flow [2022-12-13 07:23:13,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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:23:13,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:13,264 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:13,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-13 07:23:13,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-13 07:23:13,472 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:23:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1387860031, now seen corresponding path program 46 times [2022-12-13 07:23:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012721297] [2022-12-13 07:23:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:13,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012721297] [2022-12-13 07:23:13,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012721297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:13,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669328615] [2022-12-13 07:23:13,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:23:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:13,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:13,556 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-13 07:23:13,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:23:13,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:23:13,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:23:13,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:13,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:13,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669328615] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:13,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:13,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 07:23:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980913263] [2022-12-13 07:23:13,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:13,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:23:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:23:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:23:13,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:23:13,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 2664 transitions, 309746 flow. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:23:13,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:13,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:23:13,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:28,958 INFO L130 PetriNetUnfolder]: 2183/4408 cut-off events. [2022-12-13 07:23:28,958 INFO L131 PetriNetUnfolder]: For 14621/14621 co-relation queries the response was YES. [2022-12-13 07:23:28,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259905 conditions, 4408 events. 2183/4408 cut-off events. For 14621/14621 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 34402 event pairs, 0 based on Foata normal form. 8/3578 useless extension candidates. Maximal degree in co-relation 245964. Up to 4368 conditions per place. [2022-12-13 07:23:29,023 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2165 selfloop transitions, 514 changer transitions 33/2712 dead transitions. [2022-12-13 07:23:29,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2712 transitions, 320777 flow [2022-12-13 07:23:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 07:23:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 07:23:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 131 transitions. [2022-12-13 07:23:29,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33589743589743587 [2022-12-13 07:23:29,031 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 525 predicate places. [2022-12-13 07:23:29,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 545 places, 2712 transitions, 320777 flow [2022-12-13 07:23:29,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 544 places, 2679 transitions, 316859 flow [2022-12-13 07:23:29,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:29,326 INFO L89 Accepts]: Start accepts. Operand has 544 places, 2679 transitions, 316859 flow [2022-12-13 07:23:29,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:29,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:29,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 544 places, 2679 transitions, 316859 flow [2022-12-13 07:23:29,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 544 places, 2679 transitions, 316859 flow [2022-12-13 07:23:29,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:29,599 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:29,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-13 07:23:29,600 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 2679 transitions, 316859 flow [2022-12-13 07:23:29,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:23:29,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:29,600 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:29,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-13 07:23:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-13 07:23:29,805 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:23:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash -858604704, now seen corresponding path program 47 times [2022-12-13 07:23:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787348610] [2022-12-13 07:23:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:29,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787348610] [2022-12-13 07:23:29,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787348610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:29,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140119370] [2022-12-13 07:23:29,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:23:29,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:29,867 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:29,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 07:23:29,962 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:23:29,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:23:29,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:23:29,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:30,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:30,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140119370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:30,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:23:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488223614] [2022-12-13 07:23:30,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:23:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:23:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:23:30,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:23:30,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 2679 transitions, 316859 flow. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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:23:30,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:30,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:23:30,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:42,118 INFO L130 PetriNetUnfolder]: 2288/4585 cut-off events. [2022-12-13 07:23:42,118 INFO L131 PetriNetUnfolder]: For 14648/14648 co-relation queries the response was YES. [2022-12-13 07:23:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274945 conditions, 4585 events. 2288/4585 cut-off events. For 14648/14648 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 35916 event pairs, 0 based on Foata normal form. 0/3725 useless extension candidates. Maximal degree in co-relation 260769. Up to 4545 conditions per place. [2022-12-13 07:23:42,185 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2598 selfloop transitions, 213 changer transitions 0/2811 dead transitions. [2022-12-13 07:23:42,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:23:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:23:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 102 transitions. [2022-12-13 07:23:42,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 07:23:42,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 539 predicate places. [2022-12-13 07:23:42,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:42,409 INFO L89 Accepts]: Start accepts. Operand has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:42,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:42,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:42,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:42,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-13 07:23:42,690 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 2811 transitions, 338114 flow [2022-12-13 07:23:42,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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:23:42,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:42,690 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:42,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-13 07:23:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 07:23:42,894 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:23:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1571033471, now seen corresponding path program 48 times [2022-12-13 07:23:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634364487] [2022-12-13 07:23:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634364487] [2022-12-13 07:23:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634364487] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:42,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368224272] [2022-12-13 07:23:42,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:23:42,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:42,971 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:42,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 07:23:43,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:23:43,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:23:43,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:23:43,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:43,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368224272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:43,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:43,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:23:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644944767] [2022-12-13 07:23:43,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:23:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:23:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:23:43,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:23:43,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 2811 transitions, 338114 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:23:43,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:43,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:23:43,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:56,447 INFO L130 PetriNetUnfolder]: 2519/5036 cut-off events. [2022-12-13 07:23:56,447 INFO L131 PetriNetUnfolder]: For 13986/13986 co-relation queries the response was YES. [2022-12-13 07:23:56,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307085 conditions, 5036 events. 2519/5036 cut-off events. For 13986/13986 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 40116 event pairs, 0 based on Foata normal form. 20/4092 useless extension candidates. Maximal degree in co-relation 291690. Up to 4996 conditions per place. [2022-12-13 07:23:56,534 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2427 selfloop transitions, 610 changer transitions 46/3083 dead transitions. [2022-12-13 07:23:56,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 3083 transitions, 377049 flow [2022-12-13 07:23:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 07:23:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 07:23:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 144 transitions. [2022-12-13 07:23:56,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-13 07:23:56,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 564 predicate places. [2022-12-13 07:23:56,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 584 places, 3083 transitions, 377049 flow [2022-12-13 07:23:56,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 584 places, 3037 transitions, 371404 flow [2022-12-13 07:23:56,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:56,918 INFO L89 Accepts]: Start accepts. Operand has 584 places, 3037 transitions, 371404 flow [2022-12-13 07:23:57,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:57,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:57,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 584 places, 3037 transitions, 371404 flow [2022-12-13 07:23:57,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 584 places, 3037 transitions, 371404 flow [2022-12-13 07:23:57,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:57,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:57,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-13 07:23:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 3037 transitions, 371404 flow [2022-12-13 07:23:57,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:23:57,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:57,190 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:57,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-13 07:23:57,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 07:23:57,391 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:23:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 884205631, now seen corresponding path program 49 times [2022-12-13 07:23:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:57,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301224718] [2022-12-13 07:23:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:57,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301224718] [2022-12-13 07:23:57,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301224718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:57,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514124979] [2022-12-13 07:23:57,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:23:57,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:57,474 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-13 07:23:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:57,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:23:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:57,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:23:57,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514124979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:57,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:57,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:23:57,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363218254] [2022-12-13 07:23:57,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:57,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:23:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:57,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:23:57,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:23:57,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:23:57,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 3037 transitions, 371404 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:23:57,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:57,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:23:57,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:24:15,896 INFO L130 PetriNetUnfolder]: 2649/5310 cut-off events. [2022-12-13 07:24:15,896 INFO L131 PetriNetUnfolder]: For 14747/14747 co-relation queries the response was YES. [2022-12-13 07:24:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329138 conditions, 5310 events. 2649/5310 cut-off events. For 14747/14747 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 42525 event pairs, 0 based on Foata normal form. 36/4300 useless extension candidates. Maximal degree in co-relation 312117. Up to 5270 conditions per place. [2022-12-13 07:24:15,979 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2545 selfloop transitions, 680 changer transitions 36/3261 dead transitions. [2022-12-13 07:24:15,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 3261 transitions, 405371 flow [2022-12-13 07:24:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 07:24:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 07:24:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 161 transitions. [2022-12-13 07:24:15,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34623655913978496 [2022-12-13 07:24:15,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 591 predicate places. [2022-12-13 07:24:15,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 611 places, 3261 transitions, 405371 flow [2022-12-13 07:24:16,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 3225 transitions, 400880 flow [2022-12-13 07:24:16,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:16,285 INFO L89 Accepts]: Start accepts. Operand has 611 places, 3225 transitions, 400880 flow [2022-12-13 07:24:16,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:16,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:16,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 611 places, 3225 transitions, 400880 flow [2022-12-13 07:24:16,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 611 places, 3225 transitions, 400880 flow [2022-12-13 07:24:16,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:16,699 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:16,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 415 [2022-12-13 07:24:16,700 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 3225 transitions, 400880 flow [2022-12-13 07:24:16,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:24:16,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:16,700 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:24:16,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-13 07:24:16,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:16,900 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:24:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:24:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1958714037, now seen corresponding path program 50 times [2022-12-13 07:24:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:24:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338262355] [2022-12-13 07:24:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:24:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:24:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338262355] [2022-12-13 07:24:16,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338262355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:24:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888321285] [2022-12-13 07:24:16,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:24:16,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:24:16,984 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:24:16,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-13 07:24:17,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:24:17,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:24:17,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:24:17,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:24:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:17,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:24:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888321285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:24:17,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:24:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:24:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407185691] [2022-12-13 07:24:17,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:24:17,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:24:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:24:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:24:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:24:17,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:24:17,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 3225 transitions, 400880 flow. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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:24:17,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:24:17,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:24:17,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:24:33,202 INFO L130 PetriNetUnfolder]: 2642/5295 cut-off events. [2022-12-13 07:24:33,202 INFO L131 PetriNetUnfolder]: For 14019/14019 co-relation queries the response was YES. [2022-12-13 07:24:33,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333495 conditions, 5295 events. 2642/5295 cut-off events. For 14019/14019 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 42377 event pairs, 0 based on Foata normal form. 2/4271 useless extension candidates. Maximal degree in co-relation 315947. Up to 5255 conditions per place. [2022-12-13 07:24:33,287 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 2785 selfloop transitions, 462 changer transitions 2/3249 dead transitions. [2022-12-13 07:24:33,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 3249 transitions, 410354 flow [2022-12-13 07:24:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:24:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:24:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 124 transitions. [2022-12-13 07:24:33,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2022-12-13 07:24:33,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 609 predicate places. [2022-12-13 07:24:33,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 629 places, 3249 transitions, 410354 flow [2022-12-13 07:24:33,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 629 places, 3247 transitions, 410102 flow [2022-12-13 07:24:33,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:33,701 INFO L89 Accepts]: Start accepts. Operand has 629 places, 3247 transitions, 410102 flow [2022-12-13 07:24:33,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:33,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:33,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 629 places, 3247 transitions, 410102 flow [2022-12-13 07:24:34,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 629 places, 3247 transitions, 410102 flow [2022-12-13 07:24:34,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:34,153 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:34,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 452 [2022-12-13 07:24:34,153 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 3247 transitions, 410102 flow [2022-12-13 07:24:34,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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:24:34,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:34,154 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:24:34,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-13 07:24:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:34,354 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:24:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:24:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1072399648, now seen corresponding path program 51 times [2022-12-13 07:24:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:24:34,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011100923] [2022-12-13 07:24:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:24:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:24:34,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011100923] [2022-12-13 07:24:34,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011100923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:24:34,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111032292] [2022-12-13 07:24:34,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:24:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:24:34,417 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:24:34,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-13 07:24:34,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 07:24:34,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:24:34,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:24:34,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:24:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:34,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:24:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:24:34,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111032292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:24:34,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:24:34,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:24:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522565768] [2022-12-13 07:24:34,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:24:34,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:24:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:24:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:24:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:24:34,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:24:34,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 3247 transitions, 410102 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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:24:34,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:24:34,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:24:34,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:24:58,716 INFO L130 PetriNetUnfolder]: 2955/5954 cut-off events. [2022-12-13 07:24:58,717 INFO L131 PetriNetUnfolder]: For 14147/14147 co-relation queries the response was YES. [2022-12-13 07:24:58,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381045 conditions, 5954 events. 2955/5954 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 48699 event pairs, 0 based on Foata normal form. 8/4770 useless extension candidates. Maximal degree in co-relation 360124. Up to 5914 conditions per place. [2022-12-13 07:24:58,828 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2919 selfloop transitions, 726 changer transitions 8/3653 dead transitions. [2022-12-13 07:24:58,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 3653 transitions, 468798 flow [2022-12-13 07:24:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:24:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 07:24:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 161 transitions. [2022-12-13 07:24:58,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35777777777777775 [2022-12-13 07:24:58,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 638 predicate places. [2022-12-13 07:24:58,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 658 places, 3653 transitions, 468798 flow [2022-12-13 07:24:59,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 657 places, 3645 transitions, 467774 flow [2022-12-13 07:24:59,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:59,216 INFO L89 Accepts]: Start accepts. Operand has 657 places, 3645 transitions, 467774 flow [2022-12-13 07:24:59,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:59,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:59,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 657 places, 3645 transitions, 467774 flow [2022-12-13 07:24:59,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 657 places, 3645 transitions, 467774 flow [2022-12-13 07:24:59,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:59,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:59,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 667 [2022-12-13 07:24:59,883 INFO L495 AbstractCegarLoop]: Abstraction has has 657 places, 3645 transitions, 467774 flow [2022-12-13 07:24:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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:24:59,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:59,884 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:24:59,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-12-13 07:25:00,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:25:00,084 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:25:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:25:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1071210356, now seen corresponding path program 52 times [2022-12-13 07:25:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:25:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700626436] [2022-12-13 07:25:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:25:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:25:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:25:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:25:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700626436] [2022-12-13 07:25:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700626436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:25:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638649973] [2022-12-13 07:25:00,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:25:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:25:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:25:00,149 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:25:00,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-13 07:25:00,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:25:00,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:25:00,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:25:00,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:25:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:00,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:25:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:00,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638649973] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:25:00,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:25:00,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:25:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524578422] [2022-12-13 07:25:00,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:25:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:25:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:25:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:25:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:25:00,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:25:00,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 3645 transitions, 467774 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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:25:00,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:25:00,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:25:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:25:25,930 INFO L130 PetriNetUnfolder]: 2940/5917 cut-off events. [2022-12-13 07:25:25,930 INFO L131 PetriNetUnfolder]: For 14157/14157 co-relation queries the response was YES. [2022-12-13 07:25:25,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384593 conditions, 5917 events. 2940/5917 cut-off events. For 14157/14157 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 48359 event pairs, 0 based on Foata normal form. 0/4769 useless extension candidates. Maximal degree in co-relation 364002. Up to 5877 conditions per place. [2022-12-13 07:25:26,028 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3249 selfloop transitions, 376 changer transitions 0/3625 dead transitions. [2022-12-13 07:25:26,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:25:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:25:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2022-12-13 07:25:26,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 07:25:26,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 656 predicate places. [2022-12-13 07:25:26,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:25:26,387 INFO L89 Accepts]: Start accepts. Operand has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:25:26,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:25:26,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:25:26,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:25:26,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 583 [2022-12-13 07:25:26,970 INFO L495 AbstractCegarLoop]: Abstraction has has 676 places, 3625 transitions, 472458 flow [2022-12-13 07:25:26,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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:25:26,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:25:26,971 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:25:26,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-13 07:25:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-13 07:25:27,171 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:25:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:25:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1018183778, now seen corresponding path program 53 times [2022-12-13 07:25:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:25:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759104052] [2022-12-13 07:25:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:25:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:25:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:25:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:25:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759104052] [2022-12-13 07:25:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759104052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:25:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432129920] [2022-12-13 07:25:27,248 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:25:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:25:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:25:27,250 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:25:27,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 07:25:27,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:25:27,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:25:27,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:25:27,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:25:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:27,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:25:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432129920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:25:27,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:25:27,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 07:25:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479687466] [2022-12-13 07:25:27,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:25:27,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:25:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:25:27,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:25:27,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:25:27,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:25:27,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 3625 transitions, 472458 flow. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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:25:27,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:25:27,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:25:27,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:25:54,021 INFO L130 PetriNetUnfolder]: 3387/6736 cut-off events. [2022-12-13 07:25:54,021 INFO L131 PetriNetUnfolder]: For 14971/14971 co-relation queries the response was YES. [2022-12-13 07:25:54,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444634 conditions, 6736 events. 3387/6736 cut-off events. For 14971/14971 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 55844 event pairs, 0 based on Foata normal form. 0/5492 useless extension candidates. Maximal degree in co-relation 423728. Up to 6696 conditions per place. [2022-12-13 07:25:54,137 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3847 selfloop transitions, 246 changer transitions 0/4093 dead transitions. [2022-12-13 07:25:54,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 07:25:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 07:25:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 128 transitions. [2022-12-13 07:25:54,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-13 07:25:54,139 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 675 predicate places. [2022-12-13 07:25:54,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:54,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:54,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:25:54,581 INFO L89 Accepts]: Start accepts. Operand has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:54,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:25:54,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:25:54,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:55,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:55,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:25:55,385 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:25:55,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 805 [2022-12-13 07:25:55,385 INFO L495 AbstractCegarLoop]: Abstraction has has 695 places, 4093 transitions, 541691 flow [2022-12-13 07:25:55,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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:25:55,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:25:55,386 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:25:55,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-13 07:25:55,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-12-13 07:25:55,586 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:25:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:25:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1791434840, now seen corresponding path program 54 times [2022-12-13 07:25:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:25:55,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797580685] [2022-12-13 07:25:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:25:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:25:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:25:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:55,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:25:55,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797580685] [2022-12-13 07:25:55,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797580685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:25:55,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208029433] [2022-12-13 07:25:55,662 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:25:55,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:25:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:25:55,664 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:25:55,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-13 07:25:55,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:25:55,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:25:55,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:25:55,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:25:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:55,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:25:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:25:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208029433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:25:55,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:25:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 07:25:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345509734] [2022-12-13 07:25:55,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:25:55,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:25:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:25:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:25:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:25:55,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:25:55,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 4093 transitions, 541691 flow. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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:25:55,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:25:55,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:25:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:26:35,516 INFO L130 PetriNetUnfolder]: 3859/7656 cut-off events. [2022-12-13 07:26:35,516 INFO L131 PetriNetUnfolder]: For 14398/14398 co-relation queries the response was YES. [2022-12-13 07:26:35,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513101 conditions, 7656 events. 3859/7656 cut-off events. For 14398/14398 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 64935 event pairs, 0 based on Foata normal form. 16/6218 useless extension candidates. Maximal degree in co-relation 489045. Up to 7616 conditions per place. [2022-12-13 07:26:35,700 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3535 selfloop transitions, 1078 changer transitions 25/4638 dead transitions. [2022-12-13 07:26:35,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 4638 transitions, 623177 flow [2022-12-13 07:26:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 07:26:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 07:26:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 169 transitions. [2022-12-13 07:26:35,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3414141414141414 [2022-12-13 07:26:35,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 707 predicate places. [2022-12-13 07:26:35,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 727 places, 4638 transitions, 623177 flow [2022-12-13 07:26:36,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 726 places, 4613 transitions, 619827 flow [2022-12-13 07:26:36,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:26:36,256 INFO L89 Accepts]: Start accepts. Operand has 726 places, 4613 transitions, 619827 flow [2022-12-13 07:26:36,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:26:36,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:26:36,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 726 places, 4613 transitions, 619827 flow [2022-12-13 07:26:36,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 726 places, 4613 transitions, 619827 flow [2022-12-13 07:26:36,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:26:36,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:26:36,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-13 07:26:36,808 INFO L495 AbstractCegarLoop]: Abstraction has has 726 places, 4613 transitions, 619827 flow [2022-12-13 07:26:36,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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:26:36,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:26:36,808 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:26:36,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-12-13 07:26:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:26:37,010 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:26:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:26:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1487997346, now seen corresponding path program 55 times [2022-12-13 07:26:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:26:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475247733] [2022-12-13 07:26:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:26:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:26:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:26:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:26:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:26:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475247733] [2022-12-13 07:26:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475247733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:26:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646019007] [2022-12-13 07:26:37,079 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:26:37,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:26:37,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:26:37,081 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:26:37,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-13 07:26:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:26:37,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:26:37,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:26:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:26:37,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:26:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:26:37,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646019007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:26:37,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:26:37,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 15 [2022-12-13 07:26:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497207883] [2022-12-13 07:26:37,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:26:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:26:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:26:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:26:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:26:37,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:26:37,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 4613 transitions, 619827 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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:26:37,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:26:37,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:26:37,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:27:17,414 INFO L130 PetriNetUnfolder]: 3895/7716 cut-off events. [2022-12-13 07:27:17,414 INFO L131 PetriNetUnfolder]: For 14416/14416 co-relation queries the response was YES. [2022-12-13 07:27:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524846 conditions, 7716 events. 3895/7716 cut-off events. For 14416/14416 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 65469 event pairs, 0 based on Foata normal form. 4/6332 useless extension candidates. Maximal degree in co-relation 501529. Up to 7676 conditions per place. [2022-12-13 07:27:17,550 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3924 selfloop transitions, 741 changer transitions 4/4669 dead transitions. [2022-12-13 07:27:17,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 4669 transitions, 636693 flow [2022-12-13 07:27:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 07:27:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 07:27:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 141 transitions. [2022-12-13 07:27:17,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40869565217391307 [2022-12-13 07:27:17,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 724 predicate places. [2022-12-13 07:27:17,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 744 places, 4669 transitions, 636693 flow [2022-12-13 07:27:17,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 744 places, 4665 transitions, 636146 flow [2022-12-13 07:27:18,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:27:18,201 INFO L89 Accepts]: Start accepts. Operand has 744 places, 4665 transitions, 636146 flow [2022-12-13 07:27:18,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:27:18,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:27:18,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 744 places, 4665 transitions, 636146 flow [2022-12-13 07:27:18,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 744 places, 4665 transitions, 636146 flow [2022-12-13 07:27:18,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:27:18,822 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:27:18,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 622 [2022-12-13 07:27:18,823 INFO L495 AbstractCegarLoop]: Abstraction has has 744 places, 4665 transitions, 636146 flow [2022-12-13 07:27:18,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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:27:18,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:27:18,823 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:27:18,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-13 07:27:19,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:27:19,028 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:27:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:27:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1426911648, now seen corresponding path program 56 times [2022-12-13 07:27:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:27:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141439959] [2022-12-13 07:27:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:27:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:27:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:27:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:27:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:27:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141439959] [2022-12-13 07:27:19,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141439959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:27:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246187086] [2022-12-13 07:27:19,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:27:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:27:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:27:19,124 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:27:19,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-13 07:27:19,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:27:19,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:27:19,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:27:19,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:27:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:27:19,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:27:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:27:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246187086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:27:19,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:27:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 17 [2022-12-13 07:27:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381677277] [2022-12-13 07:27:19,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:27:19,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:27:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:27:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:27:19,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:27:19,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:27:19,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 4665 transitions, 636146 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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:27:19,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:27:19,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:27:19,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:28:11,944 INFO L130 PetriNetUnfolder]: 4416/8833 cut-off events. [2022-12-13 07:28:11,945 INFO L131 PetriNetUnfolder]: For 14569/14569 co-relation queries the response was YES. [2022-12-13 07:28:11,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609757 conditions, 8833 events. 4416/8833 cut-off events. For 14569/14569 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 77453 event pairs, 0 based on Foata normal form. 6/7175 useless extension candidates. Maximal degree in co-relation 579983. Up to 8793 conditions per place. [2022-12-13 07:28:12,106 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 4122 selfloop transitions, 1255 changer transitions 6/5383 dead transitions. [2022-12-13 07:28:12,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 5383 transitions, 744926 flow [2022-12-13 07:28:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 07:28:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 07:28:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 178 transitions. [2022-12-13 07:28:12,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3296296296296296 [2022-12-13 07:28:12,107 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 759 predicate places. [2022-12-13 07:28:12,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 779 places, 5383 transitions, 744926 flow [2022-12-13 07:28:12,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 779 places, 5377 transitions, 744098 flow [2022-12-13 07:28:12,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:28:12,875 INFO L89 Accepts]: Start accepts. Operand has 779 places, 5377 transitions, 744098 flow [2022-12-13 07:28:13,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:28:13,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:28:13,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 779 places, 5377 transitions, 744098 flow [2022-12-13 07:28:13,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 779 places, 5377 transitions, 744098 flow [2022-12-13 07:28:13,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:28:13,509 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:28:13,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 635 [2022-12-13 07:28:13,510 INFO L495 AbstractCegarLoop]: Abstraction has has 779 places, 5377 transitions, 744098 flow [2022-12-13 07:28:13,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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:28:13,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:28:13,510 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:28:13,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-13 07:28:13,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-13 07:28:13,715 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:28:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:28:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1463779700, now seen corresponding path program 57 times [2022-12-13 07:28:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:28:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040156979] [2022-12-13 07:28:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:28:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:28:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:28:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:28:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:28:13,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040156979] [2022-12-13 07:28:13,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040156979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:28:13,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300800481] [2022-12-13 07:28:13,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:28:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:28:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:28:13,780 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:28:13,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-13 07:28:13,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:28:13,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:28:13,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:28:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:28:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:28:13,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:28:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:28:13,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300800481] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:28:13,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:28:13,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:28:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46698380] [2022-12-13 07:28:13,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:28:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:28:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:28:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:28:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:28:13,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:28:13,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 5377 transitions, 744098 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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:28:13,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:28:13,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:28:13,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:29:16,574 INFO L130 PetriNetUnfolder]: 4582/9195 cut-off events. [2022-12-13 07:29:16,574 INFO L131 PetriNetUnfolder]: For 14613/14613 co-relation queries the response was YES. [2022-12-13 07:29:16,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643971 conditions, 9195 events. 4582/9195 cut-off events. For 14613/14613 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 81253 event pairs, 0 based on Foata normal form. 6/7445 useless extension candidates. Maximal degree in co-relation 611653. Up to 9155 conditions per place. [2022-12-13 07:29:16,729 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 4250 selfloop transitions, 1356 changer transitions 10/5616 dead transitions. [2022-12-13 07:29:16,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 5616 transitions, 788432 flow [2022-12-13 07:29:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 07:29:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 07:29:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 164 transitions. [2022-12-13 07:29:16,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3215686274509804 [2022-12-13 07:29:16,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 792 predicate places. [2022-12-13 07:29:16,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 812 places, 5616 transitions, 788432 flow [2022-12-13 07:29:17,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 810 places, 5606 transitions, 787032 flow [2022-12-13 07:29:17,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:29:17,460 INFO L89 Accepts]: Start accepts. Operand has 810 places, 5606 transitions, 787032 flow [2022-12-13 07:29:17,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:29:17,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:29:17,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 810 places, 5606 transitions, 787032 flow [2022-12-13 07:29:18,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 810 places, 5606 transitions, 787032 flow [2022-12-13 07:29:18,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:29:18,114 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:29:18,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 655 [2022-12-13 07:29:18,115 INFO L495 AbstractCegarLoop]: Abstraction has has 810 places, 5606 transitions, 787032 flow [2022-12-13 07:29:18,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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:29:18,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:29:18,115 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:29:18,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-12-13 07:29:18,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-13 07:29:18,316 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:29:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:29:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1425722356, now seen corresponding path program 58 times [2022-12-13 07:29:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:29:18,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344538018] [2022-12-13 07:29:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:29:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:29:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:29:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:29:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:29:18,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344538018] [2022-12-13 07:29:18,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344538018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:29:18,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435070068] [2022-12-13 07:29:18,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:29:18,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:29:18,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:29:18,377 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:29:18,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-13 07:29:18,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:29:18,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:29:18,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:29:18,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:29:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:29:18,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:29:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:29:18,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435070068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:29:18,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:29:18,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 17 [2022-12-13 07:29:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025923413] [2022-12-13 07:29:18,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:29:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:29:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:29:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:29:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:29:18,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:29:18,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 5606 transitions, 787032 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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:29:18,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:29:18,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:29:18,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:30:24,327 INFO L130 PetriNetUnfolder]: 4925/9916 cut-off events. [2022-12-13 07:30:24,327 INFO L131 PetriNetUnfolder]: For 15514/15514 co-relation queries the response was YES. [2022-12-13 07:30:24,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704448 conditions, 9916 events. 4925/9916 cut-off events. For 15514/15514 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 88974 event pairs, 0 based on Foata normal form. 0/8058 useless extension candidates. Maximal degree in co-relation 669240. Up to 9876 conditions per place. [2022-12-13 07:30:24,525 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 4978 selfloop transitions, 1070 changer transitions 0/6048 dead transitions. [2022-12-13 07:30:24,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 07:30:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 07:30:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 155 transitions. [2022-12-13 07:30:24,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 07:30:24,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 811 predicate places. [2022-12-13 07:30:24,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:25,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:25,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:30:25,342 INFO L89 Accepts]: Start accepts. Operand has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:25,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:30:25,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:30:25,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:26,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:26,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:30:26,479 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:30:26,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1139 [2022-12-13 07:30:26,480 INFO L495 AbstractCegarLoop]: Abstraction has has 831 places, 6048 transitions, 861278 flow [2022-12-13 07:30:26,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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:30:26,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:30:26,480 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:30:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-12-13 07:30:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:30:26,686 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:30:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:30:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1688277984, now seen corresponding path program 59 times [2022-12-13 07:30:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:30:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955169877] [2022-12-13 07:30:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:30:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:30:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:30:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:30:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:30:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955169877] [2022-12-13 07:30:26,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955169877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:30:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023603954] [2022-12-13 07:30:26,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:30:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:30:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:30:26,761 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:30:26,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-13 07:30:26,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:30:26,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:30:26,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:30:26,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:30:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:30:26,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:30:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:30:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023603954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:30:26,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:30:26,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-12-13 07:30:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207017997] [2022-12-13 07:30:26,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:30:26,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:30:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:30:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:30:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:30:26,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:30:26,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 6048 transitions, 861278 flow. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 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:30:26,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:30:26,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:30:26,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:45,432 INFO L130 PetriNetUnfolder]: 5145/10372 cut-off events. [2022-12-13 07:31:45,433 INFO L131 PetriNetUnfolder]: For 14871/14871 co-relation queries the response was YES. [2022-12-13 07:31:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747241 conditions, 10372 events. 5145/10372 cut-off events. For 14871/14871 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 93804 event pairs, 0 based on Foata normal form. 6/8406 useless extension candidates. Maximal degree in co-relation 709365. Up to 10332 conditions per place. [2022-12-13 07:31:45,615 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 4830 selfloop transitions, 1491 changer transitions 14/6335 dead transitions. [2022-12-13 07:31:45,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 6335 transitions, 914834 flow [2022-12-13 07:31:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 07:31:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 07:31:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 142 transitions. [2022-12-13 07:31:45,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3053763440860215 [2022-12-13 07:31:45,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 841 predicate places. [2022-12-13 07:31:45,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 861 places, 6335 transitions, 914834 flow [2022-12-13 07:31:46,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 858 places, 6321 transitions, 912818 flow [2022-12-13 07:31:46,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:46,378 INFO L89 Accepts]: Start accepts. Operand has 858 places, 6321 transitions, 912818 flow [2022-12-13 07:31:47,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:47,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:47,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 858 places, 6321 transitions, 912818 flow [2022-12-13 07:31:47,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 858 places, 6321 transitions, 912818 flow [2022-12-13 07:31:47,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:47,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:47,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1093 [2022-12-13 07:31:47,471 INFO L495 AbstractCegarLoop]: Abstraction has has 858 places, 6321 transitions, 912818 flow [2022-12-13 07:31:47,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 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:31:47,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:47,471 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:47,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-12-13 07:31:47,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-12-13 07:31:47,676 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:31:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1283200384, now seen corresponding path program 60 times [2022-12-13 07:31:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072887688] [2022-12-13 07:31:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:47,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072887688] [2022-12-13 07:31:47,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072887688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749984120] [2022-12-13 07:31:47,735 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:31:47,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:47,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:47,737 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:47,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-13 07:31:47,853 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 07:31:47,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:47,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:31:47,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:47,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:47,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749984120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:47,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:47,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2022-12-13 07:31:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45660323] [2022-12-13 07:31:47,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:31:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:31:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:31:47,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:31:47,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 6321 transitions, 912818 flow. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:31:47,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:47,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:31:47,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:33:18,712 INFO L130 PetriNetUnfolder]: 5760/11673 cut-off events. [2022-12-13 07:33:18,712 INFO L131 PetriNetUnfolder]: For 15093/15093 co-relation queries the response was YES. [2022-12-13 07:33:18,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852737 conditions, 11673 events. 5760/11673 cut-off events. For 15093/15093 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 107988 event pairs, 0 based on Foata normal form. 0/9409 useless extension candidates. Maximal degree in co-relation 807576. Up to 11633 conditions per place. [2022-12-13 07:33:19,052 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 6609 selfloop transitions, 541 changer transitions 0/7150 dead transitions. [2022-12-13 07:33:19,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:33:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:33:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 131 transitions. [2022-12-13 07:33:19,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4158730158730159 [2022-12-13 07:33:19,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 858 predicate places. [2022-12-13 07:33:19,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:19,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:19,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:33:19,935 INFO L89 Accepts]: Start accepts. Operand has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:20,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:33:20,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:33:20,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:20,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:20,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:33:20,827 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:33:20,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 893 [2022-12-13 07:33:20,828 INFO L495 AbstractCegarLoop]: Abstraction has has 878 places, 7150 transitions, 1046944 flow [2022-12-13 07:33:20,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:33:20,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:33:20,828 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:33:20,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-12-13 07:33:21,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:21,029 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:33:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:33:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 113883872, now seen corresponding path program 61 times [2022-12-13 07:33:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:33:21,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846535587] [2022-12-13 07:33:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:33:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:33:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:21,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:33:21,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846535587] [2022-12-13 07:33:21,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846535587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:33:21,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074138263] [2022-12-13 07:33:21,088 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:33:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:33:21,090 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:33:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-13 07:33:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:21,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:33:21,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:33:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:21,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:33:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:21,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074138263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:33:21,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:33:21,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-13 07:33:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620140455] [2022-12-13 07:33:21,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:33:21,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:33:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:33:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:33:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:33:21,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:33:21,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 7150 transitions, 1046944 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 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:33:21,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:33:21,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:33:21,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:34:34,677 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:34:34,677 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:34:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 07:34:34,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 07:34:34,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-12-13 07:34:34,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:34:34,894 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/15 universal loopers) in iteration 73,while PetriNetUnfolder was constructing finite prefix that currently has 701514 conditions, 9480 events (5155/9479 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 83939 event pairs, 0 based on Foata normal form. 14/8017 useless extension candidates. Maximal degree in co-relation 699544. Up to 9439 conditions per place.). [2022-12-13 07:34:34,896 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 07:34:34,896 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 07:34:34,896 INFO L445 BasicCegarLoop]: Path program histogram: [61, 6, 4, 2] [2022-12-13 07:34:34,900 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:34:34,900 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:34:34,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:34:34 BasicIcfg [2022-12-13 07:34:34,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:34:34,902 INFO L158 Benchmark]: Toolchain (without parser) took 835555.58ms. Allocated memory was 204.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 180.9MB in the beginning and 531.9MB in the end (delta: -351.1MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory was 180.5MB in the beginning and 180.4MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.34ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 169.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.14ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: Boogie Preprocessor took 33.93ms. Allocated memory is still 204.5MB. Free memory was 167.2MB in the beginning and 165.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: RCFGBuilder took 464.90ms. Allocated memory is still 204.5MB. Free memory was 165.7MB in the beginning and 148.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 07:34:34,902 INFO L158 Benchmark]: TraceAbstraction took 834730.53ms. Allocated memory was 204.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 147.3MB in the beginning and 531.9MB in the end (delta: -384.6MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 07:34:34,903 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.12ms. Allocated memory is still 204.5MB. Free memory was 180.5MB in the beginning and 180.4MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.34ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 169.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.14ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.93ms. Allocated memory is still 204.5MB. Free memory was 167.2MB in the beginning and 165.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 464.90ms. Allocated memory is still 204.5MB. Free memory was 165.7MB in the beginning and 148.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 834730.53ms. Allocated memory was 204.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 147.3MB in the beginning and 531.9MB in the end (delta: -384.6MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 172 PlacesBefore, 20 PlacesAfterwards, 179 TransitionsBefore, 15 TransitionsAfterwards, 7452 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 99 ConcurrentYvCompositions, 12 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4839, independent: 4839, independent conditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4839, independent: 525, independent conditional: 0, independent unconditional: 525, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4314, unknown conditional: 0, unknown unconditional: 4314] , Statistics on independence cache: Total cache size (in pairs): 8931, Positive cache size: 8931, Positive conditional cache size: 0, Positive unconditional cache size: 8931, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 23 PlacesBefore, 23 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 40 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 26 PlacesBefore, 26 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 42 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 30 PlacesBefore, 30 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 34 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 92 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 37 PlacesBefore, 37 PlacesAfterwards, 89 TransitionsBefore, 89 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 41 PlacesBefore, 41 PlacesAfterwards, 99 TransitionsBefore, 99 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 48 PlacesBefore, 48 PlacesAfterwards, 104 TransitionsBefore, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 52 PlacesBefore, 52 PlacesAfterwards, 94 TransitionsBefore, 94 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 56 PlacesBefore, 56 PlacesAfterwards, 98 TransitionsBefore, 98 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 101 TransitionsBefore, 101 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 86 TransitionsBefore, 86 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 64 PlacesBefore, 64 PlacesAfterwards, 82 TransitionsBefore, 82 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 120 TransitionsBefore, 120 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 74 PlacesBefore, 74 PlacesAfterwards, 133 TransitionsBefore, 133 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 79 PlacesBefore, 79 PlacesAfterwards, 131 TransitionsBefore, 131 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 84 PlacesBefore, 84 PlacesAfterwards, 155 TransitionsBefore, 155 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 168 TransitionsBefore, 168 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 166 TransitionsBefore, 166 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 101 PlacesBefore, 101 PlacesAfterwards, 188 TransitionsBefore, 188 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 109 PlacesBefore, 109 PlacesAfterwards, 206 TransitionsBefore, 206 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 126 PlacesBefore, 126 PlacesAfterwards, 281 TransitionsBefore, 281 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 141 PlacesBefore, 141 PlacesAfterwards, 264 TransitionsBefore, 264 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 152 PlacesBefore, 152 PlacesAfterwards, 282 TransitionsBefore, 282 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 171 PlacesBefore, 171 PlacesAfterwards, 442 TransitionsBefore, 442 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 182 PlacesBefore, 182 PlacesAfterwards, 438 TransitionsBefore, 438 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 202 PlacesBefore, 202 PlacesAfterwards, 600 TransitionsBefore, 600 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 215 PlacesBefore, 215 PlacesAfterwards, 682 TransitionsBefore, 682 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 232 PlacesBefore, 232 PlacesAfterwards, 758 TransitionsBefore, 758 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 238 PlacesBefore, 238 PlacesAfterwards, 810 TransitionsBefore, 810 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 250 PlacesBefore, 250 PlacesAfterwards, 924 TransitionsBefore, 924 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 268 PlacesBefore, 268 PlacesAfterwards, 1012 TransitionsBefore, 1012 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 276 PlacesBefore, 276 PlacesAfterwards, 1009 TransitionsBefore, 1009 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 286 PlacesBefore, 286 PlacesAfterwards, 1046 TransitionsBefore, 1046 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 298 PlacesBefore, 298 PlacesAfterwards, 1228 TransitionsBefore, 1228 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 317 PlacesBefore, 317 PlacesAfterwards, 1313 TransitionsBefore, 1313 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 330 PlacesBefore, 330 PlacesAfterwards, 1307 TransitionsBefore, 1307 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 349 PlacesBefore, 349 PlacesAfterwards, 1336 TransitionsBefore, 1336 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 361 PlacesBefore, 361 PlacesAfterwards, 1317 TransitionsBefore, 1317 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 374 PlacesBefore, 374 PlacesAfterwards, 1485 TransitionsBefore, 1485 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 386 PlacesBefore, 386 PlacesAfterwards, 1451 TransitionsBefore, 1451 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 397 PlacesBefore, 397 PlacesAfterwards, 1438 TransitionsBefore, 1438 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 406 PlacesBefore, 406 PlacesAfterwards, 1507 TransitionsBefore, 1507 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 414 PlacesBefore, 414 PlacesAfterwards, 1647 TransitionsBefore, 1647 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 421 PlacesBefore, 421 PlacesAfterwards, 1613 TransitionsBefore, 1613 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 430 PlacesBefore, 430 PlacesAfterwards, 1589 TransitionsBefore, 1589 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 436 PlacesBefore, 436 PlacesAfterwards, 1625 TransitionsBefore, 1625 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 442 PlacesBefore, 442 PlacesAfterwards, 1687 TransitionsBefore, 1687 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 448 PlacesBefore, 448 PlacesAfterwards, 1663 TransitionsBefore, 1663 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 457 PlacesBefore, 457 PlacesAfterwards, 1771 TransitionsBefore, 1771 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 464 PlacesBefore, 464 PlacesAfterwards, 1905 TransitionsBefore, 1905 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 472 PlacesBefore, 472 PlacesAfterwards, 2050 TransitionsBefore, 2050 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 480 PlacesBefore, 480 PlacesAfterwards, 2032 TransitionsBefore, 2032 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 489 PlacesBefore, 489 PlacesAfterwards, 2014 TransitionsBefore, 2014 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 496 PlacesBefore, 496 PlacesAfterwards, 1990 TransitionsBefore, 1990 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 502 PlacesBefore, 502 PlacesAfterwards, 1960 TransitionsBefore, 1960 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 510 PlacesBefore, 510 PlacesAfterwards, 2671 TransitionsBefore, 2671 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 520 PlacesBefore, 520 PlacesAfterwards, 2664 TransitionsBefore, 2664 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 544 PlacesBefore, 544 PlacesAfterwards, 2679 TransitionsBefore, 2679 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 559 PlacesBefore, 559 PlacesAfterwards, 2811 TransitionsBefore, 2811 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 584 PlacesBefore, 584 PlacesAfterwards, 3037 TransitionsBefore, 3037 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 611 PlacesBefore, 611 PlacesAfterwards, 3225 TransitionsBefore, 3225 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 629 PlacesBefore, 629 PlacesAfterwards, 3247 TransitionsBefore, 3247 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 657 PlacesBefore, 657 PlacesAfterwards, 3645 TransitionsBefore, 3645 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 676 PlacesBefore, 676 PlacesAfterwards, 3625 TransitionsBefore, 3625 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 695 PlacesBefore, 695 PlacesAfterwards, 4093 TransitionsBefore, 4093 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 726 PlacesBefore, 726 PlacesAfterwards, 4613 TransitionsBefore, 4613 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 744 PlacesBefore, 744 PlacesAfterwards, 4665 TransitionsBefore, 4665 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 779 PlacesBefore, 779 PlacesAfterwards, 5377 TransitionsBefore, 5377 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 810 PlacesBefore, 810 PlacesAfterwards, 5606 TransitionsBefore, 5606 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 831 PlacesBefore, 831 PlacesAfterwards, 6048 TransitionsBefore, 6048 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 858 PlacesBefore, 858 PlacesAfterwards, 6321 TransitionsBefore, 6321 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 878 PlacesBefore, 878 PlacesAfterwards, 7150 TransitionsBefore, 7150 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/15 universal loopers) in iteration 73,while PetriNetUnfolder was constructing finite prefix that currently has 701514 conditions, 9480 events (5155/9479 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 83939 event pairs, 0 based on Foata normal form. 14/8017 useless extension candidates. Maximal degree in co-relation 699544. Up to 9439 conditions per place.). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/15 universal loopers) in iteration 73,while PetriNetUnfolder was constructing finite prefix that currently has 701514 conditions, 9480 events (5155/9479 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 83939 event pairs, 0 based on Foata normal form. 14/8017 useless extension candidates. Maximal degree in co-relation 699544. Up to 9439 conditions per place.). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/15 universal loopers) in iteration 73,while PetriNetUnfolder was constructing finite prefix that currently has 701514 conditions, 9480 events (5155/9479 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 83939 event pairs, 0 based on Foata normal form. 14/8017 useless extension candidates. Maximal degree in co-relation 699544. Up to 9439 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 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: 834.6s, OverallIterations: 73, TraceHistogramMax: 3, PathProgramHistogramMax: 61, EmptinessCheckTime: 0.0s, AutomataDifference: 765.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5278 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5278 mSDsluCounter, 602 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 926 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22659 IncrementalHoareTripleChecker+Invalid, 23585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 926 mSolverCounterUnsat, 205 mSDtfsCounter, 22659 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3647 GetRequests, 1977 SyntacticMatches, 257 SemanticMatches, 1413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9383 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046944occurred in iteration=72, InterpolantAutomatonStates: 1035, 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.8s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 213 NumberOfCheckSat, 3187 ConstructedInterpolants, 0 QuantifiedInterpolants, 20342 SizeOfPredicates, 677 NumberOfNonLiveVariables, 16262 ConjunctsInSsa, 1738 ConjunctsInUnsatCore, 207 InterpolantComputations, 6 PerfectInterpolantSequences, 327/1072 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown