/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:56:05,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:56:05,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:56:05,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:56:05,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:56:05,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:56:05,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:56:05,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:56:05,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:56:05,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:56:05,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:56:05,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:56:05,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:56:05,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:56:05,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:56:05,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:56:05,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:56:05,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:56:05,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:56:05,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:56:05,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:56:05,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:56:05,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:56:05,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:56:05,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:56:05,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:56:05,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:56:05,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:56:05,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:56:05,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:56:05,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:56:05,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:56:05,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:56:05,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:56:05,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:56:05,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:56:05,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:56:05,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:56:05,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:56:05,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:56:05,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:56:05,735 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:56:05,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:56:05,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:56:05,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:56:05,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:56:05,764 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:56:05,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:56:05,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:56:05,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:56:05,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:56:05,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:56:05,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:56:05,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:56:05,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:56:05,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:56:05,767 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 [2022-12-06 07:56:06,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:56:06,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:56:06,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:56:06,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:56:06,094 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:56:06,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-06 07:56:07,183 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:56:07,364 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:56:07,365 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-06 07:56:07,370 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a6bbcff/2e18f3424ef8465281be419bc294736f/FLAG12d93e9c3 [2022-12-06 07:56:07,386 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a6bbcff/2e18f3424ef8465281be419bc294736f [2022-12-06 07:56:07,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:56:07,388 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:56:07,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:56:07,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:56:07,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:56:07,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfaf31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07, skipping insertion in model container [2022-12-06 07:56:07,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:56:07,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:56:07,554 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-06 07:56:07,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:56:07,574 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:56:07,600 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-06 07:56:07,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:56:07,616 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:56:07,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07 WrapperNode [2022-12-06 07:56:07,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:56:07,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:56:07,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:56:07,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:56:07,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,660 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-12-06 07:56:07,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:56:07,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:56:07,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:56:07,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:56:07,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,682 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:56:07,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:56:07,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:56:07,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:56:07,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (1/1) ... [2022-12-06 07:56:07,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:56:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:07,730 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-06 07:56:07,751 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-06 07:56:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:56:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:56:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:56:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:56:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:56:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:56:07,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:56:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:56:07,762 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:56:07,848 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:56:07,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:56:08,048 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:56:08,055 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:56:08,055 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:56:08,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:56:08 BoogieIcfgContainer [2022-12-06 07:56:08,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:56:08,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:56:08,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:56:08,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:56:08,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:56:07" (1/3) ... [2022-12-06 07:56:08,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4405519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:56:08, skipping insertion in model container [2022-12-06 07:56:08,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:07" (2/3) ... [2022-12-06 07:56:08,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4405519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:56:08, skipping insertion in model container [2022-12-06 07:56:08,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:56:08" (3/3) ... [2022-12-06 07:56:08,063 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-12-06 07:56:08,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:56:08,076 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:56:08,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:56:08,167 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:56:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 191 transitions, 398 flow [2022-12-06 07:56:08,280 INFO L130 PetriNetUnfolder]: 18/189 cut-off events. [2022-12-06 07:56:08,280 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:56:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 189 events. 18/189 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-06 07:56:08,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 191 transitions, 398 flow [2022-12-06 07:56:08,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 181 transitions, 374 flow [2022-12-06 07:56:08,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:08,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-06 07:56:08,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 181 transitions, 374 flow [2022-12-06 07:56:08,416 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-06 07:56:08,416 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:56:08,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 18/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 274 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-06 07:56:08,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-06 07:56:08,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 4092 [2022-12-06 07:56:13,820 INFO L203 LiptonReduction]: Total number of compositions: 162 [2022-12-06 07:56:13,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:56:13,845 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;@c95a5cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:56:13,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:56:13,850 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:56:13,850 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:56:13,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:13,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:13,851 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-06 07:56:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1355763279, now seen corresponding path program 1 times [2022-12-06 07:56:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134580170] [2022-12-06 07:56:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:14,170 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-06 07:56:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134580170] [2022-12-06 07:56:14,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134580170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:14,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:14,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:56:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763174905] [2022-12-06 07:56:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:14,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:14,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:56:14,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 07:56:14,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:14,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:56:14,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:14,232 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 07:56:14,232 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:56:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 07:56:14,233 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 07:56:14,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 07:56:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 07:56:14,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:56:14,242 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 07:56:14,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 07:56:14,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:14,245 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 07:56:14,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 07:56:14,248 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:56:14,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:14,249 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:56:14,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:14,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:14,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:56:14,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:56:14,255 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:56:14,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:56:14,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 07:56:14,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:56:14,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:56:14,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:14,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 620 [2022-12-06 07:56:14,869 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 07:56:14,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 07:56:14,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:14,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:56:14,869 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-06 07:56:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1825621982, now seen corresponding path program 1 times [2022-12-06 07:56:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:14,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342702116] [2022-12-06 07:56:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:15,068 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-06 07:56:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342702116] [2022-12-06 07:56:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342702116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:15,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:15,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:56:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56528909] [2022-12-06 07:56:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:56:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:56:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:56:15,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:56:15,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 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-06 07:56:15,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:15,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:56:15,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:15,208 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-06 07:56:15,208 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:56:15,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 368 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-06 07:56:15,211 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-06 07:56:15,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-06 07:56:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:56:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:56:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:56:15,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 07:56:15,212 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:56:15,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-06 07:56:15,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:15,213 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-06 07:56:15,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 07:56:15,214 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 07:56:15,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:15,214 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 07:56:15,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:15,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:15,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 07:56:15,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 07:56:15,218 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 07:56:15,219 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 07:56:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 07:56:15,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 07:56:15,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:56:15,315 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:15,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:56:15,316 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow [2022-12-06 07:56:15,316 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-06 07:56:15,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:15,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:15,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:56:15,317 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-06 07:56:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1532974384, now seen corresponding path program 1 times [2022-12-06 07:56:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:15,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696140300] [2022-12-06 07:56:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:15,473 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-06 07:56:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696140300] [2022-12-06 07:56:15,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696140300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:15,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:15,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644155153] [2022-12-06 07:56:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:15,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:15,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:56:15,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:15,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:15,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:56:15,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:15,562 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 07:56:15,562 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-06 07:56:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 169 events. 87/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 526 event pairs, 33 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2022-12-06 07:56:15,566 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-06 07:56:15,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 199 flow [2022-12-06 07:56:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:56:15,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:56:15,569 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 65 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:56:15,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 199 flow [2022-12-06 07:56:15,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 169 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:15,572 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 72 flow [2022-12-06 07:56:15,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-06 07:56:15,573 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:56:15,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:15,573 INFO L89 Accepts]: Start accepts. Operand has 26 places, 20 transitions, 72 flow [2022-12-06 07:56:15,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:15,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:15,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 72 flow [2022-12-06 07:56:15,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 72 flow [2022-12-06 07:56:15,580 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 07:56:15,581 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:56:15,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2022-12-06 07:56:15,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 72 flow [2022-12-06 07:56:15,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 07:56:15,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:15,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 07:56:15,685 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 75 flow [2022-12-06 07:56:15,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:15,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:15,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:56:15,686 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-06 07:56:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1412493814, now seen corresponding path program 2 times [2022-12-06 07:56:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960681315] [2022-12-06 07:56:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:15,818 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-06 07:56:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960681315] [2022-12-06 07:56:15,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960681315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:15,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112621902] [2022-12-06 07:56:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:15,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:15,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:15,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:56:15,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:15,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:15,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:56:15,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:15,906 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-06 07:56:15,907 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-06 07:56:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 149 events. 77/149 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 432 event pairs, 42 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2022-12-06 07:56:15,914 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-06 07:56:15,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2022-12-06 07:56:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 07:56:15,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-06 07:56:15,916 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 75 flow. Second operand 4 states and 31 transitions. [2022-12-06 07:56:15,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2022-12-06 07:56:15,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:15,919 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2022-12-06 07:56:15,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-06 07:56:15,920 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 07:56:15,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:15,920 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 70 flow [2022-12-06 07:56:15,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:15,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:15,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 70 flow [2022-12-06 07:56:15,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2022-12-06 07:56:15,925 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 07:56:15,925 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-12-06 07:56:15,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 3/29 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-06 07:56:15,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2022-12-06 07:56:15,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:56:16,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:16,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 07:56:16,191 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-06 07:56:16,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:16,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:16,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:16,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:56:16,192 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-06 07:56:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1685689284, now seen corresponding path program 1 times [2022-12-06 07:56:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887125172] [2022-12-06 07:56:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:16,308 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-06 07:56:16,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:16,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887125172] [2022-12-06 07:56:16,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887125172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:16,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:16,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592825580] [2022-12-06 07:56:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:16,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:16,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:56:16,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:16,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:16,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:56:16,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:16,411 INFO L130 PetriNetUnfolder]: 93/181 cut-off events. [2022-12-06 07:56:16,411 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 07:56:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 181 events. 93/181 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 42 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 413. Up to 130 conditions per place. [2022-12-06 07:56:16,412 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-06 07:56:16,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 186 flow [2022-12-06 07:56:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:56:16,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 07:56:16,413 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:56:16,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 186 flow [2022-12-06 07:56:16,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 166 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:56:16,414 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 81 flow [2022-12-06 07:56:16,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2022-12-06 07:56:16,415 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:56:16,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:16,415 INFO L89 Accepts]: Start accepts. Operand has 26 places, 22 transitions, 81 flow [2022-12-06 07:56:16,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:16,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:16,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-06 07:56:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 81 flow [2022-12-06 07:56:16,420 INFO L130 PetriNetUnfolder]: 5/41 cut-off events. [2022-12-06 07:56:16,420 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 07:56:16,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 41 events. 5/41 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-06 07:56:16,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-06 07:56:16,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:56:16,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:16,820 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:16,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-06 07:56:16,821 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 92 flow [2022-12-06 07:56:16,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:16,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:16,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:56:16,821 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-06 07:56:16,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1941960187, now seen corresponding path program 1 times [2022-12-06 07:56:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:16,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308351393] [2022-12-06 07:56:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:16,887 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-06 07:56:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308351393] [2022-12-06 07:56:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308351393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:16,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:16,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344866393] [2022-12-06 07:56:16,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:16,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:16,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:16,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:56:16,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:16,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:16,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:56:16,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:16,992 INFO L130 PetriNetUnfolder]: 139/273 cut-off events. [2022-12-06 07:56:16,992 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-12-06 07:56:16,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 273 events. 139/273 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1071 event pairs, 62 based on Foata normal form. 4/234 useless extension candidates. Maximal degree in co-relation 512. Up to 180 conditions per place. [2022-12-06 07:56:16,994 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 07:56:16,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 258 flow [2022-12-06 07:56:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 07:56:16,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 07:56:16,995 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 92 flow. Second operand 4 states and 43 transitions. [2022-12-06 07:56:16,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 258 flow [2022-12-06 07:56:16,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 248 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 07:56:16,996 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 106 flow [2022-12-06 07:56:16,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 07:56:16,997 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 07:56:16,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:16,997 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 106 flow [2022-12-06 07:56:16,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:16,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:16,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-06 07:56:16,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 106 flow [2022-12-06 07:56:17,002 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-06 07:56:17,002 INFO L131 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-12-06 07:56:17,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 4/54 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-06 07:56:17,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-06 07:56:17,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 07:56:17,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [783] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_157| v_~f~0.base_129))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_129 (* v_~x2~0_243 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_129 (* .cse1 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_243) (< v_~x2~0_243 v_~size~0_115)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_51| 4294967296) (mod v_~n~0_99 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_115)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) (mod (+ v_~n~0_99 4294967294) 4294967296)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (select .cse2 (+ v_~f~0.offset_129 (* .cse0 4))) v_~x2~0_242))))) InVars {~x2~0=v_~x2~0_243, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_129, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_99, ~f~0.offset=v_~f~0.offset_129} OutVars{~x2~0=v_~x2~0_242, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, ~size~0=v_~size~0_115, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~f~0.base=v_~f~0.base_129, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_43|, ~n~0=v_~n~0_99, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:56:17,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:17,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 07:56:17,317 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 107 flow [2022-12-06 07:56:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:17,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:17,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:56:17,317 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-06 07:56:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1695881691, now seen corresponding path program 2 times [2022-12-06 07:56:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:17,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821768723] [2022-12-06 07:56:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:17,451 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-06 07:56:17,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:17,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821768723] [2022-12-06 07:56:17,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821768723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:17,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:17,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428962370] [2022-12-06 07:56:17,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:17,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:17,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:17,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:17,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:56:17,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:17,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:17,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:56:17,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:17,540 INFO L130 PetriNetUnfolder]: 140/276 cut-off events. [2022-12-06 07:56:17,541 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-06 07:56:17,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 276 events. 140/276 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1039 event pairs, 89 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 672. Up to 241 conditions per place. [2022-12-06 07:56:17,542 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-06 07:56:17,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 222 flow [2022-12-06 07:56:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 07:56:17,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 07:56:17,544 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 107 flow. Second operand 4 states and 32 transitions. [2022-12-06 07:56:17,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 222 flow [2022-12-06 07:56:17,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 207 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:17,547 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 122 flow [2022-12-06 07:56:17,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 07:56:17,548 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:56:17,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:17,548 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 122 flow [2022-12-06 07:56:17,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:17,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:17,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-06 07:56:17,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 122 flow [2022-12-06 07:56:17,554 INFO L130 PetriNetUnfolder]: 7/64 cut-off events. [2022-12-06 07:56:17,554 INFO L131 PetriNetUnfolder]: For 48/54 co-relation queries the response was YES. [2022-12-06 07:56:17,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 64 events. 7/64 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 249 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 89. Up to 9 conditions per place. [2022-12-06 07:56:17,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-06 07:56:17,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:56:17,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:17,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 07:56:17,661 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 116 flow [2022-12-06 07:56:17,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:17,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:17,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:56:17,662 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-06 07:56:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1493526263, now seen corresponding path program 1 times [2022-12-06 07:56:17,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:17,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560829997] [2022-12-06 07:56:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:17,759 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-06 07:56:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:17,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560829997] [2022-12-06 07:56:17,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560829997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:17,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027139139] [2022-12-06 07:56:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:17,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:17,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:56:17,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 07:56:17,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:17,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:56:17,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:17,830 INFO L130 PetriNetUnfolder]: 142/280 cut-off events. [2022-12-06 07:56:17,830 INFO L131 PetriNetUnfolder]: For 476/476 co-relation queries the response was YES. [2022-12-06 07:56:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 280 events. 142/280 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1065 event pairs, 96 based on Foata normal form. 4/269 useless extension candidates. Maximal degree in co-relation 749. Up to 276 conditions per place. [2022-12-06 07:56:17,831 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 07:56:17,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 185 flow [2022-12-06 07:56:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 07:56:17,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 07:56:17,833 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 116 flow. Second operand 3 states and 27 transitions. [2022-12-06 07:56:17,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 185 flow [2022-12-06 07:56:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 176 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:17,835 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 121 flow [2022-12-06 07:56:17,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 07:56:17,838 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:56:17,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:17,838 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 121 flow [2022-12-06 07:56:17,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:17,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:17,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-06 07:56:17,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 121 flow [2022-12-06 07:56:17,843 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 07:56:17,844 INFO L131 PetriNetUnfolder]: For 45/50 co-relation queries the response was YES. [2022-12-06 07:56:17,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 64 events. 6/64 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 259 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 103. Up to 9 conditions per place. [2022-12-06 07:56:17,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-06 07:56:17,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 07:56:18,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:18,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-06 07:56:18,321 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 117 flow [2022-12-06 07:56:18,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 07:56:18,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:18,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:56:18,322 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-06 07:56:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash 68936365, now seen corresponding path program 3 times [2022-12-06 07:56:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:18,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089230763] [2022-12-06 07:56:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:18,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:18,394 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-06 07:56:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:18,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089230763] [2022-12-06 07:56:18,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089230763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:18,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:18,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507220291] [2022-12-06 07:56:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:18,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:18,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:18,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:18,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:56:18,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:18,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:18,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:56:18,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:18,475 INFO L130 PetriNetUnfolder]: 138/266 cut-off events. [2022-12-06 07:56:18,475 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2022-12-06 07:56:18,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 266 events. 138/266 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1017 event pairs, 54 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 797. Up to 182 conditions per place. [2022-12-06 07:56:18,477 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 35 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-06 07:56:18,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 251 flow [2022-12-06 07:56:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 07:56:18,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-06 07:56:18,478 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 117 flow. Second operand 4 states and 39 transitions. [2022-12-06 07:56:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 251 flow [2022-12-06 07:56:18,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 237 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:18,481 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 136 flow [2022-12-06 07:56:18,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-06 07:56:18,481 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 07:56:18,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:18,482 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 136 flow [2022-12-06 07:56:18,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:18,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:18,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-06 07:56:18,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 136 flow [2022-12-06 07:56:18,489 INFO L130 PetriNetUnfolder]: 8/59 cut-off events. [2022-12-06 07:56:18,489 INFO L131 PetriNetUnfolder]: For 74/85 co-relation queries the response was YES. [2022-12-06 07:56:18,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 59 events. 8/59 cut-off events. For 74/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 208 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2022-12-06 07:56:18,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-06 07:56:18,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:56:18,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~f~0.base_127))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_127 (* v_~x2~0_236 4))))) (and (<= (mod (+ v_~n~0_97 4294967294) 4294967296) 0) (not (= (ite (and (<= 0 v_~x2~0_236) (< v_~x2~0_236 v_~size~0_113)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190| 0)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_127)) v_~x2~0_235) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (< .cse1 v_~size~0_113) (<= 0 .cse1)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)))) InVars {~x2~0=v_~x2~0_236, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, ~f~0.offset=v_~f~0.offset_127, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} OutVars{~x2~0=v_~x2~0_235, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~f~0.offset=v_~f~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_45|, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [766] L49-2-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_In_8 v_~size~0_In_17) (<= 0 v_~x1~0_In_8)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~x1~0_Out_12 (select (select |v_#memory_int_In_33| v_~f~0.base_In_22) (+ v_~f~0.offset_In_22 (* v_~x1~0_In_8 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (mod v_~n~0_In_5 4294967296)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_6|)) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_33|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_In_8, ~f~0.offset=v_~f~0.offset_In_22} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_12|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_33|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:18,756 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:18,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-06 07:56:18,756 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 139 flow [2022-12-06 07:56:18,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 07:56:18,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:18,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:18,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:56:18,757 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-06 07:56:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1608042867, now seen corresponding path program 1 times [2022-12-06 07:56:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446447545] [2022-12-06 07:56:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:18,867 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-06 07:56:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446447545] [2022-12-06 07:56:18,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446447545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:18,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:18,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618577176] [2022-12-06 07:56:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:18,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:18,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:56:18,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 07:56:18,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:18,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:56:18,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:18,936 INFO L130 PetriNetUnfolder]: 140/270 cut-off events. [2022-12-06 07:56:18,936 INFO L131 PetriNetUnfolder]: For 741/741 co-relation queries the response was YES. [2022-12-06 07:56:18,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 270 events. 140/270 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 991 event pairs, 94 based on Foata normal form. 4/259 useless extension candidates. Maximal degree in co-relation 706. Up to 266 conditions per place. [2022-12-06 07:56:18,938 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 07:56:18,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 210 flow [2022-12-06 07:56:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 07:56:18,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-06 07:56:18,938 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 139 flow. Second operand 3 states and 29 transitions. [2022-12-06 07:56:18,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 210 flow [2022-12-06 07:56:18,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 191 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:18,940 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 134 flow [2022-12-06 07:56:18,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-06 07:56:18,941 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:56:18,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:18,941 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 134 flow [2022-12-06 07:56:18,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:18,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:18,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-06 07:56:18,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 134 flow [2022-12-06 07:56:18,949 INFO L130 PetriNetUnfolder]: 7/59 cut-off events. [2022-12-06 07:56:18,949 INFO L131 PetriNetUnfolder]: For 59/72 co-relation queries the response was YES. [2022-12-06 07:56:18,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 59 events. 7/59 cut-off events. For 59/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 102. Up to 8 conditions per place. [2022-12-06 07:56:18,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-06 07:56:18,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 07:56:19,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:19,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 715 [2022-12-06 07:56:19,657 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 130 flow [2022-12-06 07:56:19,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 07:56:19,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:19,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:19,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:56:19,657 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-06 07:56:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1745000772, now seen corresponding path program 1 times [2022-12-06 07:56:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:19,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581886934] [2022-12-06 07:56:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:19,839 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-06 07:56:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:19,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581886934] [2022-12-06 07:56:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581886934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:19,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:19,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715665766] [2022-12-06 07:56:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:19,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:56:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:56:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:56:19,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:56:19,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-06 07:56:19,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:19,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:56:19,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:20,029 INFO L130 PetriNetUnfolder]: 275/534 cut-off events. [2022-12-06 07:56:20,029 INFO L131 PetriNetUnfolder]: For 1001/1001 co-relation queries the response was YES. [2022-12-06 07:56:20,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 534 events. 275/534 cut-off events. For 1001/1001 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2521 event pairs, 67 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 1630. Up to 248 conditions per place. [2022-12-06 07:56:20,032 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 59 selfloop transitions, 14 changer transitions 6/79 dead transitions. [2022-12-06 07:56:20,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 559 flow [2022-12-06 07:56:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:56:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:56:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 07:56:20,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 07:56:20,033 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 130 flow. Second operand 6 states and 75 transitions. [2022-12-06 07:56:20,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 559 flow [2022-12-06 07:56:20,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 535 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:20,037 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 277 flow [2022-12-06 07:56:20,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-06 07:56:20,037 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-06 07:56:20,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:20,037 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 277 flow [2022-12-06 07:56:20,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:20,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:20,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 277 flow [2022-12-06 07:56:20,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 277 flow [2022-12-06 07:56:20,058 INFO L130 PetriNetUnfolder]: 36/166 cut-off events. [2022-12-06 07:56:20,058 INFO L131 PetriNetUnfolder]: For 351/435 co-relation queries the response was YES. [2022-12-06 07:56:20,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 166 events. 36/166 cut-off events. For 351/435 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 904 event pairs, 0 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 336. Up to 55 conditions per place. [2022-12-06 07:56:20,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 277 flow [2022-12-06 07:56:20,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 07:56:21,804 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:21,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1768 [2022-12-06 07:56:21,805 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 266 flow [2022-12-06 07:56:21,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-06 07:56:21,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:21,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:56:21,806 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-06 07:56:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2107765014, now seen corresponding path program 1 times [2022-12-06 07:56:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723942124] [2022-12-06 07:56:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:21,917 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-06 07:56:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:21,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723942124] [2022-12-06 07:56:21,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723942124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:21,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:21,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358027191] [2022-12-06 07:56:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:21,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:21,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:21,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:21,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:56:21,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:21,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:21,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:56:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:22,094 INFO L130 PetriNetUnfolder]: 283/581 cut-off events. [2022-12-06 07:56:22,094 INFO L131 PetriNetUnfolder]: For 1558/1558 co-relation queries the response was YES. [2022-12-06 07:56:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 581 events. 283/581 cut-off events. For 1558/1558 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2890 event pairs, 178 based on Foata normal form. 8/588 useless extension candidates. Maximal degree in co-relation 1642. Up to 572 conditions per place. [2022-12-06 07:56:22,097 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 37 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2022-12-06 07:56:22,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 359 flow [2022-12-06 07:56:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:56:22,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:56:22,098 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 266 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:56:22,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 359 flow [2022-12-06 07:56:22,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 337 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:22,117 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 248 flow [2022-12-06 07:56:22,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 07:56:22,118 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 07:56:22,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:22,118 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 248 flow [2022-12-06 07:56:22,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:22,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:22,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 248 flow [2022-12-06 07:56:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 248 flow [2022-12-06 07:56:22,149 INFO L130 PetriNetUnfolder]: 30/187 cut-off events. [2022-12-06 07:56:22,149 INFO L131 PetriNetUnfolder]: For 368/425 co-relation queries the response was YES. [2022-12-06 07:56:22,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 187 events. 30/187 cut-off events. For 368/425 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1173 event pairs, 0 based on Foata normal form. 7/181 useless extension candidates. Maximal degree in co-relation 424. Up to 58 conditions per place. [2022-12-06 07:56:22,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 248 flow [2022-12-06 07:56:22,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 07:56:24,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:24,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1943 [2022-12-06 07:56:24,061 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 247 flow [2022-12-06 07:56:24,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:24,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:24,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:24,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:56:24,061 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-06 07:56:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1357341352, now seen corresponding path program 1 times [2022-12-06 07:56:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:24,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345176847] [2022-12-06 07:56:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:24,163 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-06 07:56:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345176847] [2022-12-06 07:56:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345176847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326322523] [2022-12-06 07:56:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:24,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:56:24,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:24,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:24,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:56:24,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:24,327 INFO L130 PetriNetUnfolder]: 279/585 cut-off events. [2022-12-06 07:56:24,327 INFO L131 PetriNetUnfolder]: For 1789/1789 co-relation queries the response was YES. [2022-12-06 07:56:24,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 585 events. 279/585 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3014 event pairs, 142 based on Foata normal form. 16/600 useless extension candidates. Maximal degree in co-relation 2010. Up to 450 conditions per place. [2022-12-06 07:56:24,330 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 45 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-06 07:56:24,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 412 flow [2022-12-06 07:56:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:56:24,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 07:56:24,331 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 247 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:56:24,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 412 flow [2022-12-06 07:56:24,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 388 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:24,334 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 266 flow [2022-12-06 07:56:24,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 07:56:24,335 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 07:56:24,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:24,335 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 266 flow [2022-12-06 07:56:24,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:24,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:24,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 266 flow [2022-12-06 07:56:24,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 266 flow [2022-12-06 07:56:24,354 INFO L130 PetriNetUnfolder]: 31/200 cut-off events. [2022-12-06 07:56:24,354 INFO L131 PetriNetUnfolder]: For 483/531 co-relation queries the response was YES. [2022-12-06 07:56:24,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 200 events. 31/200 cut-off events. For 483/531 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1280 event pairs, 2 based on Foata normal form. 7/200 useless extension candidates. Maximal degree in co-relation 419. Up to 62 conditions per place. [2022-12-06 07:56:24,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 266 flow [2022-12-06 07:56:24,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 07:56:24,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:24,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-06 07:56:24,747 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 260 flow [2022-12-06 07:56:24,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:24,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:24,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:56:24,747 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-06 07:56:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1077710224, now seen corresponding path program 1 times [2022-12-06 07:56:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:24,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786132858] [2022-12-06 07:56:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:24,864 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-06 07:56:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:24,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786132858] [2022-12-06 07:56:24,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786132858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:24,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:24,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65749277] [2022-12-06 07:56:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:24,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:56:24,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:24,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:24,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:56:24,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:24,980 INFO L130 PetriNetUnfolder]: 273/571 cut-off events. [2022-12-06 07:56:24,981 INFO L131 PetriNetUnfolder]: For 2108/2108 co-relation queries the response was YES. [2022-12-06 07:56:24,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 571 events. 273/571 cut-off events. For 2108/2108 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2888 event pairs, 170 based on Foata normal form. 8/578 useless extension candidates. Maximal degree in co-relation 1748. Up to 562 conditions per place. [2022-12-06 07:56:24,983 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-06 07:56:24,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 355 flow [2022-12-06 07:56:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 07:56:24,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-06 07:56:24,984 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 260 flow. Second operand 3 states and 32 transitions. [2022-12-06 07:56:24,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 355 flow [2022-12-06 07:56:24,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 338 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:24,987 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 264 flow [2022-12-06 07:56:24,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 07:56:24,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 07:56:24,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:24,988 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 264 flow [2022-12-06 07:56:24,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:24,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:24,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 264 flow [2022-12-06 07:56:24,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 264 flow [2022-12-06 07:56:25,005 INFO L130 PetriNetUnfolder]: 30/195 cut-off events. [2022-12-06 07:56:25,005 INFO L131 PetriNetUnfolder]: For 430/477 co-relation queries the response was YES. [2022-12-06 07:56:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 195 events. 30/195 cut-off events. For 430/477 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1262 event pairs, 1 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 452. Up to 60 conditions per place. [2022-12-06 07:56:25,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 264 flow [2022-12-06 07:56:25,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 07:56:27,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:27,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2804 [2022-12-06 07:56:27,792 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 263 flow [2022-12-06 07:56:27,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:27,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:27,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:27,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:56:27,793 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-06 07:56:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash -877721781, now seen corresponding path program 1 times [2022-12-06 07:56:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:27,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183716574] [2022-12-06 07:56:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:27,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:27,962 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-06 07:56:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:27,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183716574] [2022-12-06 07:56:27,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183716574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:27,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:27,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118602918] [2022-12-06 07:56:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:27,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:27,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:27,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:56:27,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:27,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:27,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:56:27,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:28,176 INFO L130 PetriNetUnfolder]: 350/734 cut-off events. [2022-12-06 07:56:28,176 INFO L131 PetriNetUnfolder]: For 2349/2349 co-relation queries the response was YES. [2022-12-06 07:56:28,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 734 events. 350/734 cut-off events. For 2349/2349 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4027 event pairs, 168 based on Foata normal form. 16/749 useless extension candidates. Maximal degree in co-relation 2597. Up to 574 conditions per place. [2022-12-06 07:56:28,180 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 52 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-12-06 07:56:28,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 506 flow [2022-12-06 07:56:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 07:56:28,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 07:56:28,181 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 263 flow. Second operand 4 states and 46 transitions. [2022-12-06 07:56:28,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 506 flow [2022-12-06 07:56:28,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 480 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:28,185 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 321 flow [2022-12-06 07:56:28,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-06 07:56:28,186 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 07:56:28,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:28,186 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 321 flow [2022-12-06 07:56:28,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:28,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:28,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 321 flow [2022-12-06 07:56:28,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 321 flow [2022-12-06 07:56:28,207 INFO L130 PetriNetUnfolder]: 43/262 cut-off events. [2022-12-06 07:56:28,207 INFO L131 PetriNetUnfolder]: For 651/712 co-relation queries the response was YES. [2022-12-06 07:56:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 262 events. 43/262 cut-off events. For 651/712 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1848 event pairs, 1 based on Foata normal form. 8/261 useless extension candidates. Maximal degree in co-relation 553. Up to 84 conditions per place. [2022-12-06 07:56:28,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 321 flow [2022-12-06 07:56:28,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:56:28,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:28,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:28,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:28,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:28,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 551 [2022-12-06 07:56:28,737 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 357 flow [2022-12-06 07:56:28,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:28,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:28,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:56:28,738 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-06 07:56:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -47655434, now seen corresponding path program 1 times [2022-12-06 07:56:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:28,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547405040] [2022-12-06 07:56:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:28,840 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-06 07:56:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:28,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547405040] [2022-12-06 07:56:28,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547405040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:28,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:28,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256326399] [2022-12-06 07:56:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:28,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:28,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:28,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:28,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:28,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:28,976 INFO L130 PetriNetUnfolder]: 347/735 cut-off events. [2022-12-06 07:56:28,977 INFO L131 PetriNetUnfolder]: For 2671/2671 co-relation queries the response was YES. [2022-12-06 07:56:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 735 events. 347/735 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4005 event pairs, 220 based on Foata normal form. 8/742 useless extension candidates. Maximal degree in co-relation 2370. Up to 726 conditions per place. [2022-12-06 07:56:28,980 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-06 07:56:28,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 464 flow [2022-12-06 07:56:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 07:56:28,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 07:56:28,981 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 357 flow. Second operand 3 states and 35 transitions. [2022-12-06 07:56:28,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 464 flow [2022-12-06 07:56:28,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 448 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 07:56:28,987 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 362 flow [2022-12-06 07:56:28,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 07:56:28,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 07:56:28,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:28,988 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 362 flow [2022-12-06 07:56:28,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:28,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:28,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 362 flow [2022-12-06 07:56:28,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 362 flow [2022-12-06 07:56:29,009 INFO L130 PetriNetUnfolder]: 43/263 cut-off events. [2022-12-06 07:56:29,009 INFO L131 PetriNetUnfolder]: For 743/806 co-relation queries the response was YES. [2022-12-06 07:56:29,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 263 events. 43/263 cut-off events. For 743/806 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1845 event pairs, 1 based on Foata normal form. 9/263 useless extension candidates. Maximal degree in co-relation 670. Up to 85 conditions per place. [2022-12-06 07:56:29,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 362 flow [2022-12-06 07:56:29,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 07:56:32,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:32,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3613 [2022-12-06 07:56:32,601 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 363 flow [2022-12-06 07:56:32,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:32,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:32,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:32,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:56:32,601 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-06 07:56:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash -502319514, now seen corresponding path program 1 times [2022-12-06 07:56:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570125461] [2022-12-06 07:56:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:32,719 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-06 07:56:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:32,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570125461] [2022-12-06 07:56:32,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570125461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:32,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:32,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:32,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499056301] [2022-12-06 07:56:32,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:32,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:32,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:32,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:32,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:32,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:32,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:32,975 INFO L130 PetriNetUnfolder]: 334/708 cut-off events. [2022-12-06 07:56:32,975 INFO L131 PetriNetUnfolder]: For 2926/2926 co-relation queries the response was YES. [2022-12-06 07:56:32,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 708 events. 334/708 cut-off events. For 2926/2926 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3830 event pairs, 160 based on Foata normal form. 8/715 useless extension candidates. Maximal degree in co-relation 2698. Up to 548 conditions per place. [2022-12-06 07:56:32,979 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 58 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2022-12-06 07:56:32,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 600 flow [2022-12-06 07:56:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:56:32,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-06 07:56:32,980 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 363 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:56:32,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 600 flow [2022-12-06 07:56:32,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 574 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:32,990 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:32,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2022-12-06 07:56:32,990 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-06 07:56:32,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:32,990 INFO L89 Accepts]: Start accepts. Operand has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:32,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:32,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:32,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:32,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:33,016 INFO L130 PetriNetUnfolder]: 42/252 cut-off events. [2022-12-06 07:56:33,016 INFO L131 PetriNetUnfolder]: For 798/861 co-relation queries the response was YES. [2022-12-06 07:56:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 252 events. 42/252 cut-off events. For 798/861 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1737 event pairs, 0 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 600. Up to 81 conditions per place. [2022-12-06 07:56:33,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:33,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:56:33,018 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:33,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:56:33,018 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 371 flow [2022-12-06 07:56:33,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:33,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:33,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:33,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:56:33,019 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-06 07:56:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1869903037, now seen corresponding path program 1 times [2022-12-06 07:56:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:33,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691990182] [2022-12-06 07:56:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:33,129 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-06 07:56:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691990182] [2022-12-06 07:56:33,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691990182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:33,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608042591] [2022-12-06 07:56:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:33,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:33,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:33,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:33,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:33,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:33,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:33,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:33,255 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:33,256 INFO L131 PetriNetUnfolder]: For 3149/3149 co-relation queries the response was YES. [2022-12-06 07:56:33,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 717 events. 339/717 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3871 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2538. Up to 708 conditions per place. [2022-12-06 07:56:33,259 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 07:56:33,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 480 flow [2022-12-06 07:56:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 07:56:33,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 07:56:33,260 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 371 flow. Second operand 3 states and 35 transitions. [2022-12-06 07:56:33,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 480 flow [2022-12-06 07:56:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:33,264 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:33,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 07:56:33,265 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:56:33,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:33,265 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:33,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:33,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:33,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:33,286 INFO L130 PetriNetUnfolder]: 42/254 cut-off events. [2022-12-06 07:56:33,286 INFO L131 PetriNetUnfolder]: For 830/893 co-relation queries the response was YES. [2022-12-06 07:56:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 254 events. 42/254 cut-off events. For 830/893 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1750 event pairs, 0 based on Foata normal form. 9/254 useless extension candidates. Maximal degree in co-relation 656. Up to 81 conditions per place. [2022-12-06 07:56:33,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:33,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:37,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:37,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4665 [2022-12-06 07:56:37,930 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 07:56:37,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:37,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:37,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:37,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:56:37,930 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-06 07:56:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1017359416, now seen corresponding path program 1 times [2022-12-06 07:56:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:37,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930554608] [2022-12-06 07:56:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:38,020 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-06 07:56:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930554608] [2022-12-06 07:56:38,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930554608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:38,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:38,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379116944] [2022-12-06 07:56:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:38,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:38,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:38,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:38,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:38,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:38,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:38,189 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:38,189 INFO L131 PetriNetUnfolder]: For 3400/3400 co-relation queries the response was YES. [2022-12-06 07:56:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3400/3400 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3904 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 07:56:38,193 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 07:56:38,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:56:38,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:56:38,194 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:56:38,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:38,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:38,199 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:38,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 07:56:38,199 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 07:56:38,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:38,199 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:38,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:38,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:38,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:38,220 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 07:56:38,220 INFO L131 PetriNetUnfolder]: For 912/975 co-relation queries the response was YES. [2022-12-06 07:56:38,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 912/975 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1804 event pairs, 0 based on Foata normal form. 9/259 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 07:56:38,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:38,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:38,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:38,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 608 [2022-12-06 07:56:38,807 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 393 flow [2022-12-06 07:56:38,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:38,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:38,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:38,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:56:38,807 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-06 07:56:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1991555393, now seen corresponding path program 1 times [2022-12-06 07:56:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670419006] [2022-12-06 07:56:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:38,882 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-06 07:56:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670419006] [2022-12-06 07:56:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670419006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460429756] [2022-12-06 07:56:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:38,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:38,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:38,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:38,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:38,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:39,014 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:39,014 INFO L131 PetriNetUnfolder]: For 3644/3644 co-relation queries the response was YES. [2022-12-06 07:56:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 717 events. 339/717 cut-off events. For 3644/3644 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3869 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2706. Up to 708 conditions per place. [2022-12-06 07:56:39,018 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 07:56:39,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 504 flow [2022-12-06 07:56:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 07:56:39,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 07:56:39,019 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 393 flow. Second operand 3 states and 35 transitions. [2022-12-06 07:56:39,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 504 flow [2022-12-06 07:56:39,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:56:39,025 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:39,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 07:56:39,025 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:56:39,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:39,025 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:39,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:39,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:39,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:39,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:39,045 INFO L130 PetriNetUnfolder]: 42/256 cut-off events. [2022-12-06 07:56:39,045 INFO L131 PetriNetUnfolder]: For 841/904 co-relation queries the response was YES. [2022-12-06 07:56:39,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 256 events. 42/256 cut-off events. For 841/904 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1780 event pairs, 0 based on Foata normal form. 9/256 useless extension candidates. Maximal degree in co-relation 671. Up to 81 conditions per place. [2022-12-06 07:56:39,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:39,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:46,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:46,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7193 [2022-12-06 07:56:46,218 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 07:56:46,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:46,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:46,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:56:46,224 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-06 07:56:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 979328285, now seen corresponding path program 1 times [2022-12-06 07:56:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:46,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391400990] [2022-12-06 07:56:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:46,350 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-06 07:56:46,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:46,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391400990] [2022-12-06 07:56:46,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391400990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:46,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:46,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498286311] [2022-12-06 07:56:46,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:46,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:46,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:46,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:46,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:46,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:46,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:46,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:46,538 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:46,538 INFO L131 PetriNetUnfolder]: For 3400/3400 co-relation queries the response was YES. [2022-12-06 07:56:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3400/3400 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3887 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 07:56:46,541 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 07:56:46,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:56:46,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:56:46,542 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:56:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:46,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:46,547 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:46,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 07:56:46,547 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 07:56:46,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:46,549 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:46,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:46,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:46,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:46,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:46,569 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 07:56:46,569 INFO L131 PetriNetUnfolder]: For 910/973 co-relation queries the response was YES. [2022-12-06 07:56:46,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 910/973 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1798 event pairs, 0 based on Foata normal form. 9/259 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 07:56:46,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:46,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:47,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:47,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1071 [2022-12-06 07:56:47,618 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 393 flow [2022-12-06 07:56:47,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:47,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:47,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:47,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:56:47,618 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-06 07:56:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2131636997, now seen corresponding path program 1 times [2022-12-06 07:56:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:47,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170035829] [2022-12-06 07:56:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:47,721 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-06 07:56:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170035829] [2022-12-06 07:56:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170035829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820973988] [2022-12-06 07:56:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:47,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:47,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:47,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:47,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:47,849 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:47,849 INFO L131 PetriNetUnfolder]: For 3643/3643 co-relation queries the response was YES. [2022-12-06 07:56:47,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 717 events. 339/717 cut-off events. For 3643/3643 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3879 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2706. Up to 708 conditions per place. [2022-12-06 07:56:47,853 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 07:56:47,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 504 flow [2022-12-06 07:56:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 07:56:47,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 07:56:47,854 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 393 flow. Second operand 3 states and 35 transitions. [2022-12-06 07:56:47,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 504 flow [2022-12-06 07:56:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:56:47,859 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:47,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 07:56:47,859 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:56:47,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:47,860 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:47,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:47,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:47,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:47,879 INFO L130 PetriNetUnfolder]: 42/254 cut-off events. [2022-12-06 07:56:47,879 INFO L131 PetriNetUnfolder]: For 846/909 co-relation queries the response was YES. [2022-12-06 07:56:47,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 254 events. 42/254 cut-off events. For 846/909 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1763 event pairs, 0 based on Foata normal form. 9/254 useless extension candidates. Maximal degree in co-relation 656. Up to 81 conditions per place. [2022-12-06 07:56:47,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 07:56:47,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:58,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:58,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10760 [2022-12-06 07:56:58,619 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 07:56:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:56:58,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:58,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:58,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:56:58,620 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-06 07:56:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1151103191, now seen corresponding path program 1 times [2022-12-06 07:56:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:58,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723448452] [2022-12-06 07:56:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:58,724 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-06 07:56:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:58,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723448452] [2022-12-06 07:56:58,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723448452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:58,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:58,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134325743] [2022-12-06 07:56:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:58,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:58,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:56:58,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:56:58,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:58,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:56:58,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:58,898 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 07:56:58,898 INFO L131 PetriNetUnfolder]: For 3415/3415 co-relation queries the response was YES. [2022-12-06 07:56:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3415/3415 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3893 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 07:56:58,902 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 07:56:58,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:56:58,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:56:58,903 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:56:58,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 07:56:58,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:58,908 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:58,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 07:56:58,908 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 07:56:58,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:58,908 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:58,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:58,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:58,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:58,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:58,929 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 07:56:58,929 INFO L131 PetriNetUnfolder]: For 882/945 co-relation queries the response was YES. [2022-12-06 07:56:58,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 882/945 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1794 event pairs, 0 based on Foata normal form. 9/258 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 07:56:58,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 07:56:58,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:56:58,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [826] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_243| v_~f~0.base_195))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_197 (* v_~x2~0_380 4))))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_197 (* .cse13 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse3))))) (let ((.cse11 (select .cse10 (+ v_~f~0.offset_197 (* .cse1 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_197 (* .cse11 4))))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_197 (* .cse8 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_197 (* .cse4 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_197 (* .cse2 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_197 (* .cse7 4))))) (let ((.cse9 (select .cse10 (+ (* 4 .cse0) v_~f~0.offset_197)))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse9))))) (let ((.cse14 (select .cse10 (+ v_~f~0.offset_197 (* .cse12 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_197 (* .cse14 4))))) (let ((.cse5 (select .cse10 (+ v_~f~0.offset_197 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_301| 15) (not (= (ite (and (<= 0 v_~x2~0_380) (< v_~x2~0_380 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse0 v_~size~0_181) (<= 0 .cse0)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_181) (<= 0 .cse1)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (not (= (ite (and (< .cse4 v_~size~0_181) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_181)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_181) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse5))) v_~x2~0_378) (not (= (ite (and (< .cse11 v_~size~0_181) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_181) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (not (= (ite (and (< .cse13 v_~size~0_181) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_301| 4294967293) 4294967296) (mod (+ 4294967294 v_~n~0_165) 4294967296)) (not (= (ite (and (< .cse14 v_~size~0_181) (<= 0 .cse14)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_380, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_243|, ~n~0=v_~n~0_165, ~f~0.offset=v_~f~0.offset_197} OutVars{~x2~0=v_~x2~0_378, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_301|, ~f~0.offset=v_~f~0.offset_197, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_103|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_97|, #memory_int=|v_#memory_int_243|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:57:00,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [826] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_243| v_~f~0.base_195))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_197 (* v_~x2~0_380 4))))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_197 (* .cse13 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse3))))) (let ((.cse11 (select .cse10 (+ v_~f~0.offset_197 (* .cse1 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_197 (* .cse11 4))))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_197 (* .cse8 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_197 (* .cse4 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_197 (* .cse2 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_197 (* .cse7 4))))) (let ((.cse9 (select .cse10 (+ (* 4 .cse0) v_~f~0.offset_197)))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse9))))) (let ((.cse14 (select .cse10 (+ v_~f~0.offset_197 (* .cse12 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_197 (* .cse14 4))))) (let ((.cse5 (select .cse10 (+ v_~f~0.offset_197 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_301| 15) (not (= (ite (and (<= 0 v_~x2~0_380) (< v_~x2~0_380 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse0 v_~size~0_181) (<= 0 .cse0)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_181) (<= 0 .cse1)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (not (= (ite (and (< .cse4 v_~size~0_181) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_181)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_181) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse5))) v_~x2~0_378) (not (= (ite (and (< .cse11 v_~size~0_181) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_181) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (not (= (ite (and (< .cse13 v_~size~0_181) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_301| 4294967293) 4294967296) (mod (+ 4294967294 v_~n~0_165) 4294967296)) (not (= (ite (and (< .cse14 v_~size~0_181) (<= 0 .cse14)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_380, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_243|, ~n~0=v_~n~0_165, ~f~0.offset=v_~f~0.offset_197} OutVars{~x2~0=v_~x2~0_378, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_301|, ~f~0.offset=v_~f~0.offset_197, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_103|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_97|, #memory_int=|v_#memory_int_243|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:57:01,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:01,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2656 [2022-12-06 07:57:01,564 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 434 flow [2022-12-06 07:57:01,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:57:01,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:01,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:01,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:57:01,564 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-06 07:57:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1109907251, now seen corresponding path program 1 times [2022-12-06 07:57:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:01,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043400500] [2022-12-06 07:57:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:01,675 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-06 07:57:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043400500] [2022-12-06 07:57:01,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043400500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:01,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:01,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327016523] [2022-12-06 07:57:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:01,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:57:01,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:57:01,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:01,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:57:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:01,807 INFO L130 PetriNetUnfolder]: 349/755 cut-off events. [2022-12-06 07:57:01,807 INFO L131 PetriNetUnfolder]: For 3700/3700 co-relation queries the response was YES. [2022-12-06 07:57:01,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 755 events. 349/755 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4241 event pairs, 224 based on Foata normal form. 8/762 useless extension candidates. Maximal degree in co-relation 2824. Up to 746 conditions per place. [2022-12-06 07:57:01,810 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 43 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2022-12-06 07:57:01,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 499 flow [2022-12-06 07:57:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 07:57:01,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-06 07:57:01,811 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 434 flow. Second operand 3 states and 35 transitions. [2022-12-06 07:57:01,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 499 flow [2022-12-06 07:57:01,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 481 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:01,819 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 380 flow [2022-12-06 07:57:01,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-06 07:57:01,819 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 07:57:01,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:01,820 INFO L89 Accepts]: Start accepts. Operand has 56 places, 43 transitions, 380 flow [2022-12-06 07:57:01,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:01,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:01,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 380 flow [2022-12-06 07:57:01,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 380 flow [2022-12-06 07:57:01,839 INFO L130 PetriNetUnfolder]: 38/265 cut-off events. [2022-12-06 07:57:01,839 INFO L131 PetriNetUnfolder]: For 872/929 co-relation queries the response was YES. [2022-12-06 07:57:01,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 265 events. 38/265 cut-off events. For 872/929 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1925 event pairs, 1 based on Foata normal form. 9/266 useless extension candidates. Maximal degree in co-relation 690. Up to 85 conditions per place. [2022-12-06 07:57:01,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 380 flow [2022-12-06 07:57:01,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 07:57:19,422 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 445 DAG size of output: 440 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:57:22,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:22,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21031 [2022-12-06 07:57:22,851 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 383 flow [2022-12-06 07:57:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:57:22,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:22,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:22,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:57:22,852 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-06 07:57:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -79852461, now seen corresponding path program 1 times [2022-12-06 07:57:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:22,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773068737] [2022-12-06 07:57:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:22,944 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-06 07:57:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773068737] [2022-12-06 07:57:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773068737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:22,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:22,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198810071] [2022-12-06 07:57:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:22,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:22,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:22,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:57:22,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:57:22,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:22,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:57:22,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:23,073 INFO L130 PetriNetUnfolder]: 340/732 cut-off events. [2022-12-06 07:57:23,073 INFO L131 PetriNetUnfolder]: For 4080/4080 co-relation queries the response was YES. [2022-12-06 07:57:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 732 events. 340/732 cut-off events. For 4080/4080 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4065 event pairs, 215 based on Foata normal form. 8/739 useless extension candidates. Maximal degree in co-relation 2949. Up to 723 conditions per place. [2022-12-06 07:57:23,083 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:57:23,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 492 flow [2022-12-06 07:57:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:57:23,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 07:57:23,084 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 383 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:57:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 492 flow [2022-12-06 07:57:23,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 458 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:23,090 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 374 flow [2022-12-06 07:57:23,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 07:57:23,091 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 07:57:23,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:23,091 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 374 flow [2022-12-06 07:57:23,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:23,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:23,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 374 flow [2022-12-06 07:57:23,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 374 flow [2022-12-06 07:57:23,111 INFO L130 PetriNetUnfolder]: 38/265 cut-off events. [2022-12-06 07:57:23,112 INFO L131 PetriNetUnfolder]: For 815/872 co-relation queries the response was YES. [2022-12-06 07:57:23,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 265 events. 38/265 cut-off events. For 815/872 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1933 event pairs, 1 based on Foata normal form. 9/267 useless extension candidates. Maximal degree in co-relation 672. Up to 85 conditions per place. [2022-12-06 07:57:23,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 374 flow [2022-12-06 07:57:23,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 07:57:39,281 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 370 DAG size of output: 365 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:57:44,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:44,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21522 [2022-12-06 07:57:44,613 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 375 flow [2022-12-06 07:57:44,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:57:44,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:44,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:44,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:57:44,614 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-06 07:57:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -957615367, now seen corresponding path program 1 times [2022-12-06 07:57:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:44,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194984053] [2022-12-06 07:57:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:44,689 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-06 07:57:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194984053] [2022-12-06 07:57:44,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194984053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:44,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:44,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494387555] [2022-12-06 07:57:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:44,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:44,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:57:44,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:57:44,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:44,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:57:44,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:44,891 INFO L130 PetriNetUnfolder]: 330/690 cut-off events. [2022-12-06 07:57:44,891 INFO L131 PetriNetUnfolder]: For 3383/3383 co-relation queries the response was YES. [2022-12-06 07:57:44,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2934 conditions, 690 events. 330/690 cut-off events. For 3383/3383 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3680 event pairs, 163 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 2743. Up to 563 conditions per place. [2022-12-06 07:57:44,894 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 55 selfloop transitions, 4 changer transitions 2/61 dead transitions. [2022-12-06 07:57:44,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 601 flow [2022-12-06 07:57:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:57:44,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-06 07:57:44,895 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 375 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:57:44,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 601 flow [2022-12-06 07:57:44,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 575 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:44,903 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 365 flow [2022-12-06 07:57:44,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-06 07:57:44,904 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 07:57:44,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:44,904 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 365 flow [2022-12-06 07:57:44,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:44,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:44,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 365 flow [2022-12-06 07:57:44,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 365 flow [2022-12-06 07:57:44,923 INFO L130 PetriNetUnfolder]: 38/234 cut-off events. [2022-12-06 07:57:44,923 INFO L131 PetriNetUnfolder]: For 749/804 co-relation queries the response was YES. [2022-12-06 07:57:44,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 234 events. 38/234 cut-off events. For 749/804 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1555 event pairs, 1 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 570. Up to 78 conditions per place. [2022-12-06 07:57:44,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 365 flow [2022-12-06 07:57:44,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 07:57:44,925 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:57:44,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:57:44,926 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 365 flow [2022-12-06 07:57:44,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 07:57:44,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:44,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:57:44,926 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-06 07:57:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash -824805033, now seen corresponding path program 1 times [2022-12-06 07:57:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:44,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199878732] [2022-12-06 07:57:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:45,021 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-06 07:57:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199878732] [2022-12-06 07:57:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199878732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:45,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:45,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725883779] [2022-12-06 07:57:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:45,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:57:45,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:57:45,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:45,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:57:45,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:45,165 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 07:57:45,166 INFO L131 PetriNetUnfolder]: For 3529/3529 co-relation queries the response was YES. [2022-12-06 07:57:45,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 689 events. 333/689 cut-off events. For 3529/3529 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3597 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2551. Up to 680 conditions per place. [2022-12-06 07:57:45,168 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:57:45,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 470 flow [2022-12-06 07:57:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:57:45,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 07:57:45,169 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 365 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:57:45,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 470 flow [2022-12-06 07:57:45,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:45,173 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 07:57:45,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 07:57:45,174 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:57:45,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:45,174 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:57:45,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:45,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:45,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:57:45,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:57:45,192 INFO L130 PetriNetUnfolder]: 38/238 cut-off events. [2022-12-06 07:57:45,192 INFO L131 PetriNetUnfolder]: For 672/727 co-relation queries the response was YES. [2022-12-06 07:57:45,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 238 events. 38/238 cut-off events. For 672/727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1605 event pairs, 1 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 606. Up to 78 conditions per place. [2022-12-06 07:57:45,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:57:45,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 07:57:51,099 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 397 DAG size of output: 392 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:58:08,631 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 517 DAG size of output: 512 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:58:11,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:11,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26545 [2022-12-06 07:58:11,719 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 07:58:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:58:11,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:11,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:58:11,719 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-06 07:58:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1569757605, now seen corresponding path program 1 times [2022-12-06 07:58:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753738924] [2022-12-06 07:58:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:11,820 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-06 07:58:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:11,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753738924] [2022-12-06 07:58:11,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753738924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:11,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:11,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:58:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237103519] [2022-12-06 07:58:11,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:11,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:58:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:11,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:58:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:58:11,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:58:11,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:58:11,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:11,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:58:11,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:11,947 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 07:58:11,948 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 07:58:11,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3601 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 07:58:11,950 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:58:11,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 07:58:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:58:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:58:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:58:11,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 07:58:11,951 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:58:11,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 07:58:11,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:58:11,954 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:11,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 07:58:11,957 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:58:11,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:11,957 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:11,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:11,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:11,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:11,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:11,976 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 07:58:11,976 INFO L131 PetriNetUnfolder]: For 689/744 co-relation queries the response was YES. [2022-12-06 07:58:11,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 689/744 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1587 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 07:58:11,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:11,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 07:58:19,403 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 424 DAG size of output: 419 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:58:34,177 WARN L233 SmtUtils]: Spent 13.24s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:58:52,842 WARN L233 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:58:54,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:54,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42607 [2022-12-06 07:58:54,564 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 07:58:54,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:58:54,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:54,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:54,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:58:54,565 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-06 07:58:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1444537373, now seen corresponding path program 1 times [2022-12-06 07:58:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:54,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447095625] [2022-12-06 07:58:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:54,717 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-06 07:58:54,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:54,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447095625] [2022-12-06 07:58:54,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447095625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:54,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:54,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:58:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727583631] [2022-12-06 07:58:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:54,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:58:54,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:58:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:58:54,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:58:54,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:58:54,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:54,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:58:54,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:54,851 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 07:58:54,851 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 07:58:54,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3602 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 07:58:54,853 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:58:54,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 07:58:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:58:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:58:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:58:54,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 07:58:54,854 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:58:54,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 07:58:54,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:58:54,858 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:54,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 07:58:54,859 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:58:54,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:54,859 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:54,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:54,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:54,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:54,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:54,877 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 07:58:54,877 INFO L131 PetriNetUnfolder]: For 682/737 co-relation queries the response was YES. [2022-12-06 07:58:54,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 682/737 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1595 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 07:58:54,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:58:54,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 07:59:00,967 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 451 DAG size of output: 446 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:59:16,372 WARN L233 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:59:24,863 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 574 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:59:34,026 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 436 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:59:42,340 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:59:45,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:59:45,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50313 [2022-12-06 07:59:45,172 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 07:59:45,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:59:45,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:45,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:45,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:59:45,172 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-06 07:59:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1330020769, now seen corresponding path program 1 times [2022-12-06 07:59:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18867993] [2022-12-06 07:59:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:45,296 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-06 07:59:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18867993] [2022-12-06 07:59:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18867993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:59:45,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:59:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:59:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686009046] [2022-12-06 07:59:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:59:45,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:59:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:45,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:59:45,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:59:45,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:59:45,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 07:59:45,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:45,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:59:45,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:45,436 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 07:59:45,437 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 07:59:45,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3595 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 07:59:45,442 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:59:45,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 07:59:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:59:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:59:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:59:45,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 07:59:45,442 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:59:45,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 07:59:45,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:59:45,452 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 07:59:45,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 07:59:45,452 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:59:45,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:45,452 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:59:45,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:45,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:45,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:59:45,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 07:59:45,471 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 07:59:45,471 INFO L131 PetriNetUnfolder]: For 668/723 co-relation queries the response was YES. [2022-12-06 07:59:45,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 668/723 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1589 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 07:59:45,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 07:59:45,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 07:59:55,589 WARN L233 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:01,774 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 463 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:20,944 WARN L233 SmtUtils]: Spent 19.17s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:32,132 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:52,875 WARN L233 SmtUtils]: Spent 16.75s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:58,296 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 610 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:58,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:00:58,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72848 [2022-12-06 08:00:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 08:00:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:00:58,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:58,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 08:00:58,300 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-06 08:00:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1215504165, now seen corresponding path program 1 times [2022-12-06 08:00:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414180470] [2022-12-06 08:00:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:58,467 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-06 08:00:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:58,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414180470] [2022-12-06 08:00:58,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414180470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:00:58,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:00:58,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:00:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505971027] [2022-12-06 08:00:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:00:58,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:00:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:00:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:00:58,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:00:58,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:00:58,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:58,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:00:58,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:58,595 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 08:00:58,595 INFO L131 PetriNetUnfolder]: For 3067/3067 co-relation queries the response was YES. [2022-12-06 08:00:58,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3067/3067 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3602 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2682. Up to 680 conditions per place. [2022-12-06 08:00:58,598 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 08:00:58,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 08:00:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:00:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:00:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 08:00:58,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 08:00:58,599 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 08:00:58,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 08:00:58,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 08:00:58,603 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 08:00:58,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 08:00:58,603 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 08:00:58,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:58,603 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 08:00:58,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:58,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:58,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 08:00:58,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 08:00:58,622 INFO L130 PetriNetUnfolder]: 38/238 cut-off events. [2022-12-06 08:00:58,622 INFO L131 PetriNetUnfolder]: For 672/727 co-relation queries the response was YES. [2022-12-06 08:00:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 238 events. 38/238 cut-off events. For 672/727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1607 event pairs, 1 based on Foata normal form. 8/239 useless extension candidates. Maximal degree in co-relation 607. Up to 78 conditions per place. [2022-12-06 08:00:58,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 08:00:58,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 08:01:08,296 WARN L233 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:01:14,240 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:01:34,472 WARN L233 SmtUtils]: Spent 20.23s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:01:48,084 WARN L233 SmtUtils]: Spent 13.61s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:02:15,217 WARN L233 SmtUtils]: Spent 27.13s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:02:36,461 WARN L233 SmtUtils]: Spent 18.11s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:02:41,503 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:02:41,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:41,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102902 [2022-12-06 08:02:41,505 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 08:02:41,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:02:41,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:41,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:41,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 08:02:41,505 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-06 08:02:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash -760576519, now seen corresponding path program 1 times [2022-12-06 08:02:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:41,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150754235] [2022-12-06 08:02:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:41,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:41,576 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-06 08:02:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150754235] [2022-12-06 08:02:41,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150754235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:02:41,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:02:41,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 08:02:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493987962] [2022-12-06 08:02:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:02:41,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 08:02:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 08:02:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 08:02:41,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:02:41,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 08:02:41,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:41,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:02:41,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:41,778 INFO L130 PetriNetUnfolder]: 339/703 cut-off events. [2022-12-06 08:02:41,778 INFO L131 PetriNetUnfolder]: For 3140/3140 co-relation queries the response was YES. [2022-12-06 08:02:41,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 703 events. 339/703 cut-off events. For 3140/3140 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3736 event pairs, 183 based on Foata normal form. 16/718 useless extension candidates. Maximal degree in co-relation 2721. Up to 621 conditions per place. [2022-12-06 08:02:41,781 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 47 selfloop transitions, 9 changer transitions 5/61 dead transitions. [2022-12-06 08:02:41,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 601 flow [2022-12-06 08:02:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:02:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:02:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 08:02:41,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32413793103448274 [2022-12-06 08:02:41,781 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 5 states and 47 transitions. [2022-12-06 08:02:41,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 601 flow [2022-12-06 08:02:41,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 573 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:41,786 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 415 flow [2022-12-06 08:02:41,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-06 08:02:41,787 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 08:02:41,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:41,787 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 415 flow [2022-12-06 08:02:41,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:41,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:41,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 415 flow [2022-12-06 08:02:41,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 415 flow [2022-12-06 08:02:41,805 INFO L130 PetriNetUnfolder]: 38/233 cut-off events. [2022-12-06 08:02:41,805 INFO L131 PetriNetUnfolder]: For 740/793 co-relation queries the response was YES. [2022-12-06 08:02:41,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 233 events. 38/233 cut-off events. For 740/793 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1552 event pairs, 1 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 592. Up to 77 conditions per place. [2022-12-06 08:02:41,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 415 flow [2022-12-06 08:02:41,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:02:42,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:42,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1051 [2022-12-06 08:02:42,838 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 415 flow [2022-12-06 08:02:42,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 08:02:42,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:42,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:42,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 08:02:42,839 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-06 08:02:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1158245863, now seen corresponding path program 1 times [2022-12-06 08:02:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432862839] [2022-12-06 08:02:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:42,928 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-06 08:02:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432862839] [2022-12-06 08:02:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432862839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:02:42,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:02:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:02:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844600252] [2022-12-06 08:02:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:02:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:02:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:02:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:02:42,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:02:42,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:02:42,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:42,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:02:42,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:43,060 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 08:02:43,061 INFO L131 PetriNetUnfolder]: For 3460/3460 co-relation queries the response was YES. [2022-12-06 08:02:43,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 674 events. 330/674 cut-off events. For 3460/3460 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3449 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2597. Up to 665 conditions per place. [2022-12-06 08:02:43,063 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 08:02:43,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 526 flow [2022-12-06 08:02:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:02:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:02:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 08:02:43,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 08:02:43,064 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 415 flow. Second operand 3 states and 34 transitions. [2022-12-06 08:02:43,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 526 flow [2022-12-06 08:02:43,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 472 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:43,070 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 384 flow [2022-12-06 08:02:43,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 08:02:43,070 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 08:02:43,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:43,070 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 384 flow [2022-12-06 08:02:43,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:43,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:43,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 384 flow [2022-12-06 08:02:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 384 flow [2022-12-06 08:02:43,088 INFO L130 PetriNetUnfolder]: 38/227 cut-off events. [2022-12-06 08:02:43,089 INFO L131 PetriNetUnfolder]: For 675/729 co-relation queries the response was YES. [2022-12-06 08:02:43,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 227 events. 38/227 cut-off events. For 675/729 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1479 event pairs, 1 based on Foata normal form. 7/226 useless extension candidates. Maximal degree in co-relation 568. Up to 77 conditions per place. [2022-12-06 08:02:43,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 384 flow [2022-12-06 08:02:43,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:03:09,647 WARN L233 SmtUtils]: Spent 26.55s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:03:14,871 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:03:30,032 WARN L233 SmtUtils]: Spent 15.16s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:03:37,634 WARN L233 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:06,973 WARN L233 SmtUtils]: Spent 29.33s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:14,271 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:40,147 WARN L233 SmtUtils]: Spent 25.85s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:57,189 WARN L233 SmtUtils]: Spent 17.04s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:57,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:04:57,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134122 [2022-12-06 08:04:57,192 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 385 flow [2022-12-06 08:04:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:04:57,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:04:57,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:04:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 08:04:57,192 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-06 08:04:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:04:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -167906439, now seen corresponding path program 1 times [2022-12-06 08:04:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:04:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144672636] [2022-12-06 08:04:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:04:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:04:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:04:57,284 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-06 08:04:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:04:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144672636] [2022-12-06 08:04:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144672636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:04:57,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:04:57,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:04:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040099334] [2022-12-06 08:04:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:04:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:04:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:04:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:04:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:04:57,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:04:57,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:04:57,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:04:57,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:04:57,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:04:57,433 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 08:04:57,433 INFO L131 PetriNetUnfolder]: For 3162/3162 co-relation queries the response was YES. [2022-12-06 08:04:57,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 674 events. 330/674 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3459 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2667. Up to 665 conditions per place. [2022-12-06 08:04:57,435 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 08:04:57,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 496 flow [2022-12-06 08:04:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:04:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:04:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 08:04:57,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 08:04:57,436 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 385 flow. Second operand 3 states and 34 transitions. [2022-12-06 08:04:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 496 flow [2022-12-06 08:04:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 08:04:57,440 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 08:04:57,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 08:04:57,440 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 08:04:57,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:04:57,440 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:04:57,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:04:57,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:04:57,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:04:57,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:04:57,458 INFO L130 PetriNetUnfolder]: 38/231 cut-off events. [2022-12-06 08:04:57,458 INFO L131 PetriNetUnfolder]: For 682/736 co-relation queries the response was YES. [2022-12-06 08:04:57,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 231 events. 38/231 cut-off events. For 682/736 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1542 event pairs, 1 based on Foata normal form. 7/230 useless extension candidates. Maximal degree in co-relation 594. Up to 77 conditions per place. [2022-12-06 08:04:57,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:04:57,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:05:18,797 WARN L233 SmtUtils]: Spent 21.33s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:05:36,583 WARN L233 SmtUtils]: Spent 14.80s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:05:48,034 WARN L233 SmtUtils]: Spent 11.44s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:06:03,066 WARN L233 SmtUtils]: Spent 15.01s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:06:18,856 WARN L233 SmtUtils]: Spent 15.78s on a formula simplification that was a NOOP. DAG size: 544 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:07:00,199 WARN L233 SmtUtils]: Spent 41.34s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:07:15,105 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:07:15,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:07:15,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137668 [2022-12-06 08:07:15,108 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 383 flow [2022-12-06 08:07:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:07:15,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:07:15,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:07:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 08:07:15,108 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-06 08:07:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:07:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1417579526, now seen corresponding path program 1 times [2022-12-06 08:07:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:07:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992377036] [2022-12-06 08:07:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:07:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:07:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:07:15,261 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-06 08:07:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:07:15,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992377036] [2022-12-06 08:07:15,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992377036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:07:15,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:07:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 08:07:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402780440] [2022-12-06 08:07:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:07:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 08:07:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:07:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 08:07:15,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 08:07:15,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:07:15,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 08:07:15,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:07:15,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:07:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:07:15,436 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 08:07:15,437 INFO L131 PetriNetUnfolder]: For 3137/3137 co-relation queries the response was YES. [2022-12-06 08:07:15,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 674 events. 330/674 cut-off events. For 3137/3137 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3522 event pairs, 183 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2593. Up to 617 conditions per place. [2022-12-06 08:07:15,439 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-06 08:07:15,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 552 flow [2022-12-06 08:07:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 08:07:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 08:07:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 08:07:15,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 08:07:15,439 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 383 flow. Second operand 4 states and 42 transitions. [2022-12-06 08:07:15,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 552 flow [2022-12-06 08:07:15,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 528 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 08:07:15,443 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 392 flow [2022-12-06 08:07:15,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 08:07:15,444 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 08:07:15,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:07:15,444 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 392 flow [2022-12-06 08:07:15,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:07:15,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:07:15,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 392 flow [2022-12-06 08:07:15,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 392 flow [2022-12-06 08:07:15,465 INFO L130 PetriNetUnfolder]: 38/227 cut-off events. [2022-12-06 08:07:15,466 INFO L131 PetriNetUnfolder]: For 679/733 co-relation queries the response was YES. [2022-12-06 08:07:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 227 events. 38/227 cut-off events. For 679/733 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1491 event pairs, 1 based on Foata normal form. 7/226 useless extension candidates. Maximal degree in co-relation 550. Up to 77 conditions per place. [2022-12-06 08:07:15,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 392 flow [2022-12-06 08:07:15,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:07:16,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:07:16,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1419 [2022-12-06 08:07:16,863 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 393 flow [2022-12-06 08:07:16,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 08:07:16,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:07:16,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:07:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 08:07:16,863 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-06 08:07:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:07:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -714450951, now seen corresponding path program 1 times [2022-12-06 08:07:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:07:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231985831] [2022-12-06 08:07:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:07:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:07:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:07:16,959 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-06 08:07:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:07:16,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231985831] [2022-12-06 08:07:16,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231985831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:07:16,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:07:16,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:07:16,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659069800] [2022-12-06 08:07:16,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:07:16,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:07:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:07:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:07:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:07:16,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:07:16,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:07:16,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:07:16,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:07:16,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:07:17,130 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 08:07:17,131 INFO L131 PetriNetUnfolder]: For 3287/3287 co-relation queries the response was YES. [2022-12-06 08:07:17,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 674 events. 330/674 cut-off events. For 3287/3287 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3456 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2487. Up to 665 conditions per place. [2022-12-06 08:07:17,132 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 08:07:17,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 504 flow [2022-12-06 08:07:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:07:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:07:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 08:07:17,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 08:07:17,134 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 393 flow. Second operand 3 states and 34 transitions. [2022-12-06 08:07:17,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 504 flow [2022-12-06 08:07:17,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 08:07:17,150 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 08:07:17,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 08:07:17,150 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 08:07:17,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:07:17,151 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:07:17,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:07:17,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:07:17,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:07:17,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:07:17,172 INFO L130 PetriNetUnfolder]: 38/229 cut-off events. [2022-12-06 08:07:17,172 INFO L131 PetriNetUnfolder]: For 670/724 co-relation queries the response was YES. [2022-12-06 08:07:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 229 events. 38/229 cut-off events. For 670/724 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1516 event pairs, 1 based on Foata normal form. 7/228 useless extension candidates. Maximal degree in co-relation 579. Up to 77 conditions per place. [2022-12-06 08:07:17,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:07:17,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:07:36,247 WARN L233 SmtUtils]: Spent 19.06s on a formula simplification. DAG size of input: 586 DAG size of output: 581 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:08:07,885 WARN L233 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 769 DAG size of output: 764 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:08:23,097 WARN L233 SmtUtils]: Spent 15.21s on a formula simplification that was a NOOP. DAG size: 754 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:08:50,816 WARN L233 SmtUtils]: Spent 27.71s on a formula simplification. DAG size of input: 586 DAG size of output: 581 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:09:07,377 WARN L233 SmtUtils]: Spent 16.55s on a formula simplification that was a NOOP. DAG size: 571 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:09:38,492 WARN L233 SmtUtils]: Spent 31.11s on a formula simplification. DAG size of input: 769 DAG size of output: 764 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:09:50,297 WARN L233 SmtUtils]: Spent 11.80s on a formula simplification that was a NOOP. DAG size: 754 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:09:50,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:09:50,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153153 [2022-12-06 08:09:50,304 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 383 flow [2022-12-06 08:09:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:09:50,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:09:50,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:09:50,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 08:09:50,305 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-06 08:09:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:09:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1892203141, now seen corresponding path program 1 times [2022-12-06 08:09:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:09:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595777007] [2022-12-06 08:09:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:09:50,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:09:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:09:50,403 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-06 08:09:50,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:09:50,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595777007] [2022-12-06 08:09:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595777007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:09:50,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:09:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:09:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846144100] [2022-12-06 08:09:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:09:50,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:09:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:09:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:09:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:09:50,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 08:09:50,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 08:09:50,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:09:50,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 08:09:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:09:50,537 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 08:09:50,537 INFO L131 PetriNetUnfolder]: For 3126/3126 co-relation queries the response was YES. [2022-12-06 08:09:50,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 674 events. 330/674 cut-off events. For 3126/3126 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3459 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2667. Up to 665 conditions per place. [2022-12-06 08:09:50,539 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 08:09:50,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 494 flow [2022-12-06 08:09:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:09:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:09:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 08:09:50,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 08:09:50,540 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 383 flow. Second operand 3 states and 34 transitions. [2022-12-06 08:09:50,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 494 flow [2022-12-06 08:09:50,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 08:09:50,544 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 08:09:50,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 08:09:50,544 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 08:09:50,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:09:50,544 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:09:50,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:09:50,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:09:50,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:09:50,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 08:09:50,560 INFO L130 PetriNetUnfolder]: 38/231 cut-off events. [2022-12-06 08:09:50,561 INFO L131 PetriNetUnfolder]: For 674/728 co-relation queries the response was YES. [2022-12-06 08:09:50,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 231 events. 38/231 cut-off events. For 674/728 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1540 event pairs, 1 based on Foata normal form. 7/230 useless extension candidates. Maximal degree in co-relation 594. Up to 77 conditions per place. [2022-12-06 08:09:50,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 08:09:50,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 08:10:14,069 WARN L233 SmtUtils]: Spent 23.50s on a formula simplification. DAG size of input: 613 DAG size of output: 608 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Received shutdown request... [2022-12-06 08:10:39,176 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-06 08:10:40,376 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 08:10:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 08:10:40,386 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:310) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.structure.IcfgEdgeBuilder.constructSequentialComposition(IcfgEdgeBuilder.java:112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:125) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 08:10:40,389 INFO L158 Benchmark]: Toolchain (without parser) took 873000.71ms. Allocated memory was 182.5MB in the beginning and 679.5MB in the end (delta: 497.0MB). Free memory was 158.4MB in the beginning and 470.3MB in the end (delta: -311.8MB). Peak memory consumption was 448.0MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,389 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 08:10:40,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.36ms. Allocated memory is still 182.5MB. Free memory was 158.4MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 182.5MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,389 INFO L158 Benchmark]: Boogie Preprocessor took 22.73ms. Allocated memory is still 182.5MB. Free memory was 144.4MB in the beginning and 142.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,389 INFO L158 Benchmark]: RCFGBuilder took 371.93ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 125.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,390 INFO L158 Benchmark]: TraceAbstraction took 872330.36ms. Allocated memory was 182.5MB in the beginning and 679.5MB in the end (delta: 497.0MB). Free memory was 125.0MB in the beginning and 470.3MB in the end (delta: -345.3MB). Peak memory consumption was 414.4MB. Max. memory is 8.0GB. [2022-12-06 08:10:40,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-06 08:10:40,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.36ms. Allocated memory is still 182.5MB. Free memory was 158.4MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 182.5MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.73ms. Allocated memory is still 182.5MB. Free memory was 144.4MB in the beginning and 142.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.93ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 125.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 872330.36ms. Allocated memory was 182.5MB in the beginning and 679.5MB in the end (delta: 497.0MB). Free memory was 125.0MB in the beginning and 470.3MB in the end (delta: -345.3MB). Peak memory consumption was 414.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 170 PlacesBefore, 21 PlacesAfterwards, 181 TransitionsBefore, 17 TransitionsAfterwards, 4092 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 85 ConcurrentYvCompositions, 13 ChoiceCompositions, 162 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 2766, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2768, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2535, unknown conditional: 0, unknown unconditional: 2535] , Statistics on independence cache: Total cache size (in pairs): 5095, Positive cache size: 5093, Positive conditional cache size: 0, Positive unconditional cache size: 5093, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.1s, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 3, Positive unconditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 17, Positive conditional cache size: 10, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, 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.4s, 26 PlacesBefore, 26 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 13, Positive unconditional cache size: 21, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 38, Positive conditional cache size: 15, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 43, Positive conditional cache size: 18, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 46, Positive conditional cache size: 21, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 31, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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.7s, 35 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 27, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 34, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 41 PlacesBefore, 41 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 72, Positive conditional cache size: 44, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 42 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 75, Positive conditional cache size: 47, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 82, Positive conditional cache size: 52, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 44 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 85, Positive conditional cache size: 55, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 43 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 88, Positive conditional cache size: 58, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 49 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 91, Positive conditional cache size: 61, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 182 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): 96, Positive cache size: 91, Positive conditional cache size: 61, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, 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: 4.6s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 94, Positive conditional cache size: 64, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 101, Positive conditional cache size: 69, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 104, Positive conditional cache size: 72, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 111, Positive conditional cache size: 77, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 114, Positive conditional cache size: 80, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 54 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 46 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 15, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 120, Positive conditional cache size: 86, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.0s, 55 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 123, Positive conditional cache size: 89, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.5s, 54 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 126, Positive conditional cache size: 92, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 178 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): 131, Positive cache size: 126, Positive conditional cache size: 92, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, 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: 26.5s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 129, Positive conditional cache size: 95, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.6s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 132, Positive conditional cache size: 98, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.3s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 135, Positive conditional cache size: 101, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.8s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 138, Positive conditional cache size: 104, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.9s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 141, Positive conditional cache size: 107, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 144, Positive conditional cache size: 110, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 134.1s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 147, Positive conditional cache size: 113, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 137.6s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 150, Positive conditional cache size: 116, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 153, Positive conditional cache size: 119, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.1s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 156, Positive conditional cache size: 122, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown