/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:06:57,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:06:57,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:06:57,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:06:57,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:06:57,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:06:57,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:06:57,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:06:57,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:06:57,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:06:57,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:06:57,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:06:57,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:06:57,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:06:57,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:06:57,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:06:57,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:06:57,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:06:57,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:06:57,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:06:57,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:06:57,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:06:57,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:06:57,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:06:57,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:06:57,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:06:57,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:06:57,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:06:57,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:06:57,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:06:57,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:06:57,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:06:57,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:06:57,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:06:57,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:06:57,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:06:57,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:06:57,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:06:57,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:06:57,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:06:57,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:06:57,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:06:57,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:06:57,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:06:57,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:06:57,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:06:57,376 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:06:57,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:06:57,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:06:57,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:06:57,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:06:57,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:06:57,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:06:57,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:57,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:06:57,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:06:57,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:06:57,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:06:57,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:06:57,380 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 00:06:57,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:06:57,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:06:57,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:06:57,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:06:57,646 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:06:57,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2022-12-06 00:06:58,691 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:06:58,906 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:06:58,907 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2022-12-06 00:06:58,911 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d53572c9/663bb6746e8c4ee683bb6e8293d570ac/FLAGfd4eecd87 [2022-12-06 00:06:58,922 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d53572c9/663bb6746e8c4ee683bb6e8293d570ac [2022-12-06 00:06:58,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:06:58,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:06:58,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:58,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:06:58,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:06:58,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:58" (1/1) ... [2022-12-06 00:06:58,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1bf76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:58, skipping insertion in model container [2022-12-06 00:06:58,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:58" (1/1) ... [2022-12-06 00:06:58,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:06:58,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:06:59,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,061 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/parallel-ticket-5.wvr.c[3963,3976] [2022-12-06 00:06:59,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:59,071 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:06:59,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:59,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:59,094 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/parallel-ticket-5.wvr.c[3963,3976] [2022-12-06 00:06:59,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:59,109 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:06:59,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59 WrapperNode [2022-12-06 00:06:59,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:59,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:59,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:06:59,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:06:59,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,164 INFO L138 Inliner]: procedures = 24, calls = 85, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 238 [2022-12-06 00:06:59,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:59,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:06:59,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:06:59,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:06:59,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,209 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:06:59,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:06:59,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:06:59,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:06:59,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (1/1) ... [2022-12-06 00:06:59,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:06:59,244 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 00:06:59,264 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 00:06:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:06:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:06:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:06:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:06:59,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:06:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:06:59,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:06:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:06:59,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:06:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 00:06:59,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:06:59,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:06:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:06:59,279 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 00:06:59,367 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:06:59,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:06:59,600 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:06:59,718 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:06:59,718 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:06:59,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:59 BoogieIcfgContainer [2022-12-06 00:06:59,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:06:59,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:06:59,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:06:59,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:06:59,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:06:58" (1/3) ... [2022-12-06 00:06:59,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d9251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:59, skipping insertion in model container [2022-12-06 00:06:59,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:59" (2/3) ... [2022-12-06 00:06:59,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d9251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:59, skipping insertion in model container [2022-12-06 00:06:59,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:59" (3/3) ... [2022-12-06 00:06:59,726 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2022-12-06 00:06:59,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:06:59,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:06:59,740 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:06:59,817 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-12-06 00:06:59,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 158 transitions, 356 flow [2022-12-06 00:06:59,926 INFO L130 PetriNetUnfolder]: 2/153 cut-off events. [2022-12-06 00:06:59,926 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:06:59,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 153 events. 2/153 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 00:06:59,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 158 transitions, 356 flow [2022-12-06 00:06:59,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 139 transitions, 308 flow [2022-12-06 00:06:59,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:00,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 139 transitions, 308 flow [2022-12-06 00:07:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 139 transitions, 308 flow [2022-12-06 00:07:00,039 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2022-12-06 00:07:00,039 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:07:00,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 139 events. 2/139 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 00:07:00,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 139 transitions, 308 flow [2022-12-06 00:07:00,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-06 00:07:05,540 INFO L203 LiptonReduction]: Total number of compositions: 107 [2022-12-06 00:07:05,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:07:05,579 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;@eb7112a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:07:05,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 00:07:05,591 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-06 00:07:05,592 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:07:05,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:05,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:05,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1497497654, now seen corresponding path program 1 times [2022-12-06 00:07:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697908726] [2022-12-06 00:07:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:06,582 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 00:07:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:06,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697908726] [2022-12-06 00:07:06,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697908726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:06,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:06,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800735593] [2022-12-06 00:07:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:06,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:06,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:07:06,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 94 flow. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:06,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:06,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:07:06,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:07,268 INFO L130 PetriNetUnfolder]: 4477/6257 cut-off events. [2022-12-06 00:07:07,268 INFO L131 PetriNetUnfolder]: For 606/606 co-relation queries the response was YES. [2022-12-06 00:07:07,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13169 conditions, 6257 events. 4477/6257 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 28323 event pairs, 1201 based on Foata normal form. 1/6258 useless extension candidates. Maximal degree in co-relation 10166. Up to 2759 conditions per place. [2022-12-06 00:07:07,303 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 70 selfloop transitions, 11 changer transitions 10/91 dead transitions. [2022-12-06 00:07:07,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 439 flow [2022-12-06 00:07:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 00:07:07,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 00:07:07,315 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 94 flow. Second operand 5 states and 92 transitions. [2022-12-06 00:07:07,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 439 flow [2022-12-06 00:07:07,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 91 transitions, 389 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-12-06 00:07:07,334 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 150 flow [2022-12-06 00:07:07,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-06 00:07:07,338 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-06 00:07:07,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:07,339 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 150 flow [2022-12-06 00:07:07,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:07,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:07,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 150 flow [2022-12-06 00:07:07,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 150 flow [2022-12-06 00:07:07,358 INFO L130 PetriNetUnfolder]: 94/202 cut-off events. [2022-12-06 00:07:07,359 INFO L131 PetriNetUnfolder]: For 55/108 co-relation queries the response was YES. [2022-12-06 00:07:07,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 202 events. 94/202 cut-off events. For 55/108 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 805 event pairs, 55 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 457. Up to 137 conditions per place. [2022-12-06 00:07:07,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 150 flow [2022-12-06 00:07:07,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 00:07:07,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:07:07,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res#1.offset_27| 0) (= |v_thread4Thread1of1ForFork3_#res#1.base_27| 0) (= (+ v_~s~0_530 1) v_~s~0_529) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| 0)) (= (ite (<= v_~m4~0_73 v_~s~0_530) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|) (= v_~b~0_283 (ite (= (ite (or (not (= (mod v_~b~0_284 256) 0)) (= v_~x~0_182 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|)) InVars {~b~0=v_~b~0_284, ~m4~0=v_~m4~0_73, ~x~0=v_~x~0_182, ~s~0=v_~s~0_530} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_27|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39|, ~b~0=v_~b~0_283, ~m4~0=v_~m4~0_73, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_43|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|, ~x~0=v_~x~0_182, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_27|, ~s~0=v_~s~0_529} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] [2022-12-06 00:07:07,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:07,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [599] L124-->thread5EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_244 256) 0)) (= v_~x~0_153 1)) 1 0) 0) 0 1) v_~b~0_243) (= 0 |v_thread5Thread1of1ForFork0_#res#1.offset_7|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_77 v_~s~0_478) 1 0)) (= (+ v_~s~0_478 1) v_~s~0_477) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|)) InVars {~b~0=v_~b~0_244, ~m5~0=v_~m5~0_77, ~x~0=v_~x~0_153, ~s~0=v_~s~0_478} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_49|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~b~0=v_~b~0_243, ~m5~0=v_~m5~0_77, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_7|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_7|, ~x~0=v_~x~0_153, ~s~0=v_~s~0_477} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~s~0] [2022-12-06 00:07:07,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_202 1))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) .cse0 (= (ite (<= v_~m1~0_97 v_~s~0_560) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= v_~s~0_559 (+ v_~s~0_560 1)) (= |v_thread3Thread1of1ForFork1_#res#1.base_35| 0) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (= v_~b~0_311 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_312 256) 0))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| (ite (<= v_~m3~0_99 v_~s~0_560) 1 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_35| 0))) InVars {~m3~0=v_~m3~0_99, ~b~0=v_~b~0_312, ~m1~0=v_~m1~0_97, ~s~0=v_~s~0_560} OutVars{~m3~0=v_~m3~0_99, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_35|, ~b~0=v_~b~0_311, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_35|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~m1~0=v_~m1~0_97, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_55|, ~x~0=v_~x~0_202, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~s~0=v_~s~0_559} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post6#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:07,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [610] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_204 1))) (and (= v_~b~0_315 (ite (= (ite (or (not (= (mod v_~b~0_316 256) 0)) .cse0) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= (ite (<= v_~m4~0_79 v_~s~0_564) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_43| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread4Thread1of1ForFork3_#res#1.base_31| 0) (= |v_thread4Thread1of1ForFork3_#res#1.offset_31| 0) (= (+ v_~s~0_564 1) v_~s~0_563) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_43| 0)) (= (ite (<= v_~m1~0_99 v_~s~0_564) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) .cse0)) InVars {~b~0=v_~b~0_316, ~m4~0=v_~m4~0_79, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_564} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_31|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~b~0=v_~b~0_315, ~m4~0=v_~m4~0_79, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~m1~0=v_~m1~0_99, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_47|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~x~0=v_~x~0_204, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_31|, ~s~0=v_~s~0_563} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:07,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_206 1))) (and (= v_~b~0_319 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_320 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_47| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_47|) .cse0 (= (+ v_~s~0_568 1) v_~s~0_567) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m2~0_97 v_~s~0_568) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_47| 0)) (= (ite (<= v_~m1~0_101 v_~s~0_568) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (= |v_thread2Thread1of1ForFork4_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_13| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| 0)))) InVars {~b~0=v_~b~0_320, ~m2~0=v_~m2~0_97, ~m1~0=v_~m1~0_101, ~s~0=v_~s~0_568} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_47|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_13|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_47|, ~b~0=v_~b~0_319, ~m2~0=v_~m2~0_97, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, ~m1~0=v_~m1~0_101, ~x~0=v_~x~0_206, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_47|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_43|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_13|, ~s~0=v_~s~0_567} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:07,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_208 1))) (and .cse0 (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|) (= (ite (<= v_~m1~0_103 v_~s~0_572) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m5~0_93 v_~s~0_572) 1 0)) (= |v_thread5Thread1of1ForFork0_#res#1.base_13| 0) (= (+ v_~s~0_572 1) v_~s~0_571) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0)) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_324 256) 0))) 1 0) 0) 0 1) v_~b~0_323))) InVars {~b~0=v_~b~0_324, ~m5~0=v_~m5~0_93, ~m1~0=v_~m1~0_103, ~s~0=v_~s~0_572} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_55|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|, ~b~0=v_~b~0_323, ~m5~0=v_~m5~0_93, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|, ~m1~0=v_~m1~0_103, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_13|, ~x~0=v_~x~0_208, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, ~s~0=v_~s~0_571} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:08,066 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:08,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 730 [2022-12-06 00:07:08,068 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 160 flow [2022-12-06 00:07:08,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:08,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:08,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:08,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:07:08,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash -272783004, now seen corresponding path program 2 times [2022-12-06 00:07:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:08,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744572001] [2022-12-06 00:07:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:08,507 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 00:07:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:08,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744572001] [2022-12-06 00:07:08,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744572001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:08,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:08,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375988325] [2022-12-06 00:07:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:08,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:08,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:07:08,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 160 flow. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:08,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:08,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:07:08,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:08,917 INFO L130 PetriNetUnfolder]: 3996/5596 cut-off events. [2022-12-06 00:07:08,917 INFO L131 PetriNetUnfolder]: For 3071/3071 co-relation queries the response was YES. [2022-12-06 00:07:08,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16148 conditions, 5596 events. 3996/5596 cut-off events. For 3071/3071 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 25096 event pairs, 611 based on Foata normal form. 1/5597 useless extension candidates. Maximal degree in co-relation 9801. Up to 2648 conditions per place. [2022-12-06 00:07:08,937 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 70 selfloop transitions, 14 changer transitions 16/100 dead transitions. [2022-12-06 00:07:08,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 100 transitions, 546 flow [2022-12-06 00:07:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 00:07:08,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2022-12-06 00:07:08,939 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 160 flow. Second operand 5 states and 97 transitions. [2022-12-06 00:07:08,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 100 transitions, 546 flow [2022-12-06 00:07:08,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 100 transitions, 530 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:08,942 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 235 flow [2022-12-06 00:07:08,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 00:07:08,942 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-06 00:07:08,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:08,943 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 235 flow [2022-12-06 00:07:08,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:08,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:08,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 235 flow [2022-12-06 00:07:08,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 235 flow [2022-12-06 00:07:08,957 INFO L130 PetriNetUnfolder]: 90/192 cut-off events. [2022-12-06 00:07:08,957 INFO L131 PetriNetUnfolder]: For 409/608 co-relation queries the response was YES. [2022-12-06 00:07:08,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 192 events. 90/192 cut-off events. For 409/608 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 689 event pairs, 18 based on Foata normal form. 1/176 useless extension candidates. Maximal degree in co-relation 654. Up to 132 conditions per place. [2022-12-06 00:07:08,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 235 flow [2022-12-06 00:07:08,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 00:07:08,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:07:09,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res#1.offset_27| 0) (= |v_thread4Thread1of1ForFork3_#res#1.base_27| 0) (= (+ v_~s~0_530 1) v_~s~0_529) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| 0)) (= (ite (<= v_~m4~0_73 v_~s~0_530) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|) (= v_~b~0_283 (ite (= (ite (or (not (= (mod v_~b~0_284 256) 0)) (= v_~x~0_182 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|)) InVars {~b~0=v_~b~0_284, ~m4~0=v_~m4~0_73, ~x~0=v_~x~0_182, ~s~0=v_~s~0_530} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_27|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39|, ~b~0=v_~b~0_283, ~m4~0=v_~m4~0_73, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_43|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|, ~x~0=v_~x~0_182, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_27|, ~s~0=v_~s~0_529} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] [2022-12-06 00:07:09,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:09,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (= (ite (<= v_~m1~0_33 v_~s~0_217) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= v_~x~0_37 1)) InVars {~m1~0=v_~m1~0_33, ~s~0=v_~s~0_217} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_33, ~x~0=v_~x~0_37, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_217} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [599] L124-->thread5EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_244 256) 0)) (= v_~x~0_153 1)) 1 0) 0) 0 1) v_~b~0_243) (= 0 |v_thread5Thread1of1ForFork0_#res#1.offset_7|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_77 v_~s~0_478) 1 0)) (= (+ v_~s~0_478 1) v_~s~0_477) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|)) InVars {~b~0=v_~b~0_244, ~m5~0=v_~m5~0_77, ~x~0=v_~x~0_153, ~s~0=v_~s~0_478} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_49|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~b~0=v_~b~0_243, ~m5~0=v_~m5~0_77, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_7|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_7|, ~x~0=v_~x~0_153, ~s~0=v_~s~0_477} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~s~0] [2022-12-06 00:07:09,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:09,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-06 00:07:09,279 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 251 flow [2022-12-06 00:07:09,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:07:09,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -42198307, now seen corresponding path program 1 times [2022-12-06 00:07:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884982769] [2022-12-06 00:07:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:09,428 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 00:07:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884982769] [2022-12-06 00:07:09,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884982769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:09,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:09,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069065844] [2022-12-06 00:07:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:09,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:09,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:09,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:09,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:07:09,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:09,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:07:09,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:09,815 INFO L130 PetriNetUnfolder]: 3193/4414 cut-off events. [2022-12-06 00:07:09,815 INFO L131 PetriNetUnfolder]: For 10088/10088 co-relation queries the response was YES. [2022-12-06 00:07:09,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16361 conditions, 4414 events. 3193/4414 cut-off events. For 10088/10088 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18699 event pairs, 566 based on Foata normal form. 60/4474 useless extension candidates. Maximal degree in co-relation 8144. Up to 4044 conditions per place. [2022-12-06 00:07:09,837 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 71 selfloop transitions, 19 changer transitions 3/93 dead transitions. [2022-12-06 00:07:09,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 665 flow [2022-12-06 00:07:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 00:07:09,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.455 [2022-12-06 00:07:09,838 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 251 flow. Second operand 5 states and 91 transitions. [2022-12-06 00:07:09,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 665 flow [2022-12-06 00:07:09,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 524 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:09,845 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 329 flow [2022-12-06 00:07:09,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-06 00:07:09,846 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-06 00:07:09,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:09,846 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 329 flow [2022-12-06 00:07:09,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:09,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:09,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 329 flow [2022-12-06 00:07:09,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 61 transitions, 329 flow [2022-12-06 00:07:09,887 INFO L130 PetriNetUnfolder]: 355/751 cut-off events. [2022-12-06 00:07:09,887 INFO L131 PetriNetUnfolder]: For 920/1002 co-relation queries the response was YES. [2022-12-06 00:07:09,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 751 events. 355/751 cut-off events. For 920/1002 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4386 event pairs, 64 based on Foata normal form. 12/701 useless extension candidates. Maximal degree in co-relation 2000. Up to 410 conditions per place. [2022-12-06 00:07:09,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 61 transitions, 329 flow [2022-12-06 00:07:09,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 00:07:09,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_226 1))) (and (= (+ v_~s~0_600 1) v_~s~0_599) (= (ite (<= v_~m1~0_113 v_~s~0_600) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_39| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| 0)) .cse0 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.base_39| 0) (= (ite (= 0 (ite (or .cse0 (not (= (mod v_~b~0_344 256) 0))) 1 0)) 0 1) v_~b~0_343) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63| (ite (<= v_~m3~0_103 v_~s~0_600) 1 0)))) InVars {~m3~0=v_~m3~0_103, ~b~0=v_~b~0_344, ~m1~0=v_~m1~0_113, ~s~0=v_~s~0_600} OutVars{~m3~0=v_~m3~0_103, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_39|, ~b~0=v_~b~0_343, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_39|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|, ~m1~0=v_~m1~0_113, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_59|, ~x~0=v_~x~0_226, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_55|, ~s~0=v_~s~0_599} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post6#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:09,980 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:09,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 00:07:09,981 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 61 transitions, 333 flow [2022-12-06 00:07:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:07:09,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1318423699, now seen corresponding path program 2 times [2022-12-06 00:07:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689543820] [2022-12-06 00:07:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:10,161 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 00:07:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:10,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689543820] [2022-12-06 00:07:10,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689543820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:10,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:10,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785953036] [2022-12-06 00:07:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:10,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:07:10,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 61 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:10,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:07:10,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:10,511 INFO L130 PetriNetUnfolder]: 2790/3869 cut-off events. [2022-12-06 00:07:10,511 INFO L131 PetriNetUnfolder]: For 6419/6419 co-relation queries the response was YES. [2022-12-06 00:07:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14044 conditions, 3869 events. 2790/3869 cut-off events. For 6419/6419 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16054 event pairs, 644 based on Foata normal form. 56/3925 useless extension candidates. Maximal degree in co-relation 6354. Up to 3705 conditions per place. [2022-12-06 00:07:10,528 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 69 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2022-12-06 00:07:10,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 625 flow [2022-12-06 00:07:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 00:07:10,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 00:07:10,529 INFO L175 Difference]: Start difference. First operand has 49 places, 61 transitions, 333 flow. Second operand 5 states and 82 transitions. [2022-12-06 00:07:10,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 625 flow [2022-12-06 00:07:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 611 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:10,539 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 413 flow [2022-12-06 00:07:10,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2022-12-06 00:07:10,539 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2022-12-06 00:07:10,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:10,539 INFO L89 Accepts]: Start accepts. Operand has 53 places, 66 transitions, 413 flow [2022-12-06 00:07:10,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:10,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:10,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 66 transitions, 413 flow [2022-12-06 00:07:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 66 transitions, 413 flow [2022-12-06 00:07:10,581 INFO L130 PetriNetUnfolder]: 358/778 cut-off events. [2022-12-06 00:07:10,581 INFO L131 PetriNetUnfolder]: For 710/804 co-relation queries the response was YES. [2022-12-06 00:07:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 778 events. 358/778 cut-off events. For 710/804 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4668 event pairs, 67 based on Foata normal form. 14/728 useless extension candidates. Maximal degree in co-relation 1775. Up to 412 conditions per place. [2022-12-06 00:07:10,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 66 transitions, 413 flow [2022-12-06 00:07:10,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-06 00:07:10,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_228 1))) (and (= (+ v_~s~0_604 1) v_~s~0_603) (= |v_thread4Thread1of1ForFork3_#res#1.base_35| 0) .cse0 (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_57| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57|) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_47| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47|) (= (ite (<= v_~m1~0_115 v_~s~0_604) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57|) (= (ite (<= v_~m4~0_83 v_~s~0_604) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_47| 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_57| 0)) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_348 256) 0))) 1 0) 0) 0 1) v_~b~0_347) (= |v_thread4Thread1of1ForFork3_#res#1.offset_35| 0))) InVars {~b~0=v_~b~0_348, ~m4~0=v_~m4~0_83, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_604} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_35|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|, ~b~0=v_~b~0_347, ~m4~0=v_~m4~0_83, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57|, ~m1~0=v_~m1~0_115, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_51|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47|, ~x~0=v_~x~0_228, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_57|, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_35|, ~s~0=v_~s~0_603} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:10,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:10,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 00:07:10,678 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 66 transitions, 415 flow [2022-12-06 00:07:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:10,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:07:10,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1448309927, now seen corresponding path program 3 times [2022-12-06 00:07:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:10,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924775023] [2022-12-06 00:07:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:10,836 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 00:07:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:10,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924775023] [2022-12-06 00:07:10,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924775023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:10,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:10,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934341469] [2022-12-06 00:07:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:10,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:07:10,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 66 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:10,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:07:10,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:11,160 INFO L130 PetriNetUnfolder]: 2634/3677 cut-off events. [2022-12-06 00:07:11,161 INFO L131 PetriNetUnfolder]: For 5126/5126 co-relation queries the response was YES. [2022-12-06 00:07:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12634 conditions, 3677 events. 2634/3677 cut-off events. For 5126/5126 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15075 event pairs, 910 based on Foata normal form. 48/3725 useless extension candidates. Maximal degree in co-relation 6478. Up to 3513 conditions per place. [2022-12-06 00:07:11,175 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 74 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2022-12-06 00:07:11,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 724 flow [2022-12-06 00:07:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 00:07:11,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-06 00:07:11,177 INFO L175 Difference]: Start difference. First operand has 53 places, 66 transitions, 415 flow. Second operand 6 states and 87 transitions. [2022-12-06 00:07:11,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 724 flow [2022-12-06 00:07:11,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 695 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:11,181 INFO L231 Difference]: Finished difference. Result has 57 places, 71 transitions, 477 flow [2022-12-06 00:07:11,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=57, PETRI_TRANSITIONS=71} [2022-12-06 00:07:11,182 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-06 00:07:11,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:11,182 INFO L89 Accepts]: Start accepts. Operand has 57 places, 71 transitions, 477 flow [2022-12-06 00:07:11,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:11,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:11,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 71 transitions, 477 flow [2022-12-06 00:07:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 71 transitions, 477 flow [2022-12-06 00:07:11,222 INFO L130 PetriNetUnfolder]: 326/743 cut-off events. [2022-12-06 00:07:11,222 INFO L131 PetriNetUnfolder]: For 754/941 co-relation queries the response was YES. [2022-12-06 00:07:11,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 743 events. 326/743 cut-off events. For 754/941 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4491 event pairs, 68 based on Foata normal form. 15/703 useless extension candidates. Maximal degree in co-relation 1703. Up to 366 conditions per place. [2022-12-06 00:07:11,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 71 transitions, 477 flow [2022-12-06 00:07:11,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 00:07:11,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:07:11,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 00:07:11,260 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:07:11,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:07:11,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_232 1))) (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m5~0_97 v_~s~0_612) 1 0)) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) .cse0 (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread5Thread1of1ForFork0_#res#1.base_17| 0) (= (+ v_~s~0_612 1) v_~s~0_611) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_356 256) 0))) 1 0) 0) 0 1) v_~b~0_355) (= (ite (<= v_~m1~0_119 v_~s~0_612) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|))) InVars {~b~0=v_~b~0_356, ~m5~0=v_~m5~0_97, ~m1~0=v_~m1~0_119, ~s~0=v_~s~0_612} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_59|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_355, ~m5~0=v_~m5~0_97, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_17|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_119, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_17|, ~x~0=v_~x~0_232, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~s~0=v_~s~0_611} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:11,400 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:11,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:07:11,401 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 70 transitions, 491 flow [2022-12-06 00:07:11,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:11,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:11,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:11,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:07:11,402 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1593741641, now seen corresponding path program 1 times [2022-12-06 00:07:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928244306] [2022-12-06 00:07:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:11,624 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 00:07:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:11,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928244306] [2022-12-06 00:07:11,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928244306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:11,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:11,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:07:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727828091] [2022-12-06 00:07:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:11,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:07:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:07:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:07:11,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:07:11,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 70 transitions, 491 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:11,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:11,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:07:11,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:12,260 INFO L130 PetriNetUnfolder]: 3251/4548 cut-off events. [2022-12-06 00:07:12,260 INFO L131 PetriNetUnfolder]: For 7773/7773 co-relation queries the response was YES. [2022-12-06 00:07:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16414 conditions, 4548 events. 3251/4548 cut-off events. For 7773/7773 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19960 event pairs, 844 based on Foata normal form. 144/4692 useless extension candidates. Maximal degree in co-relation 8689. Up to 3883 conditions per place. [2022-12-06 00:07:12,279 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 104 selfloop transitions, 76 changer transitions 0/180 dead transitions. [2022-12-06 00:07:12,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 180 transitions, 1393 flow [2022-12-06 00:07:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:07:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:07:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2022-12-06 00:07:12,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2902097902097902 [2022-12-06 00:07:12,281 INFO L175 Difference]: Start difference. First operand has 56 places, 70 transitions, 491 flow. Second operand 13 states and 166 transitions. [2022-12-06 00:07:12,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 180 transitions, 1393 flow [2022-12-06 00:07:12,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 180 transitions, 1372 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:12,291 INFO L231 Difference]: Finished difference. Result has 71 places, 120 transitions, 1070 flow [2022-12-06 00:07:12,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1070, PETRI_PLACES=71, PETRI_TRANSITIONS=120} [2022-12-06 00:07:12,292 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-06 00:07:12,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:12,292 INFO L89 Accepts]: Start accepts. Operand has 71 places, 120 transitions, 1070 flow [2022-12-06 00:07:12,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:12,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:12,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 120 transitions, 1070 flow [2022-12-06 00:07:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 120 transitions, 1070 flow [2022-12-06 00:07:12,370 INFO L130 PetriNetUnfolder]: 614/1182 cut-off events. [2022-12-06 00:07:12,370 INFO L131 PetriNetUnfolder]: For 2683/3096 co-relation queries the response was YES. [2022-12-06 00:07:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1182 events. 614/1182 cut-off events. For 2683/3096 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6974 event pairs, 70 based on Foata normal form. 19/1122 useless extension candidates. Maximal degree in co-relation 4069. Up to 639 conditions per place. [2022-12-06 00:07:12,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 120 transitions, 1070 flow [2022-12-06 00:07:12,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 700 [2022-12-06 00:07:12,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L105: Formula: (and (= v_~t~0_203 (+ v_~m4~0_90 1)) (= v_~t~0_205 v_~m1~0_133) (= v_~t~0_203 (+ v_~t~0_205 2))) InVars {~t~0=v_~t~0_205} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_29|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_12|, ~m4~0=v_~m4~0_90, ~m1~0=v_~m1~0_133, ~t~0=v_~t~0_203} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, ~t~0] and [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 00:07:12,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L105: Formula: (and (= v_~t~0_203 (+ v_~m4~0_90 1)) (= v_~t~0_205 v_~m1~0_133) (= v_~t~0_203 (+ v_~t~0_205 2))) InVars {~t~0=v_~t~0_205} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_29|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_12|, ~m4~0=v_~m4~0_90, ~m1~0=v_~m1~0_133, ~t~0=v_~t~0_203} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:07:12,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L105: Formula: (and (= v_~t~0_203 (+ v_~m4~0_90 1)) (= v_~t~0_205 v_~m1~0_133) (= v_~t~0_203 (+ v_~t~0_205 2))) InVars {~t~0=v_~t~0_205} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_29|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_12|, ~m4~0=v_~m4~0_90, ~m1~0=v_~m1~0_133, ~t~0=v_~t~0_203} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:07:12,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:12,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:07:12,461 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 119 transitions, 1082 flow [2022-12-06 00:07:12,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:12,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:12,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:07:12,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2046464483, now seen corresponding path program 1 times [2022-12-06 00:07:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:12,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015723825] [2022-12-06 00:07:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:12,601 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 00:07:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015723825] [2022-12-06 00:07:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015723825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:12,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92866390] [2022-12-06 00:07:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:12,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:07:12,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 119 transitions, 1082 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:12,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:07:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,091 INFO L130 PetriNetUnfolder]: 3251/4558 cut-off events. [2022-12-06 00:07:13,092 INFO L131 PetriNetUnfolder]: For 15174/15174 co-relation queries the response was YES. [2022-12-06 00:07:13,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20680 conditions, 4558 events. 3251/4558 cut-off events. For 15174/15174 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20208 event pairs, 870 based on Foata normal form. 28/4586 useless extension candidates. Maximal degree in co-relation 11434. Up to 3883 conditions per place. [2022-12-06 00:07:13,116 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 69 selfloop transitions, 71 changer transitions 11/151 dead transitions. [2022-12-06 00:07:13,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 151 transitions, 1507 flow [2022-12-06 00:07:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 00:07:13,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2022-12-06 00:07:13,117 INFO L175 Difference]: Start difference. First operand has 70 places, 119 transitions, 1082 flow. Second operand 6 states and 106 transitions. [2022-12-06 00:07:13,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 151 transitions, 1507 flow [2022-12-06 00:07:13,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 151 transitions, 1291 flow, removed 70 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:13,159 INFO L231 Difference]: Finished difference. Result has 71 places, 117 transitions, 1043 flow [2022-12-06 00:07:13,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1043, PETRI_PLACES=71, PETRI_TRANSITIONS=117} [2022-12-06 00:07:13,160 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-06 00:07:13,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:13,160 INFO L89 Accepts]: Start accepts. Operand has 71 places, 117 transitions, 1043 flow [2022-12-06 00:07:13,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:13,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:13,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 117 transitions, 1043 flow [2022-12-06 00:07:13,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 117 transitions, 1043 flow [2022-12-06 00:07:13,229 INFO L130 PetriNetUnfolder]: 592/1112 cut-off events. [2022-12-06 00:07:13,230 INFO L131 PetriNetUnfolder]: For 2169/2394 co-relation queries the response was YES. [2022-12-06 00:07:13,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1112 events. 592/1112 cut-off events. For 2169/2394 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6369 event pairs, 78 based on Foata normal form. 19/1056 useless extension candidates. Maximal degree in co-relation 3830. Up to 545 conditions per place. [2022-12-06 00:07:13,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 117 transitions, 1043 flow [2022-12-06 00:07:13,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-06 00:07:13,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] $Ultimate##0-->L124: Formula: (and (= v_~t~0_223 v_~m1~0_141) (= v_~t~0_221 (+ v_~t~0_223 3)) (= (+ v_~t~0_223 2) v_~m5~0_106) (= v_~m4~0_94 (+ v_~t~0_223 1))) InVars {~t~0=v_~t~0_223} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_35|, ~m5~0=v_~m5~0_106, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_16|, ~m4~0=v_~m4~0_94, ~m1~0=v_~m1~0_141, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_16|, ~t~0=v_~t~0_221} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [620] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_232 1))) (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m5~0_97 v_~s~0_612) 1 0)) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) .cse0 (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread5Thread1of1ForFork0_#res#1.base_17| 0) (= (+ v_~s~0_612 1) v_~s~0_611) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_356 256) 0))) 1 0) 0) 0 1) v_~b~0_355) (= (ite (<= v_~m1~0_119 v_~s~0_612) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|))) InVars {~b~0=v_~b~0_356, ~m5~0=v_~m5~0_97, ~m1~0=v_~m1~0_119, ~s~0=v_~s~0_612} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_59|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_355, ~m5~0=v_~m5~0_97, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_17|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_119, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_17|, ~x~0=v_~x~0_232, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~s~0=v_~s~0_611} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:13,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:13,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 355 [2022-12-06 00:07:13,515 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 117 transitions, 1051 flow [2022-12-06 00:07:13,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:13,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:07:13,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -490083343, now seen corresponding path program 1 times [2022-12-06 00:07:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:13,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308173403] [2022-12-06 00:07:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:13,647 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 00:07:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:13,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308173403] [2022-12-06 00:07:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308173403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:13,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:07:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830212460] [2022-12-06 00:07:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:07:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:07:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:07:13,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:07:13,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 117 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:13,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:07:13,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,990 INFO L130 PetriNetUnfolder]: 3139/4396 cut-off events. [2022-12-06 00:07:13,990 INFO L131 PetriNetUnfolder]: For 12921/12921 co-relation queries the response was YES. [2022-12-06 00:07:13,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19311 conditions, 4396 events. 3139/4396 cut-off events. For 12921/12921 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19256 event pairs, 820 based on Foata normal form. 2/4398 useless extension candidates. Maximal degree in co-relation 11023. Up to 4386 conditions per place. [2022-12-06 00:07:14,007 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 113 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2022-12-06 00:07:14,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 1273 flow [2022-12-06 00:07:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:07:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:07:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 00:07:14,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-06 00:07:14,008 INFO L175 Difference]: Start difference. First operand has 70 places, 117 transitions, 1051 flow. Second operand 3 states and 57 transitions. [2022-12-06 00:07:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 1273 flow [2022-12-06 00:07:14,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 122 transitions, 1127 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:14,028 INFO L231 Difference]: Finished difference. Result has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=67, PETRI_TRANSITIONS=115} [2022-12-06 00:07:14,029 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 00:07:14,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:14,029 INFO L89 Accepts]: Start accepts. Operand has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:14,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:14,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,089 INFO L130 PetriNetUnfolder]: 568/1092 cut-off events. [2022-12-06 00:07:14,089 INFO L131 PetriNetUnfolder]: For 1972/2225 co-relation queries the response was YES. [2022-12-06 00:07:14,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1092 events. 568/1092 cut-off events. For 1972/2225 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6406 event pairs, 62 based on Foata normal form. 19/1026 useless extension candidates. Maximal degree in co-relation 3346. Up to 546 conditions per place. [2022-12-06 00:07:14,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-06 00:07:14,097 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:14,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 00:07:14,098 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 115 transitions, 884 flow [2022-12-06 00:07:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:07:14,098 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1572355, now seen corresponding path program 1 times [2022-12-06 00:07:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629656909] [2022-12-06 00:07:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:14,223 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 00:07:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629656909] [2022-12-06 00:07:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629656909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:14,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:14,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514175962] [2022-12-06 00:07:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:14,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:14,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:07:14,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 115 transitions, 884 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:14,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:07:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:14,591 INFO L130 PetriNetUnfolder]: 3047/4284 cut-off events. [2022-12-06 00:07:14,591 INFO L131 PetriNetUnfolder]: For 11356/11356 co-relation queries the response was YES. [2022-12-06 00:07:14,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 4284 events. 3047/4284 cut-off events. For 11356/11356 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 18771 event pairs, 890 based on Foata normal form. 12/4296 useless extension candidates. Maximal degree in co-relation 9593. Up to 4260 conditions per place. [2022-12-06 00:07:14,611 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 107 selfloop transitions, 8 changer transitions 4/119 dead transitions. [2022-12-06 00:07:14,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 1076 flow [2022-12-06 00:07:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 00:07:14,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-06 00:07:14,612 INFO L175 Difference]: Start difference. First operand has 67 places, 115 transitions, 884 flow. Second operand 4 states and 60 transitions. [2022-12-06 00:07:14,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 1076 flow [2022-12-06 00:07:14,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1058 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:14,629 INFO L231 Difference]: Finished difference. Result has 68 places, 108 transitions, 788 flow [2022-12-06 00:07:14,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=788, PETRI_PLACES=68, PETRI_TRANSITIONS=108} [2022-12-06 00:07:14,630 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-06 00:07:14,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:14,630 INFO L89 Accepts]: Start accepts. Operand has 68 places, 108 transitions, 788 flow [2022-12-06 00:07:14,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:14,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:14,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 108 transitions, 788 flow [2022-12-06 00:07:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 108 transitions, 788 flow [2022-12-06 00:07:14,704 INFO L130 PetriNetUnfolder]: 526/1014 cut-off events. [2022-12-06 00:07:14,705 INFO L131 PetriNetUnfolder]: For 1773/2010 co-relation queries the response was YES. [2022-12-06 00:07:14,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 1014 events. 526/1014 cut-off events. For 1773/2010 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 5897 event pairs, 68 based on Foata normal form. 19/955 useless extension candidates. Maximal degree in co-relation 3121. Up to 518 conditions per place. [2022-12-06 00:07:14,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 108 transitions, 788 flow [2022-12-06 00:07:14,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 00:07:14,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:14,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 00:07:14,716 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 108 transitions, 788 flow [2022-12-06 00:07:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:07:14,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 91205787, now seen corresponding path program 2 times [2022-12-06 00:07:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592551579] [2022-12-06 00:07:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:14,863 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 00:07:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:14,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592551579] [2022-12-06 00:07:14,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592551579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:14,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:14,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621253936] [2022-12-06 00:07:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:14,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:14,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:07:14,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 108 transitions, 788 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:14,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:07:14,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:15,256 INFO L130 PetriNetUnfolder]: 3049/4290 cut-off events. [2022-12-06 00:07:15,257 INFO L131 PetriNetUnfolder]: For 11518/11518 co-relation queries the response was YES. [2022-12-06 00:07:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17900 conditions, 4290 events. 3049/4290 cut-off events. For 11518/11518 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18719 event pairs, 891 based on Foata normal form. 24/4314 useless extension candidates. Maximal degree in co-relation 11675. Up to 4150 conditions per place. [2022-12-06 00:07:15,271 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 91 selfloop transitions, 22 changer transitions 13/126 dead transitions. [2022-12-06 00:07:15,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 126 transitions, 1098 flow [2022-12-06 00:07:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 00:07:15,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33488372093023255 [2022-12-06 00:07:15,272 INFO L175 Difference]: Start difference. First operand has 66 places, 108 transitions, 788 flow. Second operand 5 states and 72 transitions. [2022-12-06 00:07:15,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 126 transitions, 1098 flow [2022-12-06 00:07:15,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:15,289 INFO L231 Difference]: Finished difference. Result has 68 places, 105 transitions, 788 flow [2022-12-06 00:07:15,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=788, PETRI_PLACES=68, PETRI_TRANSITIONS=105} [2022-12-06 00:07:15,290 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-06 00:07:15,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:15,290 INFO L89 Accepts]: Start accepts. Operand has 68 places, 105 transitions, 788 flow [2022-12-06 00:07:15,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:15,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:15,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 105 transitions, 788 flow [2022-12-06 00:07:15,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 105 transitions, 788 flow [2022-12-06 00:07:15,348 INFO L130 PetriNetUnfolder]: 525/1023 cut-off events. [2022-12-06 00:07:15,349 INFO L131 PetriNetUnfolder]: For 1853/2046 co-relation queries the response was YES. [2022-12-06 00:07:15,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1023 events. 525/1023 cut-off events. For 1853/2046 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6076 event pairs, 69 based on Foata normal form. 18/958 useless extension candidates. Maximal degree in co-relation 3117. Up to 525 conditions per place. [2022-12-06 00:07:15,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 105 transitions, 788 flow [2022-12-06 00:07:15,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-06 00:07:15,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_193 1) v_~m5~0_102) (= v_~t~0_191 (+ v_~m5~0_102 1)) (= v_~t~0_193 v_~m1~0_129)) InVars {~t~0=v_~t~0_193} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_25|, ~m5~0=v_~m5~0_102, ~m1~0=v_~m1~0_129, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_14|, ~t~0=v_~t~0_191} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m5~0, ~m1~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [620] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_232 1))) (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m5~0_97 v_~s~0_612) 1 0)) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) .cse0 (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread5Thread1of1ForFork0_#res#1.base_17| 0) (= (+ v_~s~0_612 1) v_~s~0_611) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_356 256) 0))) 1 0) 0) 0 1) v_~b~0_355) (= (ite (<= v_~m1~0_119 v_~s~0_612) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|))) InVars {~b~0=v_~b~0_356, ~m5~0=v_~m5~0_97, ~m1~0=v_~m1~0_119, ~s~0=v_~s~0_612} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_59|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_355, ~m5~0=v_~m5~0_97, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_17|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_119, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_17|, ~x~0=v_~x~0_232, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~s~0=v_~s~0_611} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:15,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_193 1) v_~m5~0_102) (= v_~t~0_191 (+ v_~m5~0_102 1)) (= v_~t~0_193 v_~m1~0_129)) InVars {~t~0=v_~t~0_193} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_25|, ~m5~0=v_~m5~0_102, ~m1~0=v_~m1~0_129, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_14|, ~t~0=v_~t~0_191} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m5~0, ~m1~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:07:15,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_193 1) v_~m5~0_102) (= v_~t~0_191 (+ v_~m5~0_102 1)) (= v_~t~0_193 v_~m1~0_129)) InVars {~t~0=v_~t~0_193} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_25|, ~m5~0=v_~m5~0_102, ~m1~0=v_~m1~0_129, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_14|, ~t~0=v_~t~0_191} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m5~0, ~m1~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 00:07:15,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_193 1) v_~m5~0_102) (= v_~t~0_191 (+ v_~m5~0_102 1)) (= v_~t~0_193 v_~m1~0_129)) InVars {~t~0=v_~t~0_193} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_25|, ~m5~0=v_~m5~0_102, ~m1~0=v_~m1~0_129, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_14|, ~t~0=v_~t~0_191} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m5~0, ~m1~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:07:15,689 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:15,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 400 [2022-12-06 00:07:15,690 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 104 transitions, 808 flow [2022-12-06 00:07:15,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:15,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:15,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:07:15,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1274165107, now seen corresponding path program 1 times [2022-12-06 00:07:15,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:15,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714551328] [2022-12-06 00:07:15,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:15,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:15,850 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 00:07:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:15,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714551328] [2022-12-06 00:07:15,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714551328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:15,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:15,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247203990] [2022-12-06 00:07:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:15,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:15,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:07:15,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 104 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:15,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:07:15,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:16,111 INFO L130 PetriNetUnfolder]: 2425/3384 cut-off events. [2022-12-06 00:07:16,111 INFO L131 PetriNetUnfolder]: For 10568/10568 co-relation queries the response was YES. [2022-12-06 00:07:16,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14226 conditions, 3384 events. 2425/3384 cut-off events. For 10568/10568 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13596 event pairs, 968 based on Foata normal form. 30/3414 useless extension candidates. Maximal degree in co-relation 8218. Up to 3343 conditions per place. [2022-12-06 00:07:16,125 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 49 selfloop transitions, 5 changer transitions 7/61 dead transitions. [2022-12-06 00:07:16,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 474 flow [2022-12-06 00:07:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 00:07:16,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2022-12-06 00:07:16,126 INFO L175 Difference]: Start difference. First operand has 66 places, 104 transitions, 808 flow. Second operand 4 states and 61 transitions. [2022-12-06 00:07:16,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 474 flow [2022-12-06 00:07:16,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 442 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:16,136 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 250 flow [2022-12-06 00:07:16,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2022-12-06 00:07:16,137 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2022-12-06 00:07:16,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:16,137 INFO L89 Accepts]: Start accepts. Operand has 60 places, 47 transitions, 250 flow [2022-12-06 00:07:16,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:16,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:16,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 250 flow [2022-12-06 00:07:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 250 flow [2022-12-06 00:07:16,174 INFO L130 PetriNetUnfolder]: 313/681 cut-off events. [2022-12-06 00:07:16,175 INFO L131 PetriNetUnfolder]: For 1063/1314 co-relation queries the response was YES. [2022-12-06 00:07:16,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 681 events. 313/681 cut-off events. For 1063/1314 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4038 event pairs, 76 based on Foata normal form. 18/611 useless extension candidates. Maximal degree in co-relation 1835. Up to 362 conditions per place. [2022-12-06 00:07:16,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 250 flow [2022-12-06 00:07:16,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 00:07:16,195 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:16,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 00:07:16,195 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 250 flow [2022-12-06 00:07:16,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:16,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:16,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:07:16,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -644227385, now seen corresponding path program 4 times [2022-12-06 00:07:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101602256] [2022-12-06 00:07:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:16,373 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 00:07:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:16,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101602256] [2022-12-06 00:07:16,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101602256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:16,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:16,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164421273] [2022-12-06 00:07:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:16,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:16,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:16,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:16,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:16,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:16,972 INFO L130 PetriNetUnfolder]: 4688/6561 cut-off events. [2022-12-06 00:07:16,973 INFO L131 PetriNetUnfolder]: For 15296/15296 co-relation queries the response was YES. [2022-12-06 00:07:16,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25674 conditions, 6561 events. 4688/6561 cut-off events. For 15296/15296 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31183 event pairs, 356 based on Foata normal form. 236/6797 useless extension candidates. Maximal degree in co-relation 12943. Up to 3001 conditions per place. [2022-12-06 00:07:17,002 INFO L137 encePairwiseOnDemand]: 20/39 looper letters, 104 selfloop transitions, 63 changer transitions 0/167 dead transitions. [2022-12-06 00:07:17,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 167 transitions, 1161 flow [2022-12-06 00:07:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2022-12-06 00:07:17,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 00:07:17,004 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 250 flow. Second operand 8 states and 165 transitions. [2022-12-06 00:07:17,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 167 transitions, 1161 flow [2022-12-06 00:07:17,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 167 transitions, 1127 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:17,018 INFO L231 Difference]: Finished difference. Result has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=782, PETRI_PLACES=55, PETRI_TRANSITIONS=97} [2022-12-06 00:07:17,018 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-06 00:07:17,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:17,018 INFO L89 Accepts]: Start accepts. Operand has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:17,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:17,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,133 INFO L130 PetriNetUnfolder]: 1215/2015 cut-off events. [2022-12-06 00:07:17,133 INFO L131 PetriNetUnfolder]: For 4663/5246 co-relation queries the response was YES. [2022-12-06 00:07:17,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8293 conditions, 2015 events. 1215/2015 cut-off events. For 4663/5246 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11284 event pairs, 246 based on Foata normal form. 11/1968 useless extension candidates. Maximal degree in co-relation 8035. Up to 964 conditions per place. [2022-12-06 00:07:17,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 00:07:17,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:17,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 00:07:17,149 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 97 transitions, 782 flow [2022-12-06 00:07:17,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:17,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:17,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:07:17,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash 891972963, now seen corresponding path program 5 times [2022-12-06 00:07:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689567218] [2022-12-06 00:07:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:17,351 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 00:07:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689567218] [2022-12-06 00:07:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689567218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:17,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:17,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:07:17,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474838136] [2022-12-06 00:07:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:17,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:07:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:07:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:07:17,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:17,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 97 transitions, 782 flow. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:17,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:17,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:18,118 INFO L130 PetriNetUnfolder]: 4965/6904 cut-off events. [2022-12-06 00:07:18,118 INFO L131 PetriNetUnfolder]: For 20348/20348 co-relation queries the response was YES. [2022-12-06 00:07:18,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33839 conditions, 6904 events. 4965/6904 cut-off events. For 20348/20348 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 32396 event pairs, 720 based on Foata normal form. 14/6918 useless extension candidates. Maximal degree in co-relation 10812. Up to 6603 conditions per place. [2022-12-06 00:07:18,147 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 124 selfloop transitions, 78 changer transitions 0/202 dead transitions. [2022-12-06 00:07:18,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 202 transitions, 1893 flow [2022-12-06 00:07:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:07:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:07:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-12-06 00:07:18,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 00:07:18,149 INFO L175 Difference]: Start difference. First operand has 55 places, 97 transitions, 782 flow. Second operand 10 states and 143 transitions. [2022-12-06 00:07:18,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 202 transitions, 1893 flow [2022-12-06 00:07:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 202 transitions, 1642 flow, removed 123 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:18,337 INFO L231 Difference]: Finished difference. Result has 67 places, 157 transitions, 1389 flow [2022-12-06 00:07:18,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1389, PETRI_PLACES=67, PETRI_TRANSITIONS=157} [2022-12-06 00:07:18,338 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 00:07:18,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:18,338 INFO L89 Accepts]: Start accepts. Operand has 67 places, 157 transitions, 1389 flow [2022-12-06 00:07:18,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:18,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:18,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 157 transitions, 1389 flow [2022-12-06 00:07:18,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 157 transitions, 1389 flow [2022-12-06 00:07:18,475 INFO L130 PetriNetUnfolder]: 1329/2168 cut-off events. [2022-12-06 00:07:18,475 INFO L131 PetriNetUnfolder]: For 7466/8748 co-relation queries the response was YES. [2022-12-06 00:07:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 2168 events. 1329/2168 cut-off events. For 7466/8748 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 11901 event pairs, 141 based on Foata normal form. 9/2129 useless extension candidates. Maximal degree in co-relation 8617. Up to 1059 conditions per place. [2022-12-06 00:07:18,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 157 transitions, 1389 flow [2022-12-06 00:07:18,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 00:07:18,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [616] L45-->thread1EXIT: Formula: (and (= |v_thread5Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= v_~b~0_339 1) (= (+ 2 v_~s~0_595) v_~s~0_593) (= |v_thread1Thread1of1ForFork2_#res#1.offset_23| 0) (= (ite (<= v_~m1~0_111 v_~s~0_595) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#res#1.base_23| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m5~0_95 v_~s~0_595) 1 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_15| 0) (= v_~x~0_222 0)) InVars {~m5~0=v_~m5~0_95, ~m1~0=v_~m1~0_111, ~s~0=v_~s~0_595} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_57|, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_53|, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_15|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_15|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, ~b~0=v_~b~0_339, ~m5~0=v_~m5~0_95, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, ~m1~0=v_~m1~0_111, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_23|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_23|, ~x~0=v_~x~0_222, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|, ~s~0=v_~s~0_593} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread1Thread1of1ForFork2_#t~post2#1, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:18,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [614] L45-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_107 v_~s~0_583) 1 0)) (= |v_thread4Thread1of1ForFork3_#res#1.base_33| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_19| 0) (= v_~b~0_331 1) (= |v_thread1Thread1of1ForFork2_#res#1.offset_19| 0) (= (+ 2 v_~s~0_583) v_~s~0_581) (= |v_thread4Thread1of1ForFork3_#res#1.offset_33| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m4~0_81 v_~s~0_583) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|) (= v_~x~0_214 0) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45| 0))) InVars {~m4~0=v_~m4~0_81, ~m1~0=v_~m1~0_107, ~s~0=v_~s~0_583} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_33|, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_49|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|, ~b~0=v_~b~0_331, ~m4~0=v_~m4~0_81, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~m1~0=v_~m1~0_107, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_49|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_19|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_19|, ~x~0=v_~x~0_214, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, ~s~0=v_~s~0_581, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_33|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork2_#t~post2#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post8#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork3_#res#1.offset] [2022-12-06 00:07:18,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [606] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res#1.offset_27| 0) (= |v_thread4Thread1of1ForFork3_#res#1.base_27| 0) (= (+ v_~s~0_530 1) v_~s~0_529) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| 0)) (= (ite (<= v_~m4~0_73 v_~s~0_530) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|) (= v_~b~0_283 (ite (= (ite (or (not (= (mod v_~b~0_284 256) 0)) (= v_~x~0_182 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|)) InVars {~b~0=v_~b~0_284, ~m4~0=v_~m4~0_73, ~x~0=v_~x~0_182, ~s~0=v_~s~0_530} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_27|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39|, ~b~0=v_~b~0_283, ~m4~0=v_~m4~0_73, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_43|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|, ~x~0=v_~x~0_182, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_27|, ~s~0=v_~s~0_529} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] [2022-12-06 00:07:18,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [615] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_21| 0) (= (ite (<= v_~m1~0_109 v_~s~0_589) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_49|) (= (+ 2 v_~s~0_589) v_~s~0_587) (= |v_thread2Thread1of1ForFork4_#res#1.base_15| 0) (= v_~x~0_218 0) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m2~0_99 v_~s~0_589) 1 0)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_15| 0) (= v_~b~0_335 1)) InVars {~m2~0=v_~m2~0_99, ~m1~0=v_~m1~0_109, ~s~0=v_~s~0_589} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_49|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_15|, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_51|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_49|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_15|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|, ~b~0=v_~b~0_335, ~m2~0=v_~m2~0_99, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51|, ~m1~0=v_~m1~0_109, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_21|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_21|, ~x~0=v_~x~0_218, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, ~s~0=v_~s~0_587} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:18,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:18,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [599] L124-->thread5EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_244 256) 0)) (= v_~x~0_153 1)) 1 0) 0) 0 1) v_~b~0_243) (= 0 |v_thread5Thread1of1ForFork0_#res#1.offset_7|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_77 v_~s~0_478) 1 0)) (= (+ v_~s~0_478 1) v_~s~0_477) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|)) InVars {~b~0=v_~b~0_244, ~m5~0=v_~m5~0_77, ~x~0=v_~x~0_153, ~s~0=v_~s~0_478} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_49|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~b~0=v_~b~0_243, ~m5~0=v_~m5~0_77, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_7|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_7|, ~x~0=v_~x~0_153, ~s~0=v_~s~0_477} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~s~0] [2022-12-06 00:07:18,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [542] L52-->thread1EXIT: Formula: (and (= v_~x~0_82 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (= v_~s~0_329 (+ v_~s~0_330 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_330} OutVars{thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_37|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, ~x~0=v_~x~0_82, ~s~0=v_~s~0_329} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:19,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:07:19,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:07:19,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:07:19,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L67: Formula: (and (= v_~t~0_53 (+ v_~t~0_54 1)) (= v_~m2~0_11 v_~t~0_54)) InVars {~t~0=v_~t~0_54} OutVars{thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:19,116 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:07:19,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 778 [2022-12-06 00:07:19,116 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 155 transitions, 1421 flow [2022-12-06 00:07:19,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:19,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:19,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:07:19,117 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 557265003, now seen corresponding path program 1 times [2022-12-06 00:07:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450351611] [2022-12-06 00:07:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:19,265 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 00:07:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:19,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450351611] [2022-12-06 00:07:19,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450351611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:19,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:19,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403422790] [2022-12-06 00:07:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:19,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:19,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:19,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 155 transitions, 1421 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:19,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:19,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:20,099 INFO L130 PetriNetUnfolder]: 6085/8436 cut-off events. [2022-12-06 00:07:20,099 INFO L131 PetriNetUnfolder]: For 31040/31040 co-relation queries the response was YES. [2022-12-06 00:07:20,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41396 conditions, 8436 events. 6085/8436 cut-off events. For 31040/31040 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 41432 event pairs, 482 based on Foata normal form. 200/8636 useless extension candidates. Maximal degree in co-relation 34205. Up to 4942 conditions per place. [2022-12-06 00:07:20,146 INFO L137 encePairwiseOnDemand]: 25/51 looper letters, 128 selfloop transitions, 162 changer transitions 0/290 dead transitions. [2022-12-06 00:07:20,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 290 transitions, 2990 flow [2022-12-06 00:07:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-12-06 00:07:20,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46405228758169936 [2022-12-06 00:07:20,147 INFO L175 Difference]: Start difference. First operand has 65 places, 155 transitions, 1421 flow. Second operand 6 states and 142 transitions. [2022-12-06 00:07:20,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 290 transitions, 2990 flow [2022-12-06 00:07:20,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 290 transitions, 2835 flow, removed 73 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:20,221 INFO L231 Difference]: Finished difference. Result has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2698, PETRI_PLACES=70, PETRI_TRANSITIONS=236} [2022-12-06 00:07:20,222 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-06 00:07:20,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:20,222 INFO L89 Accepts]: Start accepts. Operand has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:20,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:20,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,415 INFO L130 PetriNetUnfolder]: 1707/2689 cut-off events. [2022-12-06 00:07:20,415 INFO L131 PetriNetUnfolder]: For 12061/14970 co-relation queries the response was YES. [2022-12-06 00:07:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14451 conditions, 2689 events. 1707/2689 cut-off events. For 12061/14970 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 14709 event pairs, 148 based on Foata normal form. 24/2657 useless extension candidates. Maximal degree in co-relation 14204. Up to 1276 conditions per place. [2022-12-06 00:07:20,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 00:07:20,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:20,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:07:20,437 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 236 transitions, 2698 flow [2022-12-06 00:07:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:20,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:20,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:07:20,437 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2010456951, now seen corresponding path program 1 times [2022-12-06 00:07:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:20,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145860333] [2022-12-06 00:07:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:20,557 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 00:07:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:20,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145860333] [2022-12-06 00:07:20,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145860333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:20,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:20,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642263683] [2022-12-06 00:07:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:20,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:20,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 236 transitions, 2698 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:20,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:20,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:21,591 INFO L130 PetriNetUnfolder]: 7098/9825 cut-off events. [2022-12-06 00:07:21,591 INFO L131 PetriNetUnfolder]: For 45098/45098 co-relation queries the response was YES. [2022-12-06 00:07:21,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58224 conditions, 9825 events. 7098/9825 cut-off events. For 45098/45098 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 49077 event pairs, 659 based on Foata normal form. 220/10045 useless extension candidates. Maximal degree in co-relation 46004. Up to 8569 conditions per place. [2022-12-06 00:07:21,643 INFO L137 encePairwiseOnDemand]: 23/51 looper letters, 202 selfloop transitions, 206 changer transitions 0/408 dead transitions. [2022-12-06 00:07:21,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 408 transitions, 5325 flow [2022-12-06 00:07:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2022-12-06 00:07:21,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42401960784313725 [2022-12-06 00:07:21,644 INFO L175 Difference]: Start difference. First operand has 70 places, 236 transitions, 2698 flow. Second operand 8 states and 173 transitions. [2022-12-06 00:07:21,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 408 transitions, 5325 flow [2022-12-06 00:07:21,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 408 transitions, 5141 flow, removed 92 selfloop flow, removed 0 redundant places. [2022-12-06 00:07:21,794 INFO L231 Difference]: Finished difference. Result has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:21,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4921, PETRI_PLACES=82, PETRI_TRANSITIONS=355} [2022-12-06 00:07:21,795 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 34 predicate places. [2022-12-06 00:07:21,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:21,795 INFO L89 Accepts]: Start accepts. Operand has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:21,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:21,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:21,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:21,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:22,049 INFO L130 PetriNetUnfolder]: 2036/3155 cut-off events. [2022-12-06 00:07:22,049 INFO L131 PetriNetUnfolder]: For 18014/21577 co-relation queries the response was YES. [2022-12-06 00:07:22,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19486 conditions, 3155 events. 2036/3155 cut-off events. For 18014/21577 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 17337 event pairs, 170 based on Foata normal form. 23/3128 useless extension candidates. Maximal degree in co-relation 19244. Up to 1533 conditions per place. [2022-12-06 00:07:22,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:22,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 1898 [2022-12-06 00:07:22,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:22,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 00:07:22,081 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 355 transitions, 4921 flow [2022-12-06 00:07:22,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:22,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:07:22,082 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -703236746, now seen corresponding path program 1 times [2022-12-06 00:07:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618558087] [2022-12-06 00:07:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,212 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 00:07:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618558087] [2022-12-06 00:07:22,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618558087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648412293] [2022-12-06 00:07:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:22,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:22,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 355 transitions, 4921 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:22,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:23,393 INFO L130 PetriNetUnfolder]: 6974/9725 cut-off events. [2022-12-06 00:07:23,394 INFO L131 PetriNetUnfolder]: For 53291/53291 co-relation queries the response was YES. [2022-12-06 00:07:23,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62135 conditions, 9725 events. 6974/9725 cut-off events. For 53291/53291 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 49278 event pairs, 745 based on Foata normal form. 222/9947 useless extension candidates. Maximal degree in co-relation 57474. Up to 9274 conditions per place. [2022-12-06 00:07:23,444 INFO L137 encePairwiseOnDemand]: 23/51 looper letters, 288 selfloop transitions, 136 changer transitions 1/425 dead transitions. [2022-12-06 00:07:23,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 425 transitions, 6442 flow [2022-12-06 00:07:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-06 00:07:23,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3277310924369748 [2022-12-06 00:07:23,446 INFO L175 Difference]: Start difference. First operand has 82 places, 355 transitions, 4921 flow. Second operand 7 states and 117 transitions. [2022-12-06 00:07:23,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 425 transitions, 6442 flow [2022-12-06 00:07:23,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 425 transitions, 6416 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:23,579 INFO L231 Difference]: Finished difference. Result has 89 places, 380 transitions, 5781 flow [2022-12-06 00:07:23,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5781, PETRI_PLACES=89, PETRI_TRANSITIONS=380} [2022-12-06 00:07:23,579 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2022-12-06 00:07:23,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,579 INFO L89 Accepts]: Start accepts. Operand has 89 places, 380 transitions, 5781 flow [2022-12-06 00:07:23,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 380 transitions, 5781 flow [2022-12-06 00:07:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 380 transitions, 5781 flow [2022-12-06 00:07:23,827 INFO L130 PetriNetUnfolder]: 1992/3118 cut-off events. [2022-12-06 00:07:23,827 INFO L131 PetriNetUnfolder]: For 19317/22817 co-relation queries the response was YES. [2022-12-06 00:07:23,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19770 conditions, 3118 events. 1992/3118 cut-off events. For 19317/22817 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 17364 event pairs, 191 based on Foata normal form. 29/3097 useless extension candidates. Maximal degree in co-relation 19527. Up to 1508 conditions per place. [2022-12-06 00:07:23,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 380 transitions, 5781 flow [2022-12-06 00:07:23,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 1932 [2022-12-06 00:07:23,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_307 1) v_~m4~0_108) (= v_~t~0_307 v_~m2~0_123) (= v_~t~0_305 (+ v_~t~0_307 2))) InVars {~t~0=v_~t~0_307} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_26|, ~m4~0=v_~m4~0_108, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_27|, ~m2~0=v_~m2~0_123, ~t~0=v_~t~0_305} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:23,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:23,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 365 [2022-12-06 00:07:23,944 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 380 transitions, 5787 flow [2022-12-06 00:07:23,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:07:23,944 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1508124373, now seen corresponding path program 2 times [2022-12-06 00:07:23,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134035941] [2022-12-06 00:07:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:24,073 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 00:07:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:24,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134035941] [2022-12-06 00:07:24,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134035941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:24,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:24,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126971098] [2022-12-06 00:07:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:24,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:24,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:07:24,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 380 transitions, 5787 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:24,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:24,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:07:24,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:25,553 INFO L130 PetriNetUnfolder]: 7503/10502 cut-off events. [2022-12-06 00:07:25,553 INFO L131 PetriNetUnfolder]: For 59667/59667 co-relation queries the response was YES. [2022-12-06 00:07:25,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67559 conditions, 10502 events. 7503/10502 cut-off events. For 59667/59667 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 54515 event pairs, 783 based on Foata normal form. 136/10638 useless extension candidates. Maximal degree in co-relation 62301. Up to 8489 conditions per place. [2022-12-06 00:07:25,624 INFO L137 encePairwiseOnDemand]: 24/52 looper letters, 191 selfloop transitions, 337 changer transitions 0/528 dead transitions. [2022-12-06 00:07:25,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 528 transitions, 8446 flow [2022-12-06 00:07:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2022-12-06 00:07:25,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4110576923076923 [2022-12-06 00:07:25,625 INFO L175 Difference]: Start difference. First operand has 89 places, 380 transitions, 5787 flow. Second operand 8 states and 171 transitions. [2022-12-06 00:07:25,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 528 transitions, 8446 flow [2022-12-06 00:07:25,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 528 transitions, 8279 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:25,850 INFO L231 Difference]: Finished difference. Result has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:25,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5645, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8201, PETRI_PLACES=97, PETRI_TRANSITIONS=480} [2022-12-06 00:07:25,851 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 49 predicate places. [2022-12-06 00:07:25,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:25,851 INFO L89 Accepts]: Start accepts. Operand has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:25,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:25,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:25,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:25,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:26,319 INFO L130 PetriNetUnfolder]: 2117/3365 cut-off events. [2022-12-06 00:07:26,320 INFO L131 PetriNetUnfolder]: For 26267/33824 co-relation queries the response was YES. [2022-12-06 00:07:26,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23108 conditions, 3365 events. 2117/3365 cut-off events. For 26267/33824 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 19552 event pairs, 216 based on Foata normal form. 36/3346 useless extension candidates. Maximal degree in co-relation 22824. Up to 1535 conditions per place. [2022-12-06 00:07:26,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:26,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 2360 [2022-12-06 00:07:26,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:26,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 498 [2022-12-06 00:07:26,349 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 480 transitions, 8201 flow [2022-12-06 00:07:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:26,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:26,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:07:26,350 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1053357676, now seen corresponding path program 1 times [2022-12-06 00:07:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:26,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368818349] [2022-12-06 00:07:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:26,470 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 00:07:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:26,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368818349] [2022-12-06 00:07:26,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368818349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:26,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:26,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068995548] [2022-12-06 00:07:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:26,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:07:26,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 480 transitions, 8201 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:26,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:07:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:27,918 INFO L130 PetriNetUnfolder]: 7262/10217 cut-off events. [2022-12-06 00:07:27,918 INFO L131 PetriNetUnfolder]: For 73787/73787 co-relation queries the response was YES. [2022-12-06 00:07:27,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71336 conditions, 10217 events. 7262/10217 cut-off events. For 73787/73787 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 53345 event pairs, 818 based on Foata normal form. 144/10361 useless extension candidates. Maximal degree in co-relation 65281. Up to 9786 conditions per place. [2022-12-06 00:07:27,974 INFO L137 encePairwiseOnDemand]: 27/52 looper letters, 367 selfloop transitions, 145 changer transitions 2/514 dead transitions. [2022-12-06 00:07:27,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 514 transitions, 9512 flow [2022-12-06 00:07:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 00:07:27,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2774725274725275 [2022-12-06 00:07:27,976 INFO L175 Difference]: Start difference. First operand has 97 places, 480 transitions, 8201 flow. Second operand 7 states and 101 transitions. [2022-12-06 00:07:27,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 514 transitions, 9512 flow [2022-12-06 00:07:28,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 514 transitions, 9363 flow, removed 68 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:28,264 INFO L231 Difference]: Finished difference. Result has 103 places, 470 transitions, 8421 flow [2022-12-06 00:07:28,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=6914, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8421, PETRI_PLACES=103, PETRI_TRANSITIONS=470} [2022-12-06 00:07:28,265 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 55 predicate places. [2022-12-06 00:07:28,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:28,265 INFO L89 Accepts]: Start accepts. Operand has 103 places, 470 transitions, 8421 flow [2022-12-06 00:07:28,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:28,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:28,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 470 transitions, 8421 flow [2022-12-06 00:07:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 470 transitions, 8421 flow [2022-12-06 00:07:28,570 INFO L130 PetriNetUnfolder]: 2022/3247 cut-off events. [2022-12-06 00:07:28,571 INFO L131 PetriNetUnfolder]: For 24876/30571 co-relation queries the response was YES. [2022-12-06 00:07:28,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22182 conditions, 3247 events. 2022/3247 cut-off events. For 24876/30571 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 19031 event pairs, 217 based on Foata normal form. 44/3237 useless extension candidates. Maximal degree in co-relation 21898. Up to 1493 conditions per place. [2022-12-06 00:07:28,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 470 transitions, 8421 flow [2022-12-06 00:07:28,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 2324 [2022-12-06 00:07:28,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L124: Formula: (and (= v_~t~0_311 (+ v_~t~0_313 2)) (= v_~t~0_313 v_~m2~0_125) (= v_~m5~0_126 (+ v_~t~0_313 1))) InVars {~t~0=v_~t~0_313} OutVars{~m5~0=v_~m5~0_126, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_29|, ~m2~0=v_~m2~0_125, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_32|, ~t~0=v_~t~0_311} AuxVars[] AssignedVars[~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:28,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:28,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 402 [2022-12-06 00:07:28,667 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 470 transitions, 8427 flow [2022-12-06 00:07:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:28,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:07:28,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:28,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1572840201, now seen corresponding path program 1 times [2022-12-06 00:07:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:28,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878232470] [2022-12-06 00:07:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:28,788 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 00:07:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:28,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878232470] [2022-12-06 00:07:28,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878232470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:28,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:28,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:07:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683227027] [2022-12-06 00:07:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:07:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:07:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:07:28,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:28,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 470 transitions, 8427 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:28,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:28,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:30,385 INFO L130 PetriNetUnfolder]: 7439/10540 cut-off events. [2022-12-06 00:07:30,386 INFO L131 PetriNetUnfolder]: For 74608/74608 co-relation queries the response was YES. [2022-12-06 00:07:30,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73722 conditions, 10540 events. 7439/10540 cut-off events. For 74608/74608 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 56132 event pairs, 803 based on Foata normal form. 200/10740 useless extension candidates. Maximal degree in co-relation 67779. Up to 8979 conditions per place. [2022-12-06 00:07:30,458 INFO L137 encePairwiseOnDemand]: 27/51 looper letters, 263 selfloop transitions, 329 changer transitions 0/592 dead transitions. [2022-12-06 00:07:30,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 592 transitions, 10652 flow [2022-12-06 00:07:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:07:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:07:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2022-12-06 00:07:30,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36185383244206776 [2022-12-06 00:07:30,459 INFO L175 Difference]: Start difference. First operand has 103 places, 470 transitions, 8427 flow. Second operand 11 states and 203 transitions. [2022-12-06 00:07:30,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 592 transitions, 10652 flow [2022-12-06 00:07:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 592 transitions, 10506 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:30,781 INFO L231 Difference]: Finished difference. Result has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:30,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=8281, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9584, PETRI_PLACES=112, PETRI_TRANSITIONS=507} [2022-12-06 00:07:30,781 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 64 predicate places. [2022-12-06 00:07:30,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:30,782 INFO L89 Accepts]: Start accepts. Operand has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:30,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:30,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:30,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:30,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:31,116 INFO L130 PetriNetUnfolder]: 2042/3364 cut-off events. [2022-12-06 00:07:31,116 INFO L131 PetriNetUnfolder]: For 25966/30408 co-relation queries the response was YES. [2022-12-06 00:07:31,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23370 conditions, 3364 events. 2042/3364 cut-off events. For 25966/30408 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 20622 event pairs, 216 based on Foata normal form. 38/3350 useless extension candidates. Maximal degree in co-relation 23037. Up to 1518 conditions per place. [2022-12-06 00:07:31,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:31,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 2526 [2022-12-06 00:07:31,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:31,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 00:07:31,153 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 507 transitions, 9584 flow [2022-12-06 00:07:31,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:07:31,153 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1996305913, now seen corresponding path program 1 times [2022-12-06 00:07:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707255808] [2022-12-06 00:07:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:31,371 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 00:07:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:31,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707255808] [2022-12-06 00:07:31,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707255808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:31,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:31,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843158622] [2022-12-06 00:07:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:31,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:31,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:31,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 507 transitions, 9584 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:31,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:32,685 INFO L130 PetriNetUnfolder]: 5998/8477 cut-off events. [2022-12-06 00:07:32,686 INFO L131 PetriNetUnfolder]: For 64312/64312 co-relation queries the response was YES. [2022-12-06 00:07:32,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58249 conditions, 8477 events. 5998/8477 cut-off events. For 64312/64312 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 43739 event pairs, 550 based on Foata normal form. 212/8689 useless extension candidates. Maximal degree in co-relation 56509. Up to 8080 conditions per place. [2022-12-06 00:07:32,761 INFO L137 encePairwiseOnDemand]: 27/51 looper letters, 383 selfloop transitions, 98 changer transitions 6/487 dead transitions. [2022-12-06 00:07:32,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 487 transitions, 9279 flow [2022-12-06 00:07:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 00:07:32,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2969187675070028 [2022-12-06 00:07:32,763 INFO L175 Difference]: Start difference. First operand has 112 places, 507 transitions, 9584 flow. Second operand 7 states and 106 transitions. [2022-12-06 00:07:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 487 transitions, 9279 flow [2022-12-06 00:07:33,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 487 transitions, 8678 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-12-06 00:07:33,118 INFO L231 Difference]: Finished difference. Result has 113 places, 429 transitions, 7556 flow [2022-12-06 00:07:33,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=6536, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7556, PETRI_PLACES=113, PETRI_TRANSITIONS=429} [2022-12-06 00:07:33,118 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 65 predicate places. [2022-12-06 00:07:33,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,119 INFO L89 Accepts]: Start accepts. Operand has 113 places, 429 transitions, 7556 flow [2022-12-06 00:07:33,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 429 transitions, 7556 flow [2022-12-06 00:07:33,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 429 transitions, 7556 flow [2022-12-06 00:07:33,467 INFO L130 PetriNetUnfolder]: 1731/2823 cut-off events. [2022-12-06 00:07:33,467 INFO L131 PetriNetUnfolder]: For 22217/25753 co-relation queries the response was YES. [2022-12-06 00:07:33,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18728 conditions, 2823 events. 1731/2823 cut-off events. For 22217/25753 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 16248 event pairs, 188 based on Foata normal form. 31/2810 useless extension candidates. Maximal degree in co-relation 18451. Up to 1302 conditions per place. [2022-12-06 00:07:33,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 429 transitions, 7556 flow [2022-12-06 00:07:33,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 1862 [2022-12-06 00:07:33,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->L45: Formula: (and (= v_~t~0_319 v_~m2~0_127) (= (+ v_~t~0_319 1) v_~m1~0_165) (= v_~t~0_317 (+ 1 v_~m1~0_165))) InVars {~t~0=v_~t~0_319} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_53|, ~m1~0=v_~m1~0_165, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_31|, ~m2~0=v_~m2~0_127, ~t~0=v_~t~0_317} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:33,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:33,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 456 [2022-12-06 00:07:33,575 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 429 transitions, 7561 flow [2022-12-06 00:07:33,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:07:33,575 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash -721836550, now seen corresponding path program 1 times [2022-12-06 00:07:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311342576] [2022-12-06 00:07:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,755 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 00:07:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311342576] [2022-12-06 00:07:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311342576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076736958] [2022-12-06 00:07:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:33,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:07:33,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 429 transitions, 7561 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:07:33,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,352 INFO L130 PetriNetUnfolder]: 7686/11001 cut-off events. [2022-12-06 00:07:35,352 INFO L131 PetriNetUnfolder]: For 78450/78450 co-relation queries the response was YES. [2022-12-06 00:07:35,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71303 conditions, 11001 events. 7686/11001 cut-off events. For 78450/78450 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 60573 event pairs, 506 based on Foata normal form. 374/11375 useless extension candidates. Maximal degree in co-relation 69609. Up to 4454 conditions per place. [2022-12-06 00:07:35,487 INFO L137 encePairwiseOnDemand]: 23/49 looper letters, 148 selfloop transitions, 478 changer transitions 0/626 dead transitions. [2022-12-06 00:07:35,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 626 transitions, 10690 flow [2022-12-06 00:07:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-12-06 00:07:35,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-06 00:07:35,488 INFO L175 Difference]: Start difference. First operand has 113 places, 429 transitions, 7561 flow. Second operand 8 states and 182 transitions. [2022-12-06 00:07:35,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 626 transitions, 10690 flow [2022-12-06 00:07:35,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 626 transitions, 10542 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:35,813 INFO L231 Difference]: Finished difference. Result has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:35,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7413, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10530, PETRI_PLACES=121, PETRI_TRANSITIONS=557} [2022-12-06 00:07:35,814 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 73 predicate places. [2022-12-06 00:07:35,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,815 INFO L89 Accepts]: Start accepts. Operand has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:35,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:35,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:36,357 INFO L130 PetriNetUnfolder]: 2144/3559 cut-off events. [2022-12-06 00:07:36,357 INFO L131 PetriNetUnfolder]: For 36730/42813 co-relation queries the response was YES. [2022-12-06 00:07:36,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 3559 events. 2144/3559 cut-off events. For 36730/42813 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 22187 event pairs, 133 based on Foata normal form. 15/3535 useless extension candidates. Maximal degree in co-relation 26868. Up to 1469 conditions per place. [2022-12-06 00:07:36,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:36,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 2514 [2022-12-06 00:07:36,402 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:36,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 00:07:36,405 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 557 transitions, 10530 flow [2022-12-06 00:07:36,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:36,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:36,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:07:36,406 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -84941696, now seen corresponding path program 1 times [2022-12-06 00:07:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395064844] [2022-12-06 00:07:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:36,521 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 00:07:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395064844] [2022-12-06 00:07:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395064844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:36,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:36,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746784208] [2022-12-06 00:07:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:36,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:36,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:07:36,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 557 transitions, 10530 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:36,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:07:36,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:38,064 INFO L130 PetriNetUnfolder]: 7922/11339 cut-off events. [2022-12-06 00:07:38,064 INFO L131 PetriNetUnfolder]: For 107448/107448 co-relation queries the response was YES. [2022-12-06 00:07:38,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87183 conditions, 11339 events. 7922/11339 cut-off events. For 107448/107448 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 62319 event pairs, 600 based on Foata normal form. 58/11397 useless extension candidates. Maximal degree in co-relation 85140. Up to 10336 conditions per place. [2022-12-06 00:07:38,328 INFO L137 encePairwiseOnDemand]: 26/49 looper letters, 484 selfloop transitions, 166 changer transitions 0/650 dead transitions. [2022-12-06 00:07:38,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 650 transitions, 13235 flow [2022-12-06 00:07:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-06 00:07:38,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39183673469387753 [2022-12-06 00:07:38,329 INFO L175 Difference]: Start difference. First operand has 121 places, 557 transitions, 10530 flow. Second operand 5 states and 96 transitions. [2022-12-06 00:07:38,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 650 transitions, 13235 flow [2022-12-06 00:07:39,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 650 transitions, 12778 flow, removed 209 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:39,216 INFO L231 Difference]: Finished difference. Result has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10192, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11593, PETRI_PLACES=125, PETRI_TRANSITIONS=605} [2022-12-06 00:07:39,217 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 77 predicate places. [2022-12-06 00:07:39,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:39,217 INFO L89 Accepts]: Start accepts. Operand has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:39,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:39,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,636 INFO L130 PetriNetUnfolder]: 2215/3654 cut-off events. [2022-12-06 00:07:39,636 INFO L131 PetriNetUnfolder]: For 37666/44296 co-relation queries the response was YES. [2022-12-06 00:07:39,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27387 conditions, 3654 events. 2215/3654 cut-off events. For 37666/44296 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 22681 event pairs, 134 based on Foata normal form. 18/3631 useless extension candidates. Maximal degree in co-relation 27073. Up to 1486 conditions per place. [2022-12-06 00:07:39,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 2694 [2022-12-06 00:07:39,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:39,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-06 00:07:39,677 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 605 transitions, 11593 flow [2022-12-06 00:07:39,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:39,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:39,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:07:39,677 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1772424916, now seen corresponding path program 1 times [2022-12-06 00:07:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:39,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878219199] [2022-12-06 00:07:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:39,797 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 00:07:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878219199] [2022-12-06 00:07:39,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878219199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:39,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:39,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178725305] [2022-12-06 00:07:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:39,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:07:39,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 605 transitions, 11593 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:39,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:07:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:41,528 INFO L130 PetriNetUnfolder]: 7838/11267 cut-off events. [2022-12-06 00:07:41,529 INFO L131 PetriNetUnfolder]: For 100677/100677 co-relation queries the response was YES. [2022-12-06 00:07:41,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83819 conditions, 11267 events. 7838/11267 cut-off events. For 100677/100677 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 62352 event pairs, 584 based on Foata normal form. 114/11381 useless extension candidates. Maximal degree in co-relation 81854. Up to 10246 conditions per place. [2022-12-06 00:07:41,611 INFO L137 encePairwiseOnDemand]: 26/49 looper letters, 483 selfloop transitions, 185 changer transitions 2/670 dead transitions. [2022-12-06 00:07:41,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 670 transitions, 13827 flow [2022-12-06 00:07:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 00:07:41,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2022-12-06 00:07:41,612 INFO L175 Difference]: Start difference. First operand has 125 places, 605 transitions, 11593 flow. Second operand 5 states and 95 transitions. [2022-12-06 00:07:41,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 670 transitions, 13827 flow [2022-12-06 00:07:42,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 670 transitions, 13794 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:42,155 INFO L231 Difference]: Finished difference. Result has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11525, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12455, PETRI_PLACES=129, PETRI_TRANSITIONS=627} [2022-12-06 00:07:42,156 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 81 predicate places. [2022-12-06 00:07:42,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:42,156 INFO L89 Accepts]: Start accepts. Operand has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:42,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:42,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,578 INFO L130 PetriNetUnfolder]: 2172/3609 cut-off events. [2022-12-06 00:07:42,579 INFO L131 PetriNetUnfolder]: For 38246/43833 co-relation queries the response was YES. [2022-12-06 00:07:42,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27372 conditions, 3609 events. 2172/3609 cut-off events. For 38246/43833 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 22494 event pairs, 130 based on Foata normal form. 16/3589 useless extension candidates. Maximal degree in co-relation 27046. Up to 1474 conditions per place. [2022-12-06 00:07:42,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 2726 [2022-12-06 00:07:42,624 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:42,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 469 [2022-12-06 00:07:42,625 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 627 transitions, 12455 flow [2022-12-06 00:07:42,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:42,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:42,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:07:42,625 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash -171574140, now seen corresponding path program 2 times [2022-12-06 00:07:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:42,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394420369] [2022-12-06 00:07:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:42,740 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 00:07:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394420369] [2022-12-06 00:07:42,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394420369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:42,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:42,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732323873] [2022-12-06 00:07:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:42,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:42,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:07:42,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 627 transitions, 12455 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:42,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:42,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:07:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:44,840 INFO L130 PetriNetUnfolder]: 8591/12544 cut-off events. [2022-12-06 00:07:44,841 INFO L131 PetriNetUnfolder]: For 109344/109344 co-relation queries the response was YES. [2022-12-06 00:07:44,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91621 conditions, 12544 events. 8591/12544 cut-off events. For 109344/109344 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 73204 event pairs, 123 based on Foata normal form. 168/12712 useless extension candidates. Maximal degree in co-relation 89483. Up to 4881 conditions per place. [2022-12-06 00:07:44,926 INFO L137 encePairwiseOnDemand]: 23/48 looper letters, 145 selfloop transitions, 626 changer transitions 0/771 dead transitions. [2022-12-06 00:07:44,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 771 transitions, 15264 flow [2022-12-06 00:07:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2022-12-06 00:07:44,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 00:07:44,927 INFO L175 Difference]: Start difference. First operand has 129 places, 627 transitions, 12455 flow. Second operand 7 states and 162 transitions. [2022-12-06 00:07:44,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 771 transitions, 15264 flow [2022-12-06 00:07:45,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 771 transitions, 15088 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:45,412 INFO L231 Difference]: Finished difference. Result has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12279, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=564, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15094, PETRI_PLACES=135, PETRI_TRANSITIONS=698} [2022-12-06 00:07:45,413 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 87 predicate places. [2022-12-06 00:07:45,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:45,413 INFO L89 Accepts]: Start accepts. Operand has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:45,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:45,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,928 INFO L130 PetriNetUnfolder]: 2299/4027 cut-off events. [2022-12-06 00:07:45,928 INFO L131 PetriNetUnfolder]: For 53991/64667 co-relation queries the response was YES. [2022-12-06 00:07:45,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34473 conditions, 4027 events. 2299/4027 cut-off events. For 53991/64667 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 27208 event pairs, 28 based on Foata normal form. 19/4009 useless extension candidates. Maximal degree in co-relation 34001. Up to 1641 conditions per place. [2022-12-06 00:07:45,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 3196 [2022-12-06 00:07:45,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:45,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 567 [2022-12-06 00:07:45,980 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 698 transitions, 15094 flow [2022-12-06 00:07:45,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:45,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:45,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:45,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:07:45,981 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2143782698, now seen corresponding path program 3 times [2022-12-06 00:07:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:45,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294909859] [2022-12-06 00:07:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:46,100 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 00:07:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294909859] [2022-12-06 00:07:46,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294909859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:46,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:46,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634952988] [2022-12-06 00:07:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:46,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:46,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:46,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:46,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:07:46,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 698 transitions, 15094 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:46,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:46,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:07:46,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:48,109 INFO L130 PetriNetUnfolder]: 7010/10585 cut-off events. [2022-12-06 00:07:48,109 INFO L131 PetriNetUnfolder]: For 147482/147482 co-relation queries the response was YES. [2022-12-06 00:07:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91314 conditions, 10585 events. 7010/10585 cut-off events. For 147482/147482 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 64317 event pairs, 91 based on Foata normal form. 860/11445 useless extension candidates. Maximal degree in co-relation 88902. Up to 3567 conditions per place. [2022-12-06 00:07:48,197 INFO L137 encePairwiseOnDemand]: 24/48 looper letters, 151 selfloop transitions, 630 changer transitions 0/781 dead transitions. [2022-12-06 00:07:48,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 781 transitions, 17264 flow [2022-12-06 00:07:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2022-12-06 00:07:48,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 00:07:48,198 INFO L175 Difference]: Start difference. First operand has 135 places, 698 transitions, 15094 flow. Second operand 7 states and 152 transitions. [2022-12-06 00:07:48,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 781 transitions, 17264 flow [2022-12-06 00:07:49,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 781 transitions, 17097 flow, removed 77 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:49,501 INFO L231 Difference]: Finished difference. Result has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:49,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12893, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=537, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16423, PETRI_PLACES=140, PETRI_TRANSITIONS=701} [2022-12-06 00:07:49,502 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 92 predicate places. [2022-12-06 00:07:49,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:49,502 INFO L89 Accepts]: Start accepts. Operand has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:49,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:49,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:49,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:49,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:50,169 INFO L130 PetriNetUnfolder]: 1967/3554 cut-off events. [2022-12-06 00:07:50,170 INFO L131 PetriNetUnfolder]: For 51441/57492 co-relation queries the response was YES. [2022-12-06 00:07:50,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34038 conditions, 3554 events. 1967/3554 cut-off events. For 51441/57492 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 24449 event pairs, 20 based on Foata normal form. 19/3548 useless extension candidates. Maximal degree in co-relation 33666. Up to 1442 conditions per place. [2022-12-06 00:07:50,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:50,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 2958 [2022-12-06 00:07:50,212 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:50,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 00:07:50,214 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 701 transitions, 16423 flow [2022-12-06 00:07:50,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:50,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:50,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:07:50,214 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:50,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1690861380, now seen corresponding path program 1 times [2022-12-06 00:07:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:50,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908599937] [2022-12-06 00:07:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:50,372 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 00:07:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:50,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908599937] [2022-12-06 00:07:50,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908599937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:50,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:50,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:07:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753139879] [2022-12-06 00:07:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:50,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:07:50,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:50,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:07:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:07:50,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:07:50,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 701 transitions, 16423 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:50,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:07:50,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:52,355 INFO L130 PetriNetUnfolder]: 6867/10428 cut-off events. [2022-12-06 00:07:52,355 INFO L131 PetriNetUnfolder]: For 129584/129584 co-relation queries the response was YES. [2022-12-06 00:07:52,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94928 conditions, 10428 events. 6867/10428 cut-off events. For 129584/129584 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 63421 event pairs, 238 based on Foata normal form. 124/10552 useless extension candidates. Maximal degree in co-relation 92718. Up to 9957 conditions per place. [2022-12-06 00:07:52,440 INFO L137 encePairwiseOnDemand]: 22/43 looper letters, 624 selfloop transitions, 120 changer transitions 10/754 dead transitions. [2022-12-06 00:07:52,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 754 transitions, 17899 flow [2022-12-06 00:07:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:07:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:07:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2022-12-06 00:07:52,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23875968992248062 [2022-12-06 00:07:52,442 INFO L175 Difference]: Start difference. First operand has 140 places, 701 transitions, 16423 flow. Second operand 15 states and 154 transitions. [2022-12-06 00:07:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 754 transitions, 17899 flow [2022-12-06 00:07:53,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 754 transitions, 17095 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:53,637 INFO L231 Difference]: Finished difference. Result has 151 places, 679 transitions, 15127 flow [2022-12-06 00:07:53,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14747, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15127, PETRI_PLACES=151, PETRI_TRANSITIONS=679} [2022-12-06 00:07:53,638 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 103 predicate places. [2022-12-06 00:07:53,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:53,638 INFO L89 Accepts]: Start accepts. Operand has 151 places, 679 transitions, 15127 flow [2022-12-06 00:07:53,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:53,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:53,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 679 transitions, 15127 flow [2022-12-06 00:07:53,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 679 transitions, 15127 flow [2022-12-06 00:07:54,113 INFO L130 PetriNetUnfolder]: 1912/3474 cut-off events. [2022-12-06 00:07:54,113 INFO L131 PetriNetUnfolder]: For 49672/55821 co-relation queries the response was YES. [2022-12-06 00:07:54,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31119 conditions, 3474 events. 1912/3474 cut-off events. For 49672/55821 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 23964 event pairs, 21 based on Foata normal form. 20/3470 useless extension candidates. Maximal degree in co-relation 30760. Up to 1417 conditions per place. [2022-12-06 00:07:54,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 679 transitions, 15127 flow [2022-12-06 00:07:54,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-06 00:07:54,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L86: Formula: (and (= v_~t~0_299 (+ v_~m3~0_127 1)) (= v_~t~0_301 v_~m2~0_121) (= v_~t~0_299 (+ v_~t~0_301 2))) InVars {~t~0=v_~t~0_301} OutVars{~m3~0=v_~m3~0_127, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_25|, ~m2~0=v_~m2~0_121, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_29|, ~t~0=v_~t~0_299} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:07:54,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L86: Formula: (and (= v_~t~0_299 (+ v_~m3~0_127 1)) (= v_~t~0_301 v_~m2~0_121) (= v_~t~0_299 (+ v_~t~0_301 2))) InVars {~t~0=v_~t~0_301} OutVars{~m3~0=v_~m3~0_127, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_25|, ~m2~0=v_~m2~0_121, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_29|, ~t~0=v_~t~0_299} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:07:54,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L86: Formula: (and (= v_~t~0_299 (+ v_~m3~0_127 1)) (= v_~t~0_301 v_~m2~0_121) (= v_~t~0_299 (+ v_~t~0_301 2))) InVars {~t~0=v_~t~0_301} OutVars{~m3~0=v_~m3~0_127, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_25|, ~m2~0=v_~m2~0_121, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_29|, ~t~0=v_~t~0_299} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:07:54,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L86: Formula: (and (= v_~t~0_299 (+ v_~m3~0_127 1)) (= v_~t~0_301 v_~m2~0_121) (= v_~t~0_299 (+ v_~t~0_301 2))) InVars {~t~0=v_~t~0_301} OutVars{~m3~0=v_~m3~0_127, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_25|, ~m2~0=v_~m2~0_121, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_29|, ~t~0=v_~t~0_299} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:54,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:54,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 646 [2022-12-06 00:07:54,284 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 678 transitions, 15155 flow [2022-12-06 00:07:54,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:54,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:54,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:07:54,284 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 172018198, now seen corresponding path program 4 times [2022-12-06 00:07:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:54,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764640429] [2022-12-06 00:07:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:54,413 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 00:07:54,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:54,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764640429] [2022-12-06 00:07:54,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764640429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:54,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:54,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:54,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911282455] [2022-12-06 00:07:54,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:54,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:54,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:07:54,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 678 transitions, 15155 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:54,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:07:54,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:56,712 INFO L130 PetriNetUnfolder]: 7553/11496 cut-off events. [2022-12-06 00:07:56,712 INFO L131 PetriNetUnfolder]: For 149642/149642 co-relation queries the response was YES. [2022-12-06 00:07:56,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100998 conditions, 11496 events. 7553/11496 cut-off events. For 149642/149642 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 72021 event pairs, 276 based on Foata normal form. 182/11678 useless extension candidates. Maximal degree in co-relation 99003. Up to 7436 conditions per place. [2022-12-06 00:07:56,797 INFO L137 encePairwiseOnDemand]: 21/46 looper letters, 414 selfloop transitions, 453 changer transitions 8/875 dead transitions. [2022-12-06 00:07:56,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 875 transitions, 20837 flow [2022-12-06 00:07:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 00:07:56,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35597826086956524 [2022-12-06 00:07:56,799 INFO L175 Difference]: Start difference. First operand has 150 places, 678 transitions, 15155 flow. Second operand 8 states and 131 transitions. [2022-12-06 00:07:56,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 875 transitions, 20837 flow [2022-12-06 00:07:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 875 transitions, 20438 flow, removed 78 selfloop flow, removed 7 redundant places. [2022-12-06 00:07:57,895 INFO L231 Difference]: Finished difference. Result has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:57,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14770, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19524, PETRI_PLACES=154, PETRI_TRANSITIONS=807} [2022-12-06 00:07:57,895 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 106 predicate places. [2022-12-06 00:07:57,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:57,896 INFO L89 Accepts]: Start accepts. Operand has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:57,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:57,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:57,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:57,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:58,518 INFO L130 PetriNetUnfolder]: 2152/3898 cut-off events. [2022-12-06 00:07:58,518 INFO L131 PetriNetUnfolder]: For 68719/79089 co-relation queries the response was YES. [2022-12-06 00:07:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38752 conditions, 3898 events. 2152/3898 cut-off events. For 68719/79089 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 27779 event pairs, 29 based on Foata normal form. 23/3896 useless extension candidates. Maximal degree in co-relation 38397. Up to 1621 conditions per place. [2022-12-06 00:07:58,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:58,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 3186 [2022-12-06 00:07:58,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:58,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 675 [2022-12-06 00:07:58,571 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 807 transitions, 19524 flow [2022-12-06 00:07:58,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:58,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:58,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:07:58,571 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:07:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1987053518, now seen corresponding path program 1 times [2022-12-06 00:07:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173082781] [2022-12-06 00:07:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:58,682 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 00:07:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:58,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173082781] [2022-12-06 00:07:58,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173082781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:58,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:58,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244027709] [2022-12-06 00:07:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:58,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:58,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:07:58,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 807 transitions, 19524 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:58,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:07:58,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:01,049 INFO L130 PetriNetUnfolder]: 7559/11594 cut-off events. [2022-12-06 00:08:01,050 INFO L131 PetriNetUnfolder]: For 168791/168791 co-relation queries the response was YES. [2022-12-06 00:08:01,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108118 conditions, 11594 events. 7559/11594 cut-off events. For 168791/168791 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 73801 event pairs, 258 based on Foata normal form. 280/11874 useless extension candidates. Maximal degree in co-relation 106281. Up to 7382 conditions per place. [2022-12-06 00:08:01,152 INFO L137 encePairwiseOnDemand]: 22/46 looper letters, 401 selfloop transitions, 454 changer transitions 14/869 dead transitions. [2022-12-06 00:08:01,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 869 transitions, 21959 flow [2022-12-06 00:08:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:08:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:08:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 00:08:01,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39492753623188404 [2022-12-06 00:08:01,153 INFO L175 Difference]: Start difference. First operand has 154 places, 807 transitions, 19524 flow. Second operand 6 states and 109 transitions. [2022-12-06 00:08:01,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 869 transitions, 21959 flow [2022-12-06 00:08:02,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 869 transitions, 21875 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:02,989 INFO L231 Difference]: Finished difference. Result has 159 places, 809 transitions, 20382 flow [2022-12-06 00:08:02,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18623, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20382, PETRI_PLACES=159, PETRI_TRANSITIONS=809} [2022-12-06 00:08:02,990 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 111 predicate places. [2022-12-06 00:08:02,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:02,990 INFO L89 Accepts]: Start accepts. Operand has 159 places, 809 transitions, 20382 flow [2022-12-06 00:08:02,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:02,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:02,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 809 transitions, 20382 flow [2022-12-06 00:08:03,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 809 transitions, 20382 flow [2022-12-06 00:08:03,744 INFO L130 PetriNetUnfolder]: 2138/3896 cut-off events. [2022-12-06 00:08:03,744 INFO L131 PetriNetUnfolder]: For 70867/79451 co-relation queries the response was YES. [2022-12-06 00:08:03,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40720 conditions, 3896 events. 2138/3896 cut-off events. For 70867/79451 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 27912 event pairs, 25 based on Foata normal form. 17/3893 useless extension candidates. Maximal degree in co-relation 40369. Up to 1635 conditions per place. [2022-12-06 00:08:03,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 809 transitions, 20382 flow [2022-12-06 00:08:03,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 3158 [2022-12-06 00:08:03,797 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:03,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 808 [2022-12-06 00:08:03,798 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 809 transitions, 20382 flow [2022-12-06 00:08:03,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:03,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:03,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:08:03,798 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash 966913600, now seen corresponding path program 2 times [2022-12-06 00:08:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:03,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894338242] [2022-12-06 00:08:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:03,900 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 00:08:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894338242] [2022-12-06 00:08:03,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894338242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:03,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:03,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002897671] [2022-12-06 00:08:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:03,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:03,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:03,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 809 transitions, 20382 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:03,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:03,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:06,556 INFO L130 PetriNetUnfolder]: 7724/11875 cut-off events. [2022-12-06 00:08:06,557 INFO L131 PetriNetUnfolder]: For 179652/179652 co-relation queries the response was YES. [2022-12-06 00:08:06,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116369 conditions, 11875 events. 7724/11875 cut-off events. For 179652/179652 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 76447 event pairs, 253 based on Foata normal form. 334/12209 useless extension candidates. Maximal degree in co-relation 114496. Up to 6963 conditions per place. [2022-12-06 00:08:06,652 INFO L137 encePairwiseOnDemand]: 22/45 looper letters, 325 selfloop transitions, 592 changer transitions 14/931 dead transitions. [2022-12-06 00:08:06,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 931 transitions, 24771 flow [2022-12-06 00:08:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:08:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:08:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-06 00:08:06,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 00:08:06,653 INFO L175 Difference]: Start difference. First operand has 158 places, 809 transitions, 20382 flow. Second operand 8 states and 132 transitions. [2022-12-06 00:08:06,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 931 transitions, 24771 flow [2022-12-06 00:08:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 931 transitions, 24158 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:08,352 INFO L231 Difference]: Finished difference. Result has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:08,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=19761, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=527, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=22397, PETRI_PLACES=162, PETRI_TRANSITIONS=859} [2022-12-06 00:08:08,354 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 114 predicate places. [2022-12-06 00:08:08,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:08,354 INFO L89 Accepts]: Start accepts. Operand has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:08,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:08,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:08,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:08,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:09,053 INFO L130 PetriNetUnfolder]: 2176/4010 cut-off events. [2022-12-06 00:08:09,053 INFO L131 PetriNetUnfolder]: For 78050/85187 co-relation queries the response was YES. [2022-12-06 00:08:09,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42828 conditions, 4010 events. 2176/4010 cut-off events. For 78050/85187 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 29364 event pairs, 30 based on Foata normal form. 18/4010 useless extension candidates. Maximal degree in co-relation 42469. Up to 1716 conditions per place. [2022-12-06 00:08:09,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:09,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-06 00:08:09,110 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:09,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 756 [2022-12-06 00:08:09,110 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 859 transitions, 22397 flow [2022-12-06 00:08:09,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:09,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:08:09,111 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 680919290, now seen corresponding path program 3 times [2022-12-06 00:08:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:09,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419364140] [2022-12-06 00:08:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:09,213 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 00:08:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:09,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419364140] [2022-12-06 00:08:09,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419364140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:09,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:09,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:08:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664160907] [2022-12-06 00:08:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:08:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:08:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:08:09,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:09,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 859 transitions, 22397 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:09,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:09,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:11,981 INFO L130 PetriNetUnfolder]: 7809/12104 cut-off events. [2022-12-06 00:08:11,981 INFO L131 PetriNetUnfolder]: For 185041/185041 co-relation queries the response was YES. [2022-12-06 00:08:12,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119260 conditions, 12104 events. 7809/12104 cut-off events. For 185041/185041 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 79253 event pairs, 225 based on Foata normal form. 156/12260 useless extension candidates. Maximal degree in co-relation 117405. Up to 5187 conditions per place. [2022-12-06 00:08:12,099 INFO L137 encePairwiseOnDemand]: 23/45 looper letters, 267 selfloop transitions, 684 changer transitions 10/961 dead transitions. [2022-12-06 00:08:12,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 961 transitions, 25778 flow [2022-12-06 00:08:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:08:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:08:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 00:08:12,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2022-12-06 00:08:12,100 INFO L175 Difference]: Start difference. First operand has 162 places, 859 transitions, 22397 flow. Second operand 6 states and 104 transitions. [2022-12-06 00:08:12,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 961 transitions, 25778 flow [2022-12-06 00:08:14,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 961 transitions, 24532 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-12-06 00:08:14,123 INFO L231 Difference]: Finished difference. Result has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=21167, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=640, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24581, PETRI_PLACES=165, PETRI_TRANSITIONS=908} [2022-12-06 00:08:14,124 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 117 predicate places. [2022-12-06 00:08:14,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:14,125 INFO L89 Accepts]: Start accepts. Operand has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:14,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:14,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,901 INFO L130 PetriNetUnfolder]: 2192/4089 cut-off events. [2022-12-06 00:08:14,901 INFO L131 PetriNetUnfolder]: For 89557/98781 co-relation queries the response was YES. [2022-12-06 00:08:14,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46868 conditions, 4089 events. 2192/4089 cut-off events. For 89557/98781 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 30596 event pairs, 30 based on Foata normal form. 20/4091 useless extension candidates. Maximal degree in co-relation 46524. Up to 1777 conditions per place. [2022-12-06 00:08:14,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 3448 [2022-12-06 00:08:14,960 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:14,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 836 [2022-12-06 00:08:14,960 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 908 transitions, 24581 flow [2022-12-06 00:08:14,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:14,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:14,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:14,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:08:14,961 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1551920694, now seen corresponding path program 1 times [2022-12-06 00:08:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700544815] [2022-12-06 00:08:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:15,066 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 00:08:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:15,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700544815] [2022-12-06 00:08:15,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700544815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:15,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:15,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188820571] [2022-12-06 00:08:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:15,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:15,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:15,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:15,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 908 transitions, 24581 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:15,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:15,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:15,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:18,197 INFO L130 PetriNetUnfolder]: 7794/12139 cut-off events. [2022-12-06 00:08:18,197 INFO L131 PetriNetUnfolder]: For 207829/207829 co-relation queries the response was YES. [2022-12-06 00:08:18,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127074 conditions, 12139 events. 7794/12139 cut-off events. For 207829/207829 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 80321 event pairs, 197 based on Foata normal form. 94/12233 useless extension candidates. Maximal degree in co-relation 125120. Up to 5385 conditions per place. [2022-12-06 00:08:18,309 INFO L137 encePairwiseOnDemand]: 23/45 looper letters, 261 selfloop transitions, 736 changer transitions 4/1001 dead transitions. [2022-12-06 00:08:18,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1001 transitions, 27565 flow [2022-12-06 00:08:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:08:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:08:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2022-12-06 00:08:18,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2022-12-06 00:08:18,311 INFO L175 Difference]: Start difference. First operand has 165 places, 908 transitions, 24581 flow. Second operand 8 states and 157 transitions. [2022-12-06 00:08:18,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1001 transitions, 27565 flow [2022-12-06 00:08:20,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1001 transitions, 27325 flow, removed 70 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:20,243 INFO L231 Difference]: Finished difference. Result has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:20,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=24310, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=704, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=26260, PETRI_PLACES=170, PETRI_TRANSITIONS=935} [2022-12-06 00:08:20,244 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 122 predicate places. [2022-12-06 00:08:20,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:20,244 INFO L89 Accepts]: Start accepts. Operand has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:20,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:20,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:20,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:21,112 INFO L130 PetriNetUnfolder]: 2191/4106 cut-off events. [2022-12-06 00:08:21,112 INFO L131 PetriNetUnfolder]: For 90183/100638 co-relation queries the response was YES. [2022-12-06 00:08:21,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48962 conditions, 4106 events. 2191/4106 cut-off events. For 90183/100638 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 30930 event pairs, 30 based on Foata normal form. 21/4108 useless extension candidates. Maximal degree in co-relation 48618. Up to 1777 conditions per place. [2022-12-06 00:08:21,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:21,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-06 00:08:21,169 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:21,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 925 [2022-12-06 00:08:21,169 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 935 transitions, 26260 flow [2022-12-06 00:08:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:21,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:21,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:08:21,170 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash 782753864, now seen corresponding path program 2 times [2022-12-06 00:08:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:21,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007275656] [2022-12-06 00:08:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:21,270 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 00:08:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:21,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007275656] [2022-12-06 00:08:21,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007275656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:21,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958455725] [2022-12-06 00:08:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:21,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:21,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 935 transitions, 26260 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:21,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:21,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:24,185 INFO L130 PetriNetUnfolder]: 7787/12148 cut-off events. [2022-12-06 00:08:24,185 INFO L131 PetriNetUnfolder]: For 213626/213626 co-relation queries the response was YES. [2022-12-06 00:08:24,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131815 conditions, 12148 events. 7787/12148 cut-off events. For 213626/213626 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 80659 event pairs, 265 based on Foata normal form. 44/12192 useless extension candidates. Maximal degree in co-relation 129769. Up to 11486 conditions per place. [2022-12-06 00:08:24,298 INFO L137 encePairwiseOnDemand]: 24/45 looper letters, 784 selfloop transitions, 188 changer transitions 14/986 dead transitions. [2022-12-06 00:08:24,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 986 transitions, 28939 flow [2022-12-06 00:08:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:08:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:08:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-06 00:08:24,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3277777777777778 [2022-12-06 00:08:24,299 INFO L175 Difference]: Start difference. First operand has 170 places, 935 transitions, 26260 flow. Second operand 8 states and 118 transitions. [2022-12-06 00:08:24,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 986 transitions, 28939 flow [2022-12-06 00:08:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 986 transitions, 28454 flow, removed 48 selfloop flow, removed 4 redundant places. [2022-12-06 00:08:26,276 INFO L231 Difference]: Finished difference. Result has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:26,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=25781, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=26099, PETRI_PLACES=173, PETRI_TRANSITIONS=935} [2022-12-06 00:08:26,277 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 125 predicate places. [2022-12-06 00:08:26,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:26,277 INFO L89 Accepts]: Start accepts. Operand has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:26,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:26,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:26,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:26,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:27,240 INFO L130 PetriNetUnfolder]: 2186/4102 cut-off events. [2022-12-06 00:08:27,240 INFO L131 PetriNetUnfolder]: For 91818/100772 co-relation queries the response was YES. [2022-12-06 00:08:27,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47753 conditions, 4102 events. 2186/4102 cut-off events. For 91818/100772 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 30926 event pairs, 30 based on Foata normal form. 18/4099 useless extension candidates. Maximal degree in co-relation 47406. Up to 1758 conditions per place. [2022-12-06 00:08:27,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:27,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 3502 [2022-12-06 00:08:27,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:27,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1022 [2022-12-06 00:08:27,299 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 935 transitions, 26099 flow [2022-12-06 00:08:27,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:27,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:27,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:08:27,299 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -954835237, now seen corresponding path program 1 times [2022-12-06 00:08:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223358125] [2022-12-06 00:08:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:27,407 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 00:08:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223358125] [2022-12-06 00:08:27,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223358125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:27,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:27,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:08:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230665330] [2022-12-06 00:08:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:27,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:08:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:08:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:08:27,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:27,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 935 transitions, 26099 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:27,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:27,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:30,407 INFO L130 PetriNetUnfolder]: 7890/12357 cut-off events. [2022-12-06 00:08:30,407 INFO L131 PetriNetUnfolder]: For 215101/215101 co-relation queries the response was YES. [2022-12-06 00:08:30,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130482 conditions, 12357 events. 7890/12357 cut-off events. For 215101/215101 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 83160 event pairs, 119 based on Foata normal form. 98/12455 useless extension candidates. Maximal degree in co-relation 128693. Up to 4323 conditions per place. [2022-12-06 00:08:30,512 INFO L137 encePairwiseOnDemand]: 22/45 looper letters, 167 selfloop transitions, 906 changer transitions 16/1089 dead transitions. [2022-12-06 00:08:30,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1089 transitions, 30556 flow [2022-12-06 00:08:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:08:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:08:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2022-12-06 00:08:30,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2022-12-06 00:08:30,513 INFO L175 Difference]: Start difference. First operand has 173 places, 935 transitions, 26099 flow. Second operand 9 states and 174 transitions. [2022-12-06 00:08:30,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1089 transitions, 30556 flow [2022-12-06 00:08:32,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1089 transitions, 30457 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:32,450 INFO L231 Difference]: Finished difference. Result has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:32,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=26002, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=854, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=28930, PETRI_PLACES=179, PETRI_TRANSITIONS=987} [2022-12-06 00:08:32,452 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 131 predicate places. [2022-12-06 00:08:32,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:32,452 INFO L89 Accepts]: Start accepts. Operand has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:32,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:32,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:32,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:32,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:33,418 INFO L130 PetriNetUnfolder]: 2205/4190 cut-off events. [2022-12-06 00:08:33,419 INFO L131 PetriNetUnfolder]: For 99923/111028 co-relation queries the response was YES. [2022-12-06 00:08:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51708 conditions, 4190 events. 2205/4190 cut-off events. For 99923/111028 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 32206 event pairs, 31 based on Foata normal form. 18/4187 useless extension candidates. Maximal degree in co-relation 51357. Up to 1788 conditions per place. [2022-12-06 00:08:33,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:33,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 3606 [2022-12-06 00:08:33,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:33,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1029 [2022-12-06 00:08:33,481 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 987 transitions, 28930 flow [2022-12-06 00:08:33,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:33,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:33,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:08:33,481 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash -343684544, now seen corresponding path program 4 times [2022-12-06 00:08:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:33,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280063898] [2022-12-06 00:08:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:33,599 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 00:08:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280063898] [2022-12-06 00:08:33,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280063898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:33,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:33,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:08:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697651477] [2022-12-06 00:08:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:33,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:08:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:08:33,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:08:33,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:33,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 987 transitions, 28930 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:33,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:33,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:37,255 INFO L130 PetriNetUnfolder]: 7908/12491 cut-off events. [2022-12-06 00:08:37,255 INFO L131 PetriNetUnfolder]: For 233951/233951 co-relation queries the response was YES. [2022-12-06 00:08:37,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139009 conditions, 12491 events. 7908/12491 cut-off events. For 233951/233951 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 85578 event pairs, 127 based on Foata normal form. 188/12679 useless extension candidates. Maximal degree in co-relation 136869. Up to 4375 conditions per place. [2022-12-06 00:08:37,404 INFO L137 encePairwiseOnDemand]: 22/45 looper letters, 165 selfloop transitions, 943 changer transitions 16/1124 dead transitions. [2022-12-06 00:08:37,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1124 transitions, 32780 flow [2022-12-06 00:08:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:08:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:08:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2022-12-06 00:08:37,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44938271604938274 [2022-12-06 00:08:37,405 INFO L175 Difference]: Start difference. First operand has 179 places, 987 transitions, 28930 flow. Second operand 9 states and 182 transitions. [2022-12-06 00:08:37,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1124 transitions, 32780 flow [2022-12-06 00:08:40,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1124 transitions, 31412 flow, removed 30 selfloop flow, removed 6 redundant places. [2022-12-06 00:08:40,393 INFO L231 Difference]: Finished difference. Result has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:40,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=27465, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=898, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=30488, PETRI_PLACES=182, PETRI_TRANSITIONS=1020} [2022-12-06 00:08:40,395 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 134 predicate places. [2022-12-06 00:08:40,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:40,441 INFO L89 Accepts]: Start accepts. Operand has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:40,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:40,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:40,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:41,499 INFO L130 PetriNetUnfolder]: 2184/4199 cut-off events. [2022-12-06 00:08:41,500 INFO L131 PetriNetUnfolder]: For 109475/121356 co-relation queries the response was YES. [2022-12-06 00:08:41,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53633 conditions, 4199 events. 2184/4199 cut-off events. For 109475/121356 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 32946 event pairs, 48 based on Foata normal form. 21/4201 useless extension candidates. Maximal degree in co-relation 53305. Up to 1810 conditions per place. [2022-12-06 00:08:41,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:41,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 3680 [2022-12-06 00:08:41,558 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:41,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1163 [2022-12-06 00:08:41,559 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1020 transitions, 30488 flow [2022-12-06 00:08:41,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:41,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 00:08:41,559 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 78624342, now seen corresponding path program 3 times [2022-12-06 00:08:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:41,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427144998] [2022-12-06 00:08:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:41,768 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 00:08:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427144998] [2022-12-06 00:08:41,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427144998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:41,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:41,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355028829] [2022-12-06 00:08:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:41,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:41,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:08:41,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1020 transitions, 30488 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:41,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:08:41,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:45,372 INFO L130 PetriNetUnfolder]: 7867/12462 cut-off events. [2022-12-06 00:08:45,372 INFO L131 PetriNetUnfolder]: For 257914/257914 co-relation queries the response was YES. [2022-12-06 00:08:45,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142635 conditions, 12462 events. 7867/12462 cut-off events. For 257914/257914 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 85559 event pairs, 318 based on Foata normal form. 34/12496 useless extension candidates. Maximal degree in co-relation 140761. Up to 12233 conditions per place. [2022-12-06 00:08:45,495 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 1003 selfloop transitions, 52 changer transitions 18/1073 dead transitions. [2022-12-06 00:08:45,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1073 transitions, 33457 flow [2022-12-06 00:08:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:08:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:08:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-06 00:08:45,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2611111111111111 [2022-12-06 00:08:45,496 INFO L175 Difference]: Start difference. First operand has 182 places, 1020 transitions, 30488 flow. Second operand 8 states and 94 transitions. [2022-12-06 00:08:45,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1073 transitions, 33457 flow [2022-12-06 00:08:47,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1073 transitions, 33039 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:47,732 INFO L231 Difference]: Finished difference. Result has 188 places, 1026 transitions, 30394 flow [2022-12-06 00:08:47,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=30082, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=30394, PETRI_PLACES=188, PETRI_TRANSITIONS=1026} [2022-12-06 00:08:47,733 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 140 predicate places. [2022-12-06 00:08:47,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:47,733 INFO L89 Accepts]: Start accepts. Operand has 188 places, 1026 transitions, 30394 flow [2022-12-06 00:08:47,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:47,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:47,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 1026 transitions, 30394 flow [2022-12-06 00:08:47,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 1026 transitions, 30394 flow [2022-12-06 00:08:48,649 INFO L130 PetriNetUnfolder]: 2175/4196 cut-off events. [2022-12-06 00:08:48,649 INFO L131 PetriNetUnfolder]: For 109720/119953 co-relation queries the response was YES. [2022-12-06 00:08:48,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52383 conditions, 4196 events. 2175/4196 cut-off events. For 109720/119953 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 32920 event pairs, 48 based on Foata normal form. 14/4190 useless extension candidates. Maximal degree in co-relation 52045. Up to 1806 conditions per place. [2022-12-06 00:08:48,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 1026 transitions, 30394 flow [2022-12-06 00:08:48,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 3680 [2022-12-06 00:08:48,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_112 (+ v_~m3~0_131 1)) (= v_~t~0_343 v_~m2~0_137) (= v_~m3~0_131 (+ v_~t~0_343 1)) (= v_~t~0_341 (+ v_~m3~0_131 2))) InVars {~t~0=v_~t~0_343} OutVars{~m3~0=v_~m3~0_131, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_30|, ~m4~0=v_~m4~0_112, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_41|, ~m2~0=v_~m2~0_137, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_33|, ~t~0=v_~t~0_341} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:08:48,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] $Ultimate##0-->L124: Formula: (and (= v_~t~0_335 (+ v_~t~0_337 3)) (= v_~t~0_335 (+ v_~m5~0_130 1)) (= v_~t~0_335 (+ v_~m3~0_129 2)) (= v_~t~0_337 v_~m2~0_135)) InVars {~t~0=v_~t~0_337} OutVars{~m3~0=v_~m3~0_129, ~m5~0=v_~m5~0_130, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_39|, ~m2~0=v_~m2~0_135, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_36|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_31|, ~t~0=v_~t~0_335} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:08:48,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] $Ultimate##0-->L124: Formula: (and (= v_~t~0_335 (+ v_~t~0_337 3)) (= v_~t~0_335 (+ v_~m5~0_130 1)) (= v_~t~0_335 (+ v_~m3~0_129 2)) (= v_~t~0_337 v_~m2~0_135)) InVars {~t~0=v_~t~0_337} OutVars{~m3~0=v_~m3~0_129, ~m5~0=v_~m5~0_130, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_39|, ~m2~0=v_~m2~0_135, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_36|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_31|, ~t~0=v_~t~0_335} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:08:48,866 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:08:48,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1134 [2022-12-06 00:08:48,867 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 1026 transitions, 30413 flow [2022-12-06 00:08:48,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:48,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:48,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 00:08:48,867 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1963758391, now seen corresponding path program 2 times [2022-12-06 00:08:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737738581] [2022-12-06 00:08:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:49,075 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 00:08:49,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737738581] [2022-12-06 00:08:49,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737738581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:49,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:49,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:08:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519172678] [2022-12-06 00:08:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:49,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:08:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:08:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:08:49,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:08:49,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1026 transitions, 30413 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:49,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:49,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:08:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:53,057 INFO L130 PetriNetUnfolder]: 8431/13618 cut-off events. [2022-12-06 00:08:53,058 INFO L131 PetriNetUnfolder]: For 297654/297654 co-relation queries the response was YES. [2022-12-06 00:08:53,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153372 conditions, 13618 events. 8431/13618 cut-off events. For 297654/297654 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 98464 event pairs, 153 based on Foata normal form. 704/14322 useless extension candidates. Maximal degree in co-relation 151554. Up to 4685 conditions per place. [2022-12-06 00:08:53,169 INFO L137 encePairwiseOnDemand]: 21/47 looper letters, 177 selfloop transitions, 1071 changer transitions 73/1321 dead transitions. [2022-12-06 00:08:53,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1321 transitions, 39866 flow [2022-12-06 00:08:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:08:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:08:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2022-12-06 00:08:53,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2022-12-06 00:08:53,171 INFO L175 Difference]: Start difference. First operand has 188 places, 1026 transitions, 30413 flow. Second operand 9 states and 180 transitions. [2022-12-06 00:08:53,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1321 transitions, 39866 flow [2022-12-06 00:08:56,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1321 transitions, 39748 flow, removed 40 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:56,258 INFO L231 Difference]: Finished difference. Result has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:56,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=29859, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=897, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=38381, PETRI_PLACES=199, PETRI_TRANSITIONS=1158} [2022-12-06 00:08:56,259 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 151 predicate places. [2022-12-06 00:08:56,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:56,260 INFO L89 Accepts]: Start accepts. Operand has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:56,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:56,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:56,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:56,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:57,345 INFO L130 PetriNetUnfolder]: 2237/4404 cut-off events. [2022-12-06 00:08:57,345 INFO L131 PetriNetUnfolder]: For 146780/158467 co-relation queries the response was YES. [2022-12-06 00:08:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62616 conditions, 4404 events. 2237/4404 cut-off events. For 146780/158467 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 35845 event pairs, 57 based on Foata normal form. 16/4404 useless extension candidates. Maximal degree in co-relation 62291. Up to 1887 conditions per place. [2022-12-06 00:08:57,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:57,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 4006 [2022-12-06 00:08:57,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:57,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1164 [2022-12-06 00:08:57,423 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 1158 transitions, 38381 flow [2022-12-06 00:08:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:57,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:57,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:57,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 00:08:57,423 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:08:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 893254434, now seen corresponding path program 1 times [2022-12-06 00:08:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:57,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088965786] [2022-12-06 00:08:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:57,622 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 00:08:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088965786] [2022-12-06 00:08:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088965786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:57,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:57,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998591885] [2022-12-06 00:08:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:57,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:57,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:08:57,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 1158 transitions, 38381 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:57,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:57,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:08:57,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:01,822 INFO L130 PetriNetUnfolder]: 8154/13079 cut-off events. [2022-12-06 00:09:01,823 INFO L131 PetriNetUnfolder]: For 333785/333785 co-relation queries the response was YES. [2022-12-06 00:09:01,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164279 conditions, 13079 events. 8154/13079 cut-off events. For 333785/333785 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 92803 event pairs, 161 based on Foata normal form. 2/13081 useless extension candidates. Maximal degree in co-relation 163572. Up to 4513 conditions per place. [2022-12-06 00:09:01,946 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 154 selfloop transitions, 1069 changer transitions 3/1226 dead transitions. [2022-12-06 00:09:01,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1226 transitions, 41346 flow [2022-12-06 00:09:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:09:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:09:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2022-12-06 00:09:01,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45896656534954405 [2022-12-06 00:09:01,947 INFO L175 Difference]: Start difference. First operand has 199 places, 1158 transitions, 38381 flow. Second operand 7 states and 151 transitions. [2022-12-06 00:09:01,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1226 transitions, 41346 flow [2022-12-06 00:09:07,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1226 transitions, 40747 flow, removed 88 selfloop flow, removed 4 redundant places. [2022-12-06 00:09:07,669 INFO L231 Difference]: Finished difference. Result has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:07,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=37767, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=39873, PETRI_PLACES=201, PETRI_TRANSITIONS=1155} [2022-12-06 00:09:07,670 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 153 predicate places. [2022-12-06 00:09:07,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:07,671 INFO L89 Accepts]: Start accepts. Operand has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:07,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:07,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:07,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:07,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:08,852 INFO L130 PetriNetUnfolder]: 2237/4401 cut-off events. [2022-12-06 00:09:08,852 INFO L131 PetriNetUnfolder]: For 154266/167322 co-relation queries the response was YES. [2022-12-06 00:09:08,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64864 conditions, 4401 events. 2237/4401 cut-off events. For 154266/167322 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 35654 event pairs, 57 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 64541. Up to 1885 conditions per place. [2022-12-06 00:09:08,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:08,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 3992 [2022-12-06 00:09:08,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:08,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1256 [2022-12-06 00:09:08,927 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 1155 transitions, 39873 flow [2022-12-06 00:09:09,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:09,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 00:09:09,012 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:09:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1679413108, now seen corresponding path program 2 times [2022-12-06 00:09:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58031228] [2022-12-06 00:09:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:09,126 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 00:09:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:09,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58031228] [2022-12-06 00:09:09,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58031228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:09,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:09,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:09:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4732638] [2022-12-06 00:09:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:09,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:09:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:09:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:09:09,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:09:09,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 1155 transitions, 39873 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:09,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:09:09,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:13,489 INFO L130 PetriNetUnfolder]: 8149/13068 cut-off events. [2022-12-06 00:09:13,489 INFO L131 PetriNetUnfolder]: For 363691/363691 co-relation queries the response was YES. [2022-12-06 00:09:13,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169681 conditions, 13068 events. 8149/13068 cut-off events. For 363691/363691 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 92389 event pairs, 321 based on Foata normal form. 4/13072 useless extension candidates. Maximal degree in co-relation 168914. Up to 7529 conditions per place. [2022-12-06 00:09:13,694 INFO L137 encePairwiseOnDemand]: 22/47 looper letters, 493 selfloop transitions, 707 changer transitions 5/1205 dead transitions. [2022-12-06 00:09:13,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1205 transitions, 43084 flow [2022-12-06 00:09:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:09:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:09:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-06 00:09:13,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3351063829787234 [2022-12-06 00:09:13,695 INFO L175 Difference]: Start difference. First operand has 201 places, 1155 transitions, 39873 flow. Second operand 8 states and 126 transitions. [2022-12-06 00:09:13,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1205 transitions, 43084 flow [2022-12-06 00:09:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1205 transitions, 41744 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:09:18,181 INFO L231 Difference]: Finished difference. Result has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:18,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=38538, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=705, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=40565, PETRI_PLACES=206, PETRI_TRANSITIONS=1154} [2022-12-06 00:09:18,182 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 158 predicate places. [2022-12-06 00:09:18,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:18,182 INFO L89 Accepts]: Start accepts. Operand has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:18,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:18,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:18,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:18,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:19,343 INFO L130 PetriNetUnfolder]: 2236/4398 cut-off events. [2022-12-06 00:09:19,343 INFO L131 PetriNetUnfolder]: For 172839/186605 co-relation queries the response was YES. [2022-12-06 00:09:19,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64965 conditions, 4398 events. 2236/4398 cut-off events. For 172839/186605 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 35722 event pairs, 53 based on Foata normal form. 14/4395 useless extension candidates. Maximal degree in co-relation 64640. Up to 1882 conditions per place. [2022-12-06 00:09:19,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:19,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 3982 [2022-12-06 00:09:19,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:19,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1237 [2022-12-06 00:09:19,419 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 1154 transitions, 40565 flow [2022-12-06 00:09:19,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:19,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:19,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 00:09:19,420 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:09:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -69072258, now seen corresponding path program 3 times [2022-12-06 00:09:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:19,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43540540] [2022-12-06 00:09:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:19,534 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 00:09:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:19,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43540540] [2022-12-06 00:09:19,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43540540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:19,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:19,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:09:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609837230] [2022-12-06 00:09:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:19,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:09:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:09:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:09:19,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:09:19,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1154 transitions, 40565 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:19,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:09:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:24,019 INFO L130 PetriNetUnfolder]: 8178/13179 cut-off events. [2022-12-06 00:09:24,019 INFO L131 PetriNetUnfolder]: For 391167/391167 co-relation queries the response was YES. [2022-12-06 00:09:24,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170364 conditions, 13179 events. 8178/13179 cut-off events. For 391167/391167 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 94136 event pairs, 286 based on Foata normal form. 108/13287 useless extension candidates. Maximal degree in co-relation 169391. Up to 6172 conditions per place. [2022-12-06 00:09:24,145 INFO L137 encePairwiseOnDemand]: 22/47 looper letters, 476 selfloop transitions, 756 changer transitions 11/1243 dead transitions. [2022-12-06 00:09:24,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1243 transitions, 44095 flow [2022-12-06 00:09:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:09:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:09:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2022-12-06 00:09:24,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4175531914893617 [2022-12-06 00:09:24,147 INFO L175 Difference]: Start difference. First operand has 206 places, 1154 transitions, 40565 flow. Second operand 8 states and 157 transitions. [2022-12-06 00:09:24,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 1243 transitions, 44095 flow [2022-12-06 00:09:29,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1243 transitions, 43749 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:29,968 INFO L231 Difference]: Finished difference. Result has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:29,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=39990, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43324, PETRI_PLACES=214, PETRI_TRANSITIONS=1177} [2022-12-06 00:09:29,969 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 166 predicate places. [2022-12-06 00:09:29,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:29,969 INFO L89 Accepts]: Start accepts. Operand has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:29,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:29,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:29,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:29,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:31,441 INFO L130 PetriNetUnfolder]: 2215/4426 cut-off events. [2022-12-06 00:09:31,441 INFO L131 PetriNetUnfolder]: For 183967/195833 co-relation queries the response was YES. [2022-12-06 00:09:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68782 conditions, 4426 events. 2215/4426 cut-off events. For 183967/195833 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 36494 event pairs, 57 based on Foata normal form. 16/4426 useless extension candidates. Maximal degree in co-relation 68440. Up to 1884 conditions per place. [2022-12-06 00:09:31,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:31,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 4092 [2022-12-06 00:09:31,544 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:31,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1575 [2022-12-06 00:09:31,545 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1177 transitions, 43324 flow [2022-12-06 00:09:31,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:31,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:31,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 00:09:31,545 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:09:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1190832834, now seen corresponding path program 4 times [2022-12-06 00:09:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:31,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517782474] [2022-12-06 00:09:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:31,652 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 00:09:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:31,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517782474] [2022-12-06 00:09:31,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517782474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:31,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:31,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:09:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039828526] [2022-12-06 00:09:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:31,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:09:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:09:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:09:31,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:09:31,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1177 transitions, 43324 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:31,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:31,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:09:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:37,091 INFO L130 PetriNetUnfolder]: 8125/13142 cut-off events. [2022-12-06 00:09:37,092 INFO L131 PetriNetUnfolder]: For 419355/419355 co-relation queries the response was YES. [2022-12-06 00:09:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178478 conditions, 13142 events. 8125/13142 cut-off events. For 419355/419355 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 94219 event pairs, 335 based on Foata normal form. 42/13184 useless extension candidates. Maximal degree in co-relation 177442. Up to 12568 conditions per place. [2022-12-06 00:09:37,279 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 1008 selfloop transitions, 166 changer transitions 24/1198 dead transitions. [2022-12-06 00:09:37,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1198 transitions, 45776 flow [2022-12-06 00:09:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:09:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:09:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 00:09:37,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30319148936170215 [2022-12-06 00:09:37,281 INFO L175 Difference]: Start difference. First operand has 214 places, 1177 transitions, 43324 flow. Second operand 8 states and 114 transitions. [2022-12-06 00:09:37,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1198 transitions, 45776 flow [2022-12-06 00:09:43,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1198 transitions, 45693 flow, removed 34 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:43,827 INFO L231 Difference]: Finished difference. Result has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:43,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=42889, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1006, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=42283, PETRI_PLACES=220, PETRI_TRANSITIONS=1152} [2022-12-06 00:09:43,828 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 172 predicate places. [2022-12-06 00:09:43,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:43,829 INFO L89 Accepts]: Start accepts. Operand has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:43,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:43,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:43,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:43,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:44,980 INFO L130 PetriNetUnfolder]: 2191/4390 cut-off events. [2022-12-06 00:09:44,980 INFO L131 PetriNetUnfolder]: For 183069/191741 co-relation queries the response was YES. [2022-12-06 00:09:45,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67876 conditions, 4390 events. 2191/4390 cut-off events. For 183069/191741 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 36217 event pairs, 51 based on Foata normal form. 15/4390 useless extension candidates. Maximal degree in co-relation 67533. Up to 1868 conditions per place. [2022-12-06 00:09:45,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:45,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 4038 [2022-12-06 00:09:45,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:45,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1240 [2022-12-06 00:09:45,069 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 1152 transitions, 42283 flow [2022-12-06 00:09:45,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:45,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:45,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 00:09:45,069 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:09:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1765973004, now seen corresponding path program 5 times [2022-12-06 00:09:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365191533] [2022-12-06 00:09:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:45,190 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 00:09:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365191533] [2022-12-06 00:09:45,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365191533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:45,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:45,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:09:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279398759] [2022-12-06 00:09:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:45,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:09:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:09:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:09:45,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:09:45,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1152 transitions, 42283 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:45,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:45,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:09:45,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:49,738 INFO L130 PetriNetUnfolder]: 8097/13120 cut-off events. [2022-12-06 00:09:49,738 INFO L131 PetriNetUnfolder]: For 426668/426668 co-relation queries the response was YES. [2022-12-06 00:09:49,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177556 conditions, 13120 events. 8097/13120 cut-off events. For 426668/426668 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 94339 event pairs, 328 based on Foata normal form. 60/13180 useless extension candidates. Maximal degree in co-relation 176491. Up to 12530 conditions per place. [2022-12-06 00:09:49,880 INFO L137 encePairwiseOnDemand]: 22/47 looper letters, 1019 selfloop transitions, 165 changer transitions 22/1206 dead transitions. [2022-12-06 00:09:49,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1206 transitions, 45621 flow [2022-12-06 00:09:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:09:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:09:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2022-12-06 00:09:49,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2688588007736944 [2022-12-06 00:09:49,881 INFO L175 Difference]: Start difference. First operand has 220 places, 1152 transitions, 42283 flow. Second operand 11 states and 139 transitions. [2022-12-06 00:09:49,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1206 transitions, 45621 flow [2022-12-06 00:09:56,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 1206 transitions, 45514 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:56,193 INFO L231 Difference]: Finished difference. Result has 229 places, 1145 transitions, 42249 flow [2022-12-06 00:09:56,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=41940, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=42249, PETRI_PLACES=229, PETRI_TRANSITIONS=1145} [2022-12-06 00:09:56,194 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 181 predicate places. [2022-12-06 00:09:56,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:56,194 INFO L89 Accepts]: Start accepts. Operand has 229 places, 1145 transitions, 42249 flow [2022-12-06 00:09:56,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:56,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:56,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 1145 transitions, 42249 flow [2022-12-06 00:09:56,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 1145 transitions, 42249 flow [2022-12-06 00:09:57,372 INFO L130 PetriNetUnfolder]: 2177/4377 cut-off events. [2022-12-06 00:09:57,372 INFO L131 PetriNetUnfolder]: For 182120/189458 co-relation queries the response was YES. [2022-12-06 00:09:57,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67769 conditions, 4377 events. 2177/4377 cut-off events. For 182120/189458 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 36196 event pairs, 51 based on Foata normal form. 14/4378 useless extension candidates. Maximal degree in co-relation 67425. Up to 1862 conditions per place. [2022-12-06 00:09:57,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 1145 transitions, 42249 flow [2022-12-06 00:09:57,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 4024 [2022-12-06 00:09:57,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] $Ultimate##0-->thread5EXIT: Formula: (and (= (+ v_~s~0_674 1) v_~s~0_673) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| 0)) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|) (= v_~t~0_287 (+ v_~t~0_288 1)) (= |v_thread5Thread1of1ForFork0_#res#1.offset_31| 0) (= v_~t~0_288 v_~m3~0_123) (= |v_thread5Thread1of1ForFork0_#res#1.base_31| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65| (ite (<= v_~m5~0_124 v_~s~0_674) 1 0)) (= (ite (= (ite (or (= v_~x~0_264 1) (not (= 0 (mod v_~b~0_402 256)))) 1 0) 0) 0 1) v_~b~0_401)) InVars {~b~0=v_~b~0_402, ~m5~0=v_~m5~0_124, ~x~0=v_~x~0_264, ~s~0=v_~s~0_674, ~t~0=v_~t~0_288} OutVars{~m3~0=v_~m3~0_123, thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_73|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_65|, ~b~0=v_~b~0_401, ~m5~0=v_~m5~0_124, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_31|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_31|, ~x~0=v_~x~0_264, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_25|, ~s~0=v_~s~0_673, ~t~0=v_~t~0_287} AuxVars[] AssignedVars[~m3~0, thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_#t~post5#1, ~s~0, ~t~0] and [614] L45-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_107 v_~s~0_583) 1 0)) (= |v_thread4Thread1of1ForFork3_#res#1.base_33| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_19| 0) (= v_~b~0_331 1) (= |v_thread1Thread1of1ForFork2_#res#1.offset_19| 0) (= (+ 2 v_~s~0_583) v_~s~0_581) (= |v_thread4Thread1of1ForFork3_#res#1.offset_33| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m4~0_81 v_~s~0_583) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|) (= v_~x~0_214 0) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45| 0))) InVars {~m4~0=v_~m4~0_81, ~m1~0=v_~m1~0_107, ~s~0=v_~s~0_583} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_33|, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_49|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_45|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_45|, ~b~0=v_~b~0_331, ~m4~0=v_~m4~0_81, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~m1~0=v_~m1~0_107, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_49|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_19|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_19|, ~x~0=v_~x~0_214, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, ~s~0=v_~s~0_581, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_33|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork2_#t~post2#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post8#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~x~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork3_#res#1.offset] [2022-12-06 00:09:57,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:57,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1422 [2022-12-06 00:09:57,616 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 1144 transitions, 42233 flow [2022-12-06 00:09:57,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:57,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:57,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:09:57,616 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:09:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 814119185, now seen corresponding path program 1 times [2022-12-06 00:09:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:57,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543400923] [2022-12-06 00:09:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:57,754 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 00:09:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:57,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543400923] [2022-12-06 00:09:57,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543400923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:57,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:57,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:09:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151399556] [2022-12-06 00:09:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:57,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:09:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:09:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:09:57,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:09:57,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1144 transitions, 42233 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:57,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:09:57,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:02,303 INFO L130 PetriNetUnfolder]: 8054/13029 cut-off events. [2022-12-06 00:10:02,303 INFO L131 PetriNetUnfolder]: For 423737/423737 co-relation queries the response was YES. [2022-12-06 00:10:02,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176474 conditions, 13029 events. 8054/13029 cut-off events. For 423737/423737 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 93283 event pairs, 318 based on Foata normal form. 2/13031 useless extension candidates. Maximal degree in co-relation 175548. Up to 8047 conditions per place. [2022-12-06 00:10:02,601 INFO L137 encePairwiseOnDemand]: 20/45 looper letters, 617 selfloop transitions, 571 changer transitions 3/1191 dead transitions. [2022-12-06 00:10:02,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1191 transitions, 45141 flow [2022-12-06 00:10:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 00:10:02,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2022-12-06 00:10:02,603 INFO L175 Difference]: Start difference. First operand has 228 places, 1144 transitions, 42233 flow. Second operand 8 states and 131 transitions. [2022-12-06 00:10:02,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1191 transitions, 45141 flow [2022-12-06 00:10:09,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1191 transitions, 44895 flow, removed 61 selfloop flow, removed 4 redundant places. [2022-12-06 00:10:09,293 INFO L231 Difference]: Finished difference. Result has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:09,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=41963, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43027, PETRI_PLACES=231, PETRI_TRANSITIONS=1140} [2022-12-06 00:10:09,294 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 183 predicate places. [2022-12-06 00:10:09,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:09,295 INFO L89 Accepts]: Start accepts. Operand has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:09,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:09,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:09,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:09,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:10,590 INFO L130 PetriNetUnfolder]: 2176/4368 cut-off events. [2022-12-06 00:10:10,590 INFO L131 PetriNetUnfolder]: For 189924/198463 co-relation queries the response was YES. [2022-12-06 00:10:10,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69239 conditions, 4368 events. 2176/4368 cut-off events. For 189924/198463 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 36036 event pairs, 51 based on Foata normal form. 13/4366 useless extension candidates. Maximal degree in co-relation 68901. Up to 1860 conditions per place. [2022-12-06 00:10:10,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:10,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 4014 [2022-12-06 00:10:10,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:10,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1381 [2022-12-06 00:10:10,676 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1140 transitions, 43027 flow [2022-12-06 00:10:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:10,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:10,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 00:10:10,677 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:10:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 631034444, now seen corresponding path program 1 times [2022-12-06 00:10:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:10,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165103470] [2022-12-06 00:10:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:10,778 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 00:10:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:10,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165103470] [2022-12-06 00:10:10,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165103470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:10,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:10,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:10:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381691574] [2022-12-06 00:10:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:10,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:10:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:10:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:10:10,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:10:10,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1140 transitions, 43027 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:10,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:10:10,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:15,769 INFO L130 PetriNetUnfolder]: 8054/13029 cut-off events. [2022-12-06 00:10:15,769 INFO L131 PetriNetUnfolder]: For 442277/442277 co-relation queries the response was YES. [2022-12-06 00:10:15,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180158 conditions, 13029 events. 8054/13029 cut-off events. For 442277/442277 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 93300 event pairs, 349 based on Foata normal form. 2/13031 useless extension candidates. Maximal degree in co-relation 179014. Up to 12559 conditions per place. [2022-12-06 00:10:15,906 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 1009 selfloop transitions, 159 changer transitions 0/1168 dead transitions. [2022-12-06 00:10:15,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 1168 transitions, 45739 flow [2022-12-06 00:10:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-06 00:10:15,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26944444444444443 [2022-12-06 00:10:15,907 INFO L175 Difference]: Start difference. First operand has 231 places, 1140 transitions, 43027 flow. Second operand 8 states and 97 transitions. [2022-12-06 00:10:15,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 1168 transitions, 45739 flow [2022-12-06 00:10:21,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1168 transitions, 45577 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:21,425 INFO L231 Difference]: Finished difference. Result has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:21,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=42815, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43352, PETRI_PLACES=236, PETRI_TRANSITIONS=1143} [2022-12-06 00:10:21,426 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 188 predicate places. [2022-12-06 00:10:21,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:21,426 INFO L89 Accepts]: Start accepts. Operand has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:21,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:21,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:21,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:21,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:22,589 INFO L130 PetriNetUnfolder]: 2176/4375 cut-off events. [2022-12-06 00:10:22,589 INFO L131 PetriNetUnfolder]: For 191804/199418 co-relation queries the response was YES. [2022-12-06 00:10:22,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68970 conditions, 4375 events. 2176/4375 cut-off events. For 191804/199418 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 36208 event pairs, 57 based on Foata normal form. 13/4375 useless extension candidates. Maximal degree in co-relation 68628. Up to 1862 conditions per place. [2022-12-06 00:10:22,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:22,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 4020 [2022-12-06 00:10:22,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:22,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1243 [2022-12-06 00:10:22,669 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 1143 transitions, 43352 flow [2022-12-06 00:10:22,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:22,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:22,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 00:10:22,669 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:10:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash 327551396, now seen corresponding path program 1 times [2022-12-06 00:10:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:22,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422399120] [2022-12-06 00:10:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:22,790 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 00:10:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422399120] [2022-12-06 00:10:22,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422399120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:22,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:22,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:10:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959284517] [2022-12-06 00:10:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:22,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:10:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:10:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:10:22,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:10:22,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1143 transitions, 43352 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:22,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:10:22,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:27,306 INFO L130 PetriNetUnfolder]: 8058/13041 cut-off events. [2022-12-06 00:10:27,306 INFO L131 PetriNetUnfolder]: For 445034/445034 co-relation queries the response was YES. [2022-12-06 00:10:27,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179464 conditions, 13041 events. 8058/13041 cut-off events. For 445034/445034 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 93538 event pairs, 342 based on Foata normal form. 2/13043 useless extension candidates. Maximal degree in co-relation 178216. Up to 13016 conditions per place. [2022-12-06 00:10:27,434 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 1136 selfloop transitions, 15 changer transitions 9/1160 dead transitions. [2022-12-06 00:10:27,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1160 transitions, 45883 flow [2022-12-06 00:10:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-06 00:10:27,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-06 00:10:27,435 INFO L175 Difference]: Start difference. First operand has 236 places, 1143 transitions, 43352 flow. Second operand 8 states and 66 transitions. [2022-12-06 00:10:27,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1160 transitions, 45883 flow [2022-12-06 00:10:33,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 1160 transitions, 45802 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:33,102 INFO L231 Difference]: Finished difference. Result has 246 places, 1143 transitions, 43316 flow [2022-12-06 00:10:33,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=43272, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43316, PETRI_PLACES=246, PETRI_TRANSITIONS=1143} [2022-12-06 00:10:33,103 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 198 predicate places. [2022-12-06 00:10:33,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:33,103 INFO L89 Accepts]: Start accepts. Operand has 246 places, 1143 transitions, 43316 flow [2022-12-06 00:10:33,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:33,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:33,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 1143 transitions, 43316 flow [2022-12-06 00:10:33,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 1143 transitions, 43316 flow [2022-12-06 00:10:34,311 INFO L130 PetriNetUnfolder]: 2175/4374 cut-off events. [2022-12-06 00:10:34,311 INFO L131 PetriNetUnfolder]: For 192621/203551 co-relation queries the response was YES. [2022-12-06 00:10:34,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68928 conditions, 4374 events. 2175/4374 cut-off events. For 192621/203551 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 36192 event pairs, 57 based on Foata normal form. 13/4371 useless extension candidates. Maximal degree in co-relation 68848. Up to 1862 conditions per place. [2022-12-06 00:10:34,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 1143 transitions, 43316 flow [2022-12-06 00:10:34,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 4020 [2022-12-06 00:10:34,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [658] $Ultimate##0-->L105: Formula: (and (= v_~t~0_361 (+ v_~t~0_363 4)) (= v_~t~0_363 v_~m2~0_145) (= v_~t~0_361 (+ v_~m3~0_139 3)) (= v_~t~0_361 (+ 2 v_~m5~0_132)) (= v_~t~0_361 (+ v_~m4~0_116 1))) InVars {~t~0=v_~t~0_363} OutVars{~m3~0=v_~m3~0_139, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_34|, ~m5~0=v_~m5~0_132, ~m4~0=v_~m4~0_116, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_49|, ~m2~0=v_~m2~0_145, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_38|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_41|, ~t~0=v_~t~0_361} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:10:34,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:10:34,628 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:10:34,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1525 [2022-12-06 00:10:34,629 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 1141 transitions, 43232 flow [2022-12-06 00:10:34,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:34,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:34,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:34,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:10:34,629 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:10:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2146382640, now seen corresponding path program 1 times [2022-12-06 00:10:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:34,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127639578] [2022-12-06 00:10:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:34,728 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 00:10:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:34,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127639578] [2022-12-06 00:10:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127639578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:34,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:34,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:10:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359520116] [2022-12-06 00:10:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:34,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:10:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:10:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:10:34,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:10:34,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1141 transitions, 43232 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:34,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:34,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:10:34,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:39,135 INFO L130 PetriNetUnfolder]: 8051/13024 cut-off events. [2022-12-06 00:10:39,135 INFO L131 PetriNetUnfolder]: For 443836/443836 co-relation queries the response was YES. [2022-12-06 00:10:39,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179175 conditions, 13024 events. 8051/13024 cut-off events. For 443836/443836 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 93324 event pairs, 339 based on Foata normal form. 2/13026 useless extension candidates. Maximal degree in co-relation 179078. Up to 12909 conditions per place. [2022-12-06 00:10:39,268 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 1124 selfloop transitions, 38 changer transitions 4/1166 dead transitions. [2022-12-06 00:10:39,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 1166 transitions, 45782 flow [2022-12-06 00:10:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-06 00:10:39,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23055555555555557 [2022-12-06 00:10:39,269 INFO L175 Difference]: Start difference. First operand has 240 places, 1141 transitions, 43232 flow. Second operand 8 states and 83 transitions. [2022-12-06 00:10:39,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 1166 transitions, 45782 flow [2022-12-06 00:10:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1166 transitions, 45724 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 00:10:44,801 INFO L231 Difference]: Finished difference. Result has 242 places, 1141 transitions, 43182 flow [2022-12-06 00:10:44,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=43176, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43182, PETRI_PLACES=242, PETRI_TRANSITIONS=1141} [2022-12-06 00:10:44,802 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 194 predicate places. [2022-12-06 00:10:44,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:44,802 INFO L89 Accepts]: Start accepts. Operand has 242 places, 1141 transitions, 43182 flow [2022-12-06 00:10:44,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:44,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:44,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 1141 transitions, 43182 flow [2022-12-06 00:10:44,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 1141 transitions, 43182 flow [2022-12-06 00:10:46,016 INFO L130 PetriNetUnfolder]: 2174/4369 cut-off events. [2022-12-06 00:10:46,016 INFO L131 PetriNetUnfolder]: For 192402/203402 co-relation queries the response was YES. [2022-12-06 00:10:46,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68826 conditions, 4369 events. 2174/4369 cut-off events. For 192402/203402 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 36164 event pairs, 53 based on Foata normal form. 13/4366 useless extension candidates. Maximal degree in co-relation 68482. Up to 1860 conditions per place. [2022-12-06 00:10:46,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 1141 transitions, 43182 flow [2022-12-06 00:10:46,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 4016 [2022-12-06 00:10:46,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_380 v_~m4~0_122) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_73| (ite (<= v_~m2~0_151 v_~s~0_720) 1 0)) (= v_~t~0_379 (+ v_~t~0_380 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_39| 0) (= (+ v_~s~0_720 1) v_~s~0_719) (= v_~b~0_443 (ite (= (ite (or (= v_~x~0_288 1) (not (= (mod v_~b~0_444 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork4_#res#1.base_39| 0) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_73| 0)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_73| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_73|)) InVars {~b~0=v_~b~0_444, ~m2~0=v_~m2~0_151, ~x~0=v_~x~0_288, ~s~0=v_~s~0_720, ~t~0=v_~t~0_380} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_73|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_39|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_73|, ~b~0=v_~b~0_443, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_38|, ~m4~0=v_~m4~0_122, ~m2~0=v_~m2~0_151, ~x~0=v_~x~0_288, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_73|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_39|, ~s~0=v_~s~0_719, ~t~0=v_~t~0_379} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:10:46,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] $Ultimate##0-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_71| 0)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_71| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_71|) (= (+ v_~s~0_716 1) v_~s~0_715) (= v_~t~0_375 (+ v_~t~0_376 4)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_71| (ite (<= v_~m2~0_149 v_~s~0_716) 1 0)) (= v_~t~0_375 (+ 2 v_~m5~0_138)) (= (+ v_~m3~0_145 3) v_~t~0_375) (= v_~b~0_439 (ite (= 0 (ite (or (not (= (mod v_~b~0_440 256) 0)) (= v_~x~0_286 1)) 1 0)) 0 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_37| 0) (= |v_thread2Thread1of1ForFork4_#res#1.base_37| 0) (= v_~t~0_376 v_~m2~0_149) (= v_~t~0_375 (+ v_~m4~0_120 1))) InVars {~b~0=v_~b~0_440, ~x~0=v_~x~0_286, ~s~0=v_~s~0_716, ~t~0=v_~t~0_376} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_71|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_37|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_36|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_71|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_42|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_37|, ~m3~0=v_~m3~0_145, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_71|, ~b~0=v_~b~0_439, ~m5~0=v_~m5~0_138, ~m4~0=v_~m4~0_120, ~m2~0=v_~m2~0_149, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_53|, ~x~0=v_~x~0_286, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_47|, ~s~0=v_~s~0_715, ~t~0=v_~t~0_375} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread4Thread1of1ForFork3_#t~post7#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork4_#res#1.base, ~m3~0, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m5~0, ~m4~0, ~m2~0, thread2Thread1of1ForFork4_#t~post3#1, thread3Thread1of1ForFork1_#t~post5#1, ~s~0, ~t~0] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:10:46,418 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:10:46,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1616 [2022-12-06 00:10:46,418 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 1139 transitions, 43086 flow [2022-12-06 00:10:46,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:46,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:46,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 00:10:46,419 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:10:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -352159154, now seen corresponding path program 1 times [2022-12-06 00:10:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:46,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369371570] [2022-12-06 00:10:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:46,519 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 00:10:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369371570] [2022-12-06 00:10:46,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369371570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:46,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:46,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:10:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079916649] [2022-12-06 00:10:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:46,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:10:46,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:10:46,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1139 transitions, 43086 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:46,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:10:46,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:50,827 INFO L130 PetriNetUnfolder]: 8045/13010 cut-off events. [2022-12-06 00:10:50,828 INFO L131 PetriNetUnfolder]: For 445312/445312 co-relation queries the response was YES. [2022-12-06 00:10:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178926 conditions, 13010 events. 8045/13010 cut-off events. For 445312/445312 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 93169 event pairs, 349 based on Foata normal form. 2/13012 useless extension candidates. Maximal degree in co-relation 177668. Up to 12710 conditions per place. [2022-12-06 00:10:50,960 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 1069 selfloop transitions, 86 changer transitions 3/1158 dead transitions. [2022-12-06 00:10:50,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1158 transitions, 45539 flow [2022-12-06 00:10:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:10:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:10:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 00:10:50,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3037037037037037 [2022-12-06 00:10:50,962 INFO L175 Difference]: Start difference. First operand has 240 places, 1139 transitions, 43086 flow. Second operand 6 states and 82 transitions. [2022-12-06 00:10:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 1158 transitions, 45539 flow [2022-12-06 00:10:56,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 1158 transitions, 45448 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:56,636 INFO L231 Difference]: Finished difference. Result has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:56,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=42995, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=43220, PETRI_PLACES=245, PETRI_TRANSITIONS=1138} [2022-12-06 00:10:56,637 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 197 predicate places. [2022-12-06 00:10:56,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:56,637 INFO L89 Accepts]: Start accepts. Operand has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:56,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:56,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:56,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:56,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:57,825 INFO L130 PetriNetUnfolder]: 2172/4364 cut-off events. [2022-12-06 00:10:57,825 INFO L131 PetriNetUnfolder]: For 193212/200844 co-relation queries the response was YES. [2022-12-06 00:10:57,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68859 conditions, 4364 events. 2172/4364 cut-off events. For 193212/200844 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 36059 event pairs, 58 based on Foata normal form. 13/4364 useless extension candidates. Maximal degree in co-relation 68513. Up to 1857 conditions per place. [2022-12-06 00:10:57,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:57,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 4010 [2022-12-06 00:10:57,902 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:57,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1265 [2022-12-06 00:10:57,903 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1138 transitions, 43220 flow [2022-12-06 00:10:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:57,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:57,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 00:10:57,903 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:10:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -567965792, now seen corresponding path program 2 times [2022-12-06 00:10:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160311139] [2022-12-06 00:10:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:57,996 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 00:10:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160311139] [2022-12-06 00:10:57,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160311139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:57,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:57,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:10:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093029517] [2022-12-06 00:10:57,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:57,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:10:57,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:10:57,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1138 transitions, 43220 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:57,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:10:57,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:02,415 INFO L130 PetriNetUnfolder]: 8044/13011 cut-off events. [2022-12-06 00:11:02,416 INFO L131 PetriNetUnfolder]: For 450776/450776 co-relation queries the response was YES. [2022-12-06 00:11:02,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179168 conditions, 13011 events. 8044/13011 cut-off events. For 450776/450776 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 93123 event pairs, 325 based on Foata normal form. 2/13013 useless extension candidates. Maximal degree in co-relation 177850. Up to 7595 conditions per place. [2022-12-06 00:11:02,550 INFO L137 encePairwiseOnDemand]: 21/45 looper letters, 502 selfloop transitions, 667 changer transitions 5/1174 dead transitions. [2022-12-06 00:11:02,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1174 transitions, 45987 flow [2022-12-06 00:11:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:11:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:11:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 00:11:02,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2022-12-06 00:11:02,551 INFO L175 Difference]: Start difference. First operand has 245 places, 1138 transitions, 43220 flow. Second operand 6 states and 103 transitions. [2022-12-06 00:11:02,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1174 transitions, 45987 flow [2022-12-06 00:11:07,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1174 transitions, 45858 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:08,016 INFO L231 Difference]: Finished difference. Result has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:08,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=43091, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=666, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=45560, PETRI_PLACES=250, PETRI_TRANSITIONS=1137} [2022-12-06 00:11:08,017 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 202 predicate places. [2022-12-06 00:11:08,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:08,017 INFO L89 Accepts]: Start accepts. Operand has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:08,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:08,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:08,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:08,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:09,367 INFO L130 PetriNetUnfolder]: 2171/4362 cut-off events. [2022-12-06 00:11:09,367 INFO L131 PetriNetUnfolder]: For 217168/226048 co-relation queries the response was YES. [2022-12-06 00:11:09,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72699 conditions, 4362 events. 2171/4362 cut-off events. For 217168/226048 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 35986 event pairs, 53 based on Foata normal form. 13/4360 useless extension candidates. Maximal degree in co-relation 72351. Up to 1857 conditions per place. [2022-12-06 00:11:09,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:09,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 4008 [2022-12-06 00:11:09,447 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:09,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1431 [2022-12-06 00:11:09,448 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 1137 transitions, 45560 flow [2022-12-06 00:11:09,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:09,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:09,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:09,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:11:09,449 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:11:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1562474006, now seen corresponding path program 1 times [2022-12-06 00:11:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:09,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877354494] [2022-12-06 00:11:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:09,578 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 00:11:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877354494] [2022-12-06 00:11:09,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877354494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:09,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:09,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:11:09,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636439744] [2022-12-06 00:11:09,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:09,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:11:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:11:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:11:09,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:11:09,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1137 transitions, 45560 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:09,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:09,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:11:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:14,038 INFO L130 PetriNetUnfolder]: 8037/12998 cut-off events. [2022-12-06 00:11:14,038 INFO L131 PetriNetUnfolder]: For 502311/502311 co-relation queries the response was YES. [2022-12-06 00:11:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188040 conditions, 12998 events. 8037/12998 cut-off events. For 502311/502311 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 93104 event pairs, 332 based on Foata normal form. 4/13002 useless extension candidates. Maximal degree in co-relation 186768. Up to 12870 conditions per place. [2022-12-06 00:11:14,167 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 1124 selfloop transitions, 36 changer transitions 3/1163 dead transitions. [2022-12-06 00:11:14,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1163 transitions, 48113 flow [2022-12-06 00:11:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:11:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:11:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-12-06 00:11:14,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20454545454545456 [2022-12-06 00:11:14,169 INFO L175 Difference]: Start difference. First operand has 250 places, 1137 transitions, 45560 flow. Second operand 9 states and 81 transitions. [2022-12-06 00:11:14,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 1163 transitions, 48113 flow [2022-12-06 00:11:19,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1163 transitions, 47642 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 00:11:19,755 INFO L231 Difference]: Finished difference. Result has 255 places, 1136 transitions, 45122 flow [2022-12-06 00:11:19,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=45097, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=45122, PETRI_PLACES=255, PETRI_TRANSITIONS=1136} [2022-12-06 00:11:19,757 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 207 predicate places. [2022-12-06 00:11:19,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:19,757 INFO L89 Accepts]: Start accepts. Operand has 255 places, 1136 transitions, 45122 flow [2022-12-06 00:11:19,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:19,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:19,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 1136 transitions, 45122 flow [2022-12-06 00:11:19,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 1136 transitions, 45122 flow [2022-12-06 00:11:20,965 INFO L130 PetriNetUnfolder]: 2171/4361 cut-off events. [2022-12-06 00:11:20,965 INFO L131 PetriNetUnfolder]: For 215981/225914 co-relation queries the response was YES. [2022-12-06 00:11:20,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71609 conditions, 4361 events. 2171/4361 cut-off events. For 215981/225914 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 36012 event pairs, 53 based on Foata normal form. 12/4357 useless extension candidates. Maximal degree in co-relation 71262. Up to 1857 conditions per place. [2022-12-06 00:11:21,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 1136 transitions, 45122 flow [2022-12-06 00:11:21,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 4006 [2022-12-06 00:11:21,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:11:21,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] $Ultimate##0-->L124: Formula: (and (= v_~t~0_335 (+ v_~t~0_337 3)) (= v_~t~0_335 (+ v_~m5~0_130 1)) (= v_~t~0_335 (+ v_~m3~0_129 2)) (= v_~t~0_337 v_~m2~0_135)) InVars {~t~0=v_~t~0_337} OutVars{~m3~0=v_~m3~0_129, ~m5~0=v_~m5~0_130, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_39|, ~m2~0=v_~m2~0_135, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_36|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_31|, ~t~0=v_~t~0_335} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [665] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_460 256) 0)) (= v_~x~0_294 1)) 1 0) 0) 0 1) v_~b~0_459) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_79| (ite (<= v_~m2~0_157 v_~s~0_736) 1 0)) (= (+ v_~s~0_736 1) v_~s~0_735) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_79| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_79|) (= |v_thread2Thread1of1ForFork4_#res#1.base_45| 0) (= v_~t~0_392 v_~m1~0_173) (= v_~t~0_391 (+ v_~t~0_392 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_45| 0) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_79| 0))) InVars {~b~0=v_~b~0_460, ~m2~0=v_~m2~0_157, ~x~0=v_~x~0_294, ~s~0=v_~s~0_736, ~t~0=v_~t~0_392} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_79|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_45|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_59|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_79|, ~b~0=v_~b~0_459, ~m2~0=v_~m2~0_157, ~m1~0=v_~m1~0_173, ~x~0=v_~x~0_294, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_79|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_45|, ~s~0=v_~s~0_735, ~t~0=v_~t~0_391} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m1~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:11:21,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_112 (+ v_~m3~0_131 1)) (= v_~t~0_343 v_~m2~0_137) (= v_~m3~0_131 (+ v_~t~0_343 1)) (= v_~t~0_341 (+ v_~m3~0_131 2))) InVars {~t~0=v_~t~0_343} OutVars{~m3~0=v_~m3~0_131, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_30|, ~m4~0=v_~m4~0_112, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_41|, ~m2~0=v_~m2~0_137, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_33|, ~t~0=v_~t~0_341} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:11:21,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_112 (+ v_~m3~0_131 1)) (= v_~t~0_343 v_~m2~0_137) (= v_~m3~0_131 (+ v_~t~0_343 1)) (= v_~t~0_341 (+ v_~m3~0_131 2))) InVars {~t~0=v_~t~0_343} OutVars{~m3~0=v_~m3~0_131, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_30|, ~m4~0=v_~m4~0_112, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_41|, ~m2~0=v_~m2~0_137, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_33|, ~t~0=v_~t~0_341} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:11:21,244 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:11:21,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1488 [2022-12-06 00:11:21,245 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 1134 transitions, 45098 flow [2022-12-06 00:11:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:21,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:21,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:11:21,245 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:11:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1935535563, now seen corresponding path program 2 times [2022-12-06 00:11:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:21,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921075761] [2022-12-06 00:11:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:21,353 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 00:11:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921075761] [2022-12-06 00:11:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921075761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:11:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879322443] [2022-12-06 00:11:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:11:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:11:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:11:21,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:11:21,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 1134 transitions, 45098 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:21,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:11:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:26,095 INFO L130 PetriNetUnfolder]: 8042/12993 cut-off events. [2022-12-06 00:11:26,095 INFO L131 PetriNetUnfolder]: For 482374/482374 co-relation queries the response was YES. [2022-12-06 00:11:26,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185698 conditions, 12993 events. 8042/12993 cut-off events. For 482374/482374 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 93239 event pairs, 157 based on Foata normal form. 2/12995 useless extension candidates. Maximal degree in co-relation 184403. Up to 4497 conditions per place. [2022-12-06 00:11:26,222 INFO L137 encePairwiseOnDemand]: 21/45 looper letters, 154 selfloop transitions, 1050 changer transitions 7/1211 dead transitions. [2022-12-06 00:11:26,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1211 transitions, 48242 flow [2022-12-06 00:11:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:11:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:11:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2022-12-06 00:11:26,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2022-12-06 00:11:26,224 INFO L175 Difference]: Start difference. First operand has 252 places, 1134 transitions, 45098 flow. Second operand 7 states and 151 transitions. [2022-12-06 00:11:26,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 1211 transitions, 48242 flow [2022-12-06 00:11:31,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 1211 transitions, 47456 flow, removed 42 selfloop flow, removed 9 redundant places. [2022-12-06 00:11:31,488 INFO L231 Difference]: Finished difference. Result has 251 places, 1136 transitions, 47638 flow [2022-12-06 00:11:31,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=44304, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=47638, PETRI_PLACES=251, PETRI_TRANSITIONS=1136} [2022-12-06 00:11:31,489 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 203 predicate places. [2022-12-06 00:11:31,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:31,490 INFO L89 Accepts]: Start accepts. Operand has 251 places, 1136 transitions, 47638 flow [2022-12-06 00:11:31,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:31,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:31,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 1136 transitions, 47638 flow [2022-12-06 00:11:31,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 1136 transitions, 47638 flow [2022-12-06 00:11:32,672 INFO L130 PetriNetUnfolder]: 2173/4350 cut-off events. [2022-12-06 00:11:32,672 INFO L131 PetriNetUnfolder]: For 246204/258271 co-relation queries the response was YES. [2022-12-06 00:11:32,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75735 conditions, 4350 events. 2173/4350 cut-off events. For 246204/258271 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 35842 event pairs, 51 based on Foata normal form. 18/4352 useless extension candidates. Maximal degree in co-relation 75399. Up to 1856 conditions per place. [2022-12-06 00:11:32,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 1136 transitions, 47638 flow [2022-12-06 00:11:32,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 4002 [2022-12-06 00:11:32,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L124: Formula: (and (= v_~t~0_311 (+ v_~t~0_313 2)) (= v_~t~0_313 v_~m2~0_125) (= v_~m5~0_126 (+ v_~t~0_313 1))) InVars {~t~0=v_~t~0_313} OutVars{~m5~0=v_~m5~0_126, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_29|, ~m2~0=v_~m2~0_125, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_32|, ~t~0=v_~t~0_311} AuxVars[] AssignedVars[~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [465] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_66 1) v_~t~0_65) (= v_~m4~0_7 v_~t~0_66)) InVars {~t~0=v_~t~0_66} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_65} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:11:32,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L124: Formula: (and (= v_~t~0_401 (+ v_~m3~0_153 3)) (= v_~m4~0_128 (+ v_~m3~0_153 1)) (= (+ v_~m3~0_153 2) v_~m5~0_144) (= (+ v_~t~0_403 1) v_~m3~0_153) (= v_~t~0_403 v_~m2~0_161)) InVars {~t~0=v_~t~0_403} OutVars{~m3~0=v_~m3~0_153, ~m5~0=v_~m5~0_144, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_44|, ~m4~0=v_~m4~0_128, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_59|, ~m2~0=v_~m2~0_161, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_48|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_53|, ~t~0=v_~t~0_401} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:11:32,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L124: Formula: (and (= v_~t~0_401 (+ v_~m3~0_153 3)) (= v_~m4~0_128 (+ v_~m3~0_153 1)) (= (+ v_~m3~0_153 2) v_~m5~0_144) (= (+ v_~t~0_403 1) v_~m3~0_153) (= v_~t~0_403 v_~m2~0_161)) InVars {~t~0=v_~t~0_403} OutVars{~m3~0=v_~m3~0_153, ~m5~0=v_~m5~0_144, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_44|, ~m4~0=v_~m4~0_128, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_59|, ~m2~0=v_~m2~0_161, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_48|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_53|, ~t~0=v_~t~0_401} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:11:32,888 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:11:32,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1398 [2022-12-06 00:11:32,888 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 1135 transitions, 47629 flow [2022-12-06 00:11:32,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:32,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:32,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 00:11:32,889 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:11:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 391859442, now seen corresponding path program 1 times [2022-12-06 00:11:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132361866] [2022-12-06 00:11:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:32,991 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 00:11:32,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132361866] [2022-12-06 00:11:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132361866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:32,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:32,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:11:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817507931] [2022-12-06 00:11:32,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:32,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:11:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:32,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:11:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:11:32,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:11:32,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1135 transitions, 47629 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:32,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:11:32,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:37,643 INFO L130 PetriNetUnfolder]: 8034/12973 cut-off events. [2022-12-06 00:11:37,643 INFO L131 PetriNetUnfolder]: For 571996/571996 co-relation queries the response was YES. [2022-12-06 00:11:37,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195961 conditions, 12973 events. 8034/12973 cut-off events. For 571996/571996 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 92580 event pairs, 345 based on Foata normal form. 2/12975 useless extension candidates. Maximal degree in co-relation 194477. Up to 12521 conditions per place. [2022-12-06 00:11:37,782 INFO L137 encePairwiseOnDemand]: 23/46 looper letters, 1010 selfloop transitions, 153 changer transitions 3/1166 dead transitions. [2022-12-06 00:11:37,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1166 transitions, 50234 flow [2022-12-06 00:11:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:11:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:11:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 00:11:37,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2907608695652174 [2022-12-06 00:11:37,783 INFO L175 Difference]: Start difference. First operand has 247 places, 1135 transitions, 47629 flow. Second operand 8 states and 107 transitions. [2022-12-06 00:11:37,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 1166 transitions, 50234 flow [2022-12-06 00:11:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1166 transitions, 48343 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-06 00:11:45,453 INFO L231 Difference]: Finished difference. Result has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:45,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=45719, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=46113, PETRI_PLACES=247, PETRI_TRANSITIONS=1134} [2022-12-06 00:11:45,454 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 199 predicate places. [2022-12-06 00:11:45,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:45,454 INFO L89 Accepts]: Start accepts. Operand has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:45,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:45,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:45,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:45,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:46,678 INFO L130 PetriNetUnfolder]: 2171/4346 cut-off events. [2022-12-06 00:11:46,679 INFO L131 PetriNetUnfolder]: For 222968/231085 co-relation queries the response was YES. [2022-12-06 00:11:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72621 conditions, 4346 events. 2171/4346 cut-off events. For 222968/231085 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 35756 event pairs, 56 based on Foata normal form. 14/4345 useless extension candidates. Maximal degree in co-relation 72287. Up to 1854 conditions per place. [2022-12-06 00:11:46,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:46,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 3998 [2022-12-06 00:11:46,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:46,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1305 [2022-12-06 00:11:46,759 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 1134 transitions, 46113 flow [2022-12-06 00:11:46,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:46,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:46,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:46,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 00:11:46,759 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:11:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash 716465534, now seen corresponding path program 1 times [2022-12-06 00:11:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403272600] [2022-12-06 00:11:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:46,865 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 00:11:46,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:46,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403272600] [2022-12-06 00:11:46,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403272600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:46,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:46,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:11:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842663146] [2022-12-06 00:11:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:46,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:11:46,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:46,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:11:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:11:46,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:11:46,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1134 transitions, 46113 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:46,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:46,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:11:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:51,688 INFO L130 PetriNetUnfolder]: 8028/12963 cut-off events. [2022-12-06 00:11:51,688 INFO L131 PetriNetUnfolder]: For 522090/522090 co-relation queries the response was YES. [2022-12-06 00:11:51,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188229 conditions, 12963 events. 8028/12963 cut-off events. For 522090/522090 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 92483 event pairs, 345 based on Foata normal form. 2/12965 useless extension candidates. Maximal degree in co-relation 186835. Up to 12517 conditions per place. [2022-12-06 00:11:51,835 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 1005 selfloop transitions, 148 changer transitions 2/1155 dead transitions. [2022-12-06 00:11:51,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1155 transitions, 48463 flow [2022-12-06 00:11:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:11:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:11:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-06 00:11:51,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-06 00:11:51,836 INFO L175 Difference]: Start difference. First operand has 247 places, 1134 transitions, 46113 flow. Second operand 8 states and 104 transitions. [2022-12-06 00:11:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 1155 transitions, 48463 flow [2022-12-06 00:11:59,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 1155 transitions, 48354 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:59,407 INFO L231 Difference]: Finished difference. Result has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:11:59,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=45975, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=46207, PETRI_PLACES=251, PETRI_TRANSITIONS=1131} [2022-12-06 00:11:59,408 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 203 predicate places. [2022-12-06 00:11:59,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:59,408 INFO L89 Accepts]: Start accepts. Operand has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:11:59,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:59,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:59,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:11:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:12:00,766 INFO L130 PetriNetUnfolder]: 2170/4343 cut-off events. [2022-12-06 00:12:00,766 INFO L131 PetriNetUnfolder]: For 224098/232203 co-relation queries the response was YES. [2022-12-06 00:12:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72654 conditions, 4343 events. 2170/4343 cut-off events. For 224098/232203 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 35729 event pairs, 55 based on Foata normal form. 19/4349 useless extension candidates. Maximal degree in co-relation 72320. Up to 1853 conditions per place. [2022-12-06 00:12:00,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:12:00,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 3992 [2022-12-06 00:12:00,848 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:12:00,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1441 [2022-12-06 00:12:00,849 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 1131 transitions, 46207 flow [2022-12-06 00:12:00,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:00,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:00,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:00,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 00:12:00,849 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:12:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 596701626, now seen corresponding path program 1 times [2022-12-06 00:12:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:00,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700865471] [2022-12-06 00:12:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:00,954 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 00:12:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700865471] [2022-12-06 00:12:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700865471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:00,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:00,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:12:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289315115] [2022-12-06 00:12:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:12:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:00,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:12:00,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:12:00,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:12:00,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1131 transitions, 46207 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:00,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:00,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:12:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:05,504 INFO L130 PetriNetUnfolder]: 8030/12969 cut-off events. [2022-12-06 00:12:05,505 INFO L131 PetriNetUnfolder]: For 524612/524612 co-relation queries the response was YES. [2022-12-06 00:12:05,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188521 conditions, 12969 events. 8030/12969 cut-off events. For 524612/524612 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 92538 event pairs, 345 based on Foata normal form. 2/12971 useless extension candidates. Maximal degree in co-relation 187045. Up to 12881 conditions per place. [2022-12-06 00:12:05,651 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 1116 selfloop transitions, 30 changer transitions 6/1152 dead transitions. [2022-12-06 00:12:05,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1152 transitions, 48777 flow [2022-12-06 00:12:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:12:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:12:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-06 00:12:05,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2360248447204969 [2022-12-06 00:12:05,652 INFO L175 Difference]: Start difference. First operand has 251 places, 1131 transitions, 46207 flow. Second operand 7 states and 76 transitions. [2022-12-06 00:12:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1152 transitions, 48777 flow [2022-12-06 00:12:13,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1152 transitions, 48694 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:12:13,925 INFO L231 Difference]: Finished difference. Result has 256 places, 1130 transitions, 46151 flow [2022-12-06 00:12:13,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=46125, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=46151, PETRI_PLACES=256, PETRI_TRANSITIONS=1130} [2022-12-06 00:12:13,927 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 208 predicate places. [2022-12-06 00:12:13,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:13,927 INFO L89 Accepts]: Start accepts. Operand has 256 places, 1130 transitions, 46151 flow [2022-12-06 00:12:13,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:13,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:13,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 1130 transitions, 46151 flow [2022-12-06 00:12:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 1130 transitions, 46151 flow [2022-12-06 00:12:15,255 INFO L130 PetriNetUnfolder]: 2170/4343 cut-off events. [2022-12-06 00:12:15,255 INFO L131 PetriNetUnfolder]: For 224392/232702 co-relation queries the response was YES. [2022-12-06 00:12:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72601 conditions, 4343 events. 2170/4343 cut-off events. For 224392/232702 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 35748 event pairs, 55 based on Foata normal form. 13/4342 useless extension candidates. Maximal degree in co-relation 72266. Up to 1853 conditions per place. [2022-12-06 00:12:15,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 1130 transitions, 46151 flow [2022-12-06 00:12:15,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 3990 [2022-12-06 00:12:15,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L45: Formula: (and (= v_~m3~0_155 (+ v_~t~0_409 1)) (= v_~t~0_407 (+ v_~m3~0_155 3)) (= (+ v_~m3~0_155 1) v_~m4~0_130) (= v_~t~0_409 v_~m2~0_163) (= v_~t~0_407 (+ 1 v_~m1~0_177))) InVars {~t~0=v_~t~0_409} OutVars{~m3~0=v_~m3~0_155, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_63|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_46|, ~m4~0=v_~m4~0_130, ~m1~0=v_~m1~0_177, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_61|, ~m2~0=v_~m2~0_163, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_55|, ~t~0=v_~t~0_407} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork2_#t~post1#1, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:12:15,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:15,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1496 [2022-12-06 00:12:15,423 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 1130 transitions, 46135 flow [2022-12-06 00:12:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:15,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:15,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:15,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:12:15,423 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:12:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -386652994, now seen corresponding path program 2 times [2022-12-06 00:12:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:15,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100117336] [2022-12-06 00:12:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:15,563 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 00:12:15,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:15,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100117336] [2022-12-06 00:12:15,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100117336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:15,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:15,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:12:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486976970] [2022-12-06 00:12:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:15,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:12:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:12:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:12:15,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:12:15,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 1130 transitions, 46135 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:15,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:15,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:12:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:20,460 INFO L130 PetriNetUnfolder]: 8031/12974 cut-off events. [2022-12-06 00:12:20,460 INFO L131 PetriNetUnfolder]: For 521697/521697 co-relation queries the response was YES. [2022-12-06 00:12:20,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188451 conditions, 12974 events. 8031/12974 cut-off events. For 521697/521697 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 92809 event pairs, 280 based on Foata normal form. 2/12976 useless extension candidates. Maximal degree in co-relation 186946. Up to 6102 conditions per place. [2022-12-06 00:12:20,620 INFO L137 encePairwiseOnDemand]: 20/46 looper letters, 476 selfloop transitions, 714 changer transitions 6/1196 dead transitions. [2022-12-06 00:12:20,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1196 transitions, 49050 flow [2022-12-06 00:12:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:12:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:12:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2022-12-06 00:12:20,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266304347826087 [2022-12-06 00:12:20,621 INFO L175 Difference]: Start difference. First operand has 255 places, 1130 transitions, 46135 flow. Second operand 8 states and 157 transitions. [2022-12-06 00:12:20,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1196 transitions, 49050 flow [2022-12-06 00:12:29,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1196 transitions, 48972 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 00:12:29,663 INFO L231 Difference]: Finished difference. Result has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:29,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=46050, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=709, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=48320, PETRI_PLACES=259, PETRI_TRANSITIONS=1131} [2022-12-06 00:12:29,664 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 211 predicate places. [2022-12-06 00:12:29,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:29,664 INFO L89 Accepts]: Start accepts. Operand has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:29,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:29,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:29,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:29,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:31,054 INFO L130 PetriNetUnfolder]: 2169/4343 cut-off events. [2022-12-06 00:12:31,055 INFO L131 PetriNetUnfolder]: For 242496/252989 co-relation queries the response was YES. [2022-12-06 00:12:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76261 conditions, 4343 events. 2169/4343 cut-off events. For 242496/252989 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 35711 event pairs, 55 based on Foata normal form. 17/4344 useless extension candidates. Maximal degree in co-relation 75925. Up to 1853 conditions per place. [2022-12-06 00:12:31,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:31,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 3992 [2022-12-06 00:12:31,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:12:31,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1480 [2022-12-06 00:12:31,144 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1131 transitions, 48320 flow [2022-12-06 00:12:31,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:31,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:31,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 00:12:31,145 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:12:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -509536889, now seen corresponding path program 1 times [2022-12-06 00:12:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120347605] [2022-12-06 00:12:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:31,251 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 00:12:31,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120347605] [2022-12-06 00:12:31,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120347605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:31,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:31,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:12:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099804712] [2022-12-06 00:12:31,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:31,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:12:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:31,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:12:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:12:31,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:12:31,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1131 transitions, 48320 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:31,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:12:31,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:36,633 INFO L130 PetriNetUnfolder]: 8022/12959 cut-off events. [2022-12-06 00:12:36,634 INFO L131 PetriNetUnfolder]: For 568956/568956 co-relation queries the response was YES. [2022-12-06 00:12:36,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197116 conditions, 12959 events. 8022/12959 cut-off events. For 568956/568956 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 92549 event pairs, 282 based on Foata normal form. 2/12961 useless extension candidates. Maximal degree in co-relation 195612. Up to 6100 conditions per place. [2022-12-06 00:12:36,774 INFO L137 encePairwiseOnDemand]: 20/46 looper letters, 476 selfloop transitions, 710 changer transitions 2/1188 dead transitions. [2022-12-06 00:12:36,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1188 transitions, 51131 flow [2022-12-06 00:12:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:12:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:12:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2022-12-06 00:12:36,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4157608695652174 [2022-12-06 00:12:36,775 INFO L175 Difference]: Start difference. First operand has 259 places, 1131 transitions, 48320 flow. Second operand 8 states and 153 transitions. [2022-12-06 00:12:36,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 1188 transitions, 51131 flow [2022-12-06 00:12:47,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1188 transitions, 49508 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 00:12:47,773 INFO L231 Difference]: Finished difference. Result has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:47,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=46697, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=710, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=48069, PETRI_PLACES=261, PETRI_TRANSITIONS=1129} [2022-12-06 00:12:47,774 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 213 predicate places. [2022-12-06 00:12:47,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:47,774 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:47,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:47,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:47,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:47,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:49,260 INFO L130 PetriNetUnfolder]: 2167/4340 cut-off events. [2022-12-06 00:12:49,260 INFO L131 PetriNetUnfolder]: For 228137/239195 co-relation queries the response was YES. [2022-12-06 00:12:49,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75662 conditions, 4340 events. 2167/4340 cut-off events. For 228137/239195 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 35685 event pairs, 55 based on Foata normal form. 18/4342 useless extension candidates. Maximal degree in co-relation 75328. Up to 1853 conditions per place. [2022-12-06 00:12:49,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:49,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 3984 [2022-12-06 00:12:49,352 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:12:49,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1578 [2022-12-06 00:12:49,352 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1129 transitions, 48069 flow [2022-12-06 00:12:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:49,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:49,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 00:12:49,353 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:12:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 691461273, now seen corresponding path program 2 times [2022-12-06 00:12:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652675896] [2022-12-06 00:12:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:49,486 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 00:12:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652675896] [2022-12-06 00:12:49,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652675896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:49,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:49,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:12:49,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663100442] [2022-12-06 00:12:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:49,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:12:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:12:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:12:49,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:12:49,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1129 transitions, 48069 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:49,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:49,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:12:49,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:55,504 INFO L130 PetriNetUnfolder]: 8016/12947 cut-off events. [2022-12-06 00:12:55,504 INFO L131 PetriNetUnfolder]: For 528005/528005 co-relation queries the response was YES. [2022-12-06 00:12:55,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195051 conditions, 12947 events. 8016/12947 cut-off events. For 528005/528005 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 92407 event pairs, 347 based on Foata normal form. 2/12949 useless extension candidates. Maximal degree in co-relation 193832. Up to 12499 conditions per place. [2022-12-06 00:12:55,702 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 1004 selfloop transitions, 144 changer transitions 3/1151 dead transitions. [2022-12-06 00:12:55,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1151 transitions, 50556 flow [2022-12-06 00:12:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:12:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:12:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-06 00:12:55,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.266304347826087 [2022-12-06 00:12:55,704 INFO L175 Difference]: Start difference. First operand has 261 places, 1129 transitions, 48069 flow. Second operand 8 states and 98 transitions. [2022-12-06 00:12:55,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1151 transitions, 50556 flow [2022-12-06 00:13:04,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1151 transitions, 50385 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:13:04,701 INFO L231 Difference]: Finished difference. Result has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:04,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=47868, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=48025, PETRI_PLACES=264, PETRI_TRANSITIONS=1125} [2022-12-06 00:13:04,702 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 216 predicate places. [2022-12-06 00:13:04,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:04,702 INFO L89 Accepts]: Start accepts. Operand has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:04,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:04,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:04,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:04,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:06,398 INFO L130 PetriNetUnfolder]: 2167/4337 cut-off events. [2022-12-06 00:13:06,399 INFO L131 PetriNetUnfolder]: For 228407/236207 co-relation queries the response was YES. [2022-12-06 00:13:06,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75388 conditions, 4337 events. 2167/4337 cut-off events. For 228407/236207 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 35689 event pairs, 55 based on Foata normal form. 18/4342 useless extension candidates. Maximal degree in co-relation 75055. Up to 1851 conditions per place. [2022-12-06 00:13:06,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:06,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 3972 [2022-12-06 00:13:06,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:06,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1805 [2022-12-06 00:13:06,507 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1125 transitions, 48025 flow [2022-12-06 00:13:06,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:06,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:06,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:06,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 00:13:06,508 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:13:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash -892602051, now seen corresponding path program 3 times [2022-12-06 00:13:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796003172] [2022-12-06 00:13:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:06,639 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 00:13:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:06,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796003172] [2022-12-06 00:13:06,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796003172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:06,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:06,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:13:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187075316] [2022-12-06 00:13:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:06,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:13:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:06,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:13:06,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:13:06,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:13:06,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1125 transitions, 48025 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:06,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:06,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:13:06,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:12,529 INFO L130 PetriNetUnfolder]: 8010/12935 cut-off events. [2022-12-06 00:13:12,529 INFO L131 PetriNetUnfolder]: For 528015/528015 co-relation queries the response was YES. [2022-12-06 00:13:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194287 conditions, 12935 events. 8010/12935 cut-off events. For 528015/528015 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 92228 event pairs, 345 based on Foata normal form. 4/12939 useless extension candidates. Maximal degree in co-relation 193258. Up to 12806 conditions per place. [2022-12-06 00:13:12,714 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 1105 selfloop transitions, 39 changer transitions 4/1148 dead transitions. [2022-12-06 00:13:12,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1148 transitions, 50586 flow [2022-12-06 00:13:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:13:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:13:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 00:13:12,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19806763285024154 [2022-12-06 00:13:12,716 INFO L175 Difference]: Start difference. First operand has 264 places, 1125 transitions, 48025 flow. Second operand 9 states and 82 transitions. [2022-12-06 00:13:12,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1148 transitions, 50586 flow [2022-12-06 00:13:19,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 1148 transitions, 50510 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:13:19,676 INFO L231 Difference]: Finished difference. Result has 272 places, 1122 transitions, 47810 flow [2022-12-06 00:13:19,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=47949, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1086, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=47810, PETRI_PLACES=272, PETRI_TRANSITIONS=1122} [2022-12-06 00:13:19,677 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-06 00:13:19,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:19,677 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1122 transitions, 47810 flow [2022-12-06 00:13:19,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:19,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:19,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1122 transitions, 47810 flow [2022-12-06 00:13:19,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1122 transitions, 47810 flow [2022-12-06 00:13:20,896 INFO L130 PetriNetUnfolder]: 2166/4333 cut-off events. [2022-12-06 00:13:20,896 INFO L131 PetriNetUnfolder]: For 228507/236085 co-relation queries the response was YES. [2022-12-06 00:13:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75247 conditions, 4333 events. 2166/4333 cut-off events. For 228507/236085 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 35623 event pairs, 55 based on Foata normal form. 15/4335 useless extension candidates. Maximal degree in co-relation 74912. Up to 1849 conditions per place. [2022-12-06 00:13:20,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1122 transitions, 47810 flow [2022-12-06 00:13:20,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 3962 [2022-12-06 00:13:21,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:13:21,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res#1.base_49| 0) (= (ite (= (ite (or (= v_~x~0_298 1) (not (= (mod v_~b~0_468 256) 0))) 1 0) 0) 0 1) v_~b~0_467) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_83| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_83|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_49| 0) (= v_~t~0_419 (+ v_~m3~0_157 3)) (= (+ v_~t~0_420 1) v_~m3~0_157) (= (+ v_~m3~0_157 2) v_~m5~0_148) (= v_~m4~0_134 (+ v_~m3~0_157 1)) (= v_~t~0_420 v_~m2~0_167) (= (+ v_~s~0_744 1) v_~s~0_743) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_83| (ite (<= v_~m2~0_167 v_~s~0_744) 1 0))) InVars {~b~0=v_~b~0_468, ~x~0=v_~x~0_298, ~s~0=v_~s~0_744, ~t~0=v_~t~0_420} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_83|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_49|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_50|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_83|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_52|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_49|, ~m3~0=v_~m3~0_157, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_83|, ~b~0=v_~b~0_467, ~m5~0=v_~m5~0_148, ~m4~0=v_~m4~0_134, ~m2~0=v_~m2~0_167, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_65|, ~x~0=v_~x~0_298, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_57|, ~s~0=v_~s~0_743, ~t~0=v_~t~0_419} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread4Thread1of1ForFork3_#t~post7#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork4_#res#1.base, ~m3~0, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m5~0, ~m4~0, ~m2~0, thread2Thread1of1ForFork4_#t~post3#1, thread3Thread1of1ForFork1_#t~post5#1, ~s~0, ~t~0] and [585] L86-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_25| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_25| 0) (= (ite (= (ite (or (= v_~x~0_139 1) (not (= (mod v_~b~0_214 256) 0))) 1 0) 0) 0 1) v_~b~0_213) (= (ite (<= v_~m3~0_73 v_~s~0_452) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= (+ v_~s~0_452 1) v_~s~0_451)) InVars {~m3~0=v_~m3~0_73, ~b~0=v_~b~0_214, ~x~0=v_~x~0_139, ~s~0=v_~s~0_452} OutVars{~m3~0=v_~m3~0_73, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_25|, ~b~0=v_~b~0_213, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_25|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_45|, ~x~0=v_~x~0_139, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0] [2022-12-06 00:13:21,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [673] L67-->thread3EXIT: Formula: (and (= v_~s~0_751 (+ 2 v_~s~0_753)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_87| (ite (<= v_~m2~0_173 v_~s~0_753) 1 0)) (= v_~b~0_475 (ite (= (ite (let ((.cse0 (= v_~x~0_302 1))) (or .cse0 (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_477 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_47| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_87| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_87|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_53| 0) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_87| 0)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (= (ite (<= (+ v_~m3~0_163 1) v_~s~0_751) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= |v_thread3Thread1of1ForFork1_#res#1.base_47| 0) (= |v_thread2Thread1of1ForFork4_#res#1.base_53| 0)) InVars {~m3~0=v_~m3~0_163, ~b~0=v_~b~0_477, ~m2~0=v_~m2~0_173, ~x~0=v_~x~0_302, ~s~0=v_~s~0_753} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_87|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_53|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_67|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_87|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_53|, ~m3~0=v_~m3~0_163, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_47|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_87|, ~b~0=v_~b~0_475, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_47|, ~m2~0=v_~m2~0_173, ~x~0=v_~x~0_302, ~s~0=v_~s~0_751} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:13:21,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L45: Formula: (and (= v_~m3~0_155 (+ v_~t~0_409 1)) (= v_~t~0_407 (+ v_~m3~0_155 3)) (= (+ v_~m3~0_155 1) v_~m4~0_130) (= v_~t~0_409 v_~m2~0_163) (= v_~t~0_407 (+ 1 v_~m1~0_177))) InVars {~t~0=v_~t~0_409} OutVars{~m3~0=v_~m3~0_155, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_63|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_46|, ~m4~0=v_~m4~0_130, ~m1~0=v_~m1~0_177, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_61|, ~m2~0=v_~m2~0_163, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_55|, ~t~0=v_~t~0_407} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork2_#t~post1#1, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, ~m1~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [675] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_91| 0)) (= v_~b~0_487 (ite (= (ite (let ((.cse0 (= v_~x~0_306 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_488 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= v_~t~0_437 (+ v_~t~0_438 1)) (= v_~t~0_438 v_~m5~0_154) (= (ite (<= v_~m2~0_177 v_~s~0_764) 1 0) |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_91|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_51| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_51| 0) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_91| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_91|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_57| 0) (= |v_thread2Thread1of1ForFork4_#res#1.base_57| 0) (= v_~s~0_763 (+ 2 v_~s~0_764)) (= (ite (<= (+ v_~m3~0_167 1) v_~s~0_763) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|)) InVars {~m3~0=v_~m3~0_167, ~b~0=v_~b~0_488, ~m2~0=v_~m2~0_177, ~x~0=v_~x~0_306, ~s~0=v_~s~0_764, ~t~0=v_~t~0_438} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_91|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_57|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_71|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_91|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_58|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_57|, ~m3~0=v_~m3~0_167, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_51|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_91|, ~b~0=v_~b~0_487, ~m5~0=v_~m5~0_154, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_51|, ~m2~0=v_~m2~0_177, ~x~0=v_~x~0_306, ~s~0=v_~s~0_763, ~t~0=v_~t~0_437} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m5~0, thread3Thread1of1ForFork1_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:13:21,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_307 1) v_~m4~0_108) (= v_~t~0_307 v_~m2~0_123) (= v_~t~0_305 (+ v_~t~0_307 2))) InVars {~t~0=v_~t~0_307} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_26|, ~m4~0=v_~m4~0_108, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_27|, ~m2~0=v_~m2~0_123, ~t~0=v_~t~0_305} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [471] $Ultimate##0-->L124: Formula: (and (= v_~m5~0_9 v_~t~0_58) (= (+ v_~t~0_58 1) v_~t~0_57)) InVars {~t~0=v_~t~0_58} OutVars{~m5~0=v_~m5~0_9, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_1|, ~t~0=v_~t~0_57} AuxVars[] AssignedVars[~m5~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] [2022-12-06 00:13:21,755 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:13:21,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2079 [2022-12-06 00:13:21,756 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1119 transitions, 47664 flow [2022-12-06 00:13:21,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:21,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:21,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:21,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 00:13:21,757 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:13:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 80729826, now seen corresponding path program 3 times [2022-12-06 00:13:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266707541] [2022-12-06 00:13:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:21,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 00:13:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:21,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266707541] [2022-12-06 00:13:21,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266707541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:21,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:21,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:13:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053565135] [2022-12-06 00:13:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:21,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:13:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:13:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:13:21,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:13:21,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1119 transitions, 47664 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:21,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:21,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:13:21,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:26,791 INFO L130 PetriNetUnfolder]: 7998/12907 cut-off events. [2022-12-06 00:13:26,792 INFO L131 PetriNetUnfolder]: For 528078/528078 co-relation queries the response was YES. [2022-12-06 00:13:26,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193691 conditions, 12907 events. 7998/12907 cut-off events. For 528078/528078 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 91943 event pairs, 345 based on Foata normal form. 4/12911 useless extension candidates. Maximal degree in co-relation 193028. Up to 12761 conditions per place. [2022-12-06 00:13:26,931 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 1096 selfloop transitions, 42 changer transitions 6/1144 dead transitions. [2022-12-06 00:13:26,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1144 transitions, 50217 flow [2022-12-06 00:13:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:13:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:13:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-12-06 00:13:26,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19148936170212766 [2022-12-06 00:13:26,932 INFO L175 Difference]: Start difference. First operand has 268 places, 1119 transitions, 47664 flow. Second operand 9 states and 81 transitions. [2022-12-06 00:13:26,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1144 transitions, 50217 flow [2022-12-06 00:13:33,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1144 transitions, 49983 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-12-06 00:13:33,645 INFO L231 Difference]: Finished difference. Result has 269 places, 1115 transitions, 47285 flow [2022-12-06 00:13:33,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=47435, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=47285, PETRI_PLACES=269, PETRI_TRANSITIONS=1115} [2022-12-06 00:13:33,647 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 221 predicate places. [2022-12-06 00:13:33,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:33,647 INFO L89 Accepts]: Start accepts. Operand has 269 places, 1115 transitions, 47285 flow [2022-12-06 00:13:33,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:33,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:33,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 1115 transitions, 47285 flow [2022-12-06 00:13:33,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 1115 transitions, 47285 flow [2022-12-06 00:13:35,064 INFO L130 PetriNetUnfolder]: 2164/4325 cut-off events. [2022-12-06 00:13:35,065 INFO L131 PetriNetUnfolder]: For 226112/234186 co-relation queries the response was YES. [2022-12-06 00:13:35,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75019 conditions, 4325 events. 2164/4325 cut-off events. For 226112/234186 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 35529 event pairs, 55 based on Foata normal form. 14/4325 useless extension candidates. Maximal degree in co-relation 74684. Up to 1845 conditions per place. [2022-12-06 00:13:35,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 1115 transitions, 47285 flow [2022-12-06 00:13:35,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 3944 [2022-12-06 00:13:35,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] $Ultimate##0-->L105: Formula: (and (= v_~t~0_415 v_~m2~0_165) (= v_~t~0_413 (+ v_~t~0_415 3)) (= v_~m4~0_132 (+ v_~t~0_415 2)) (= (+ v_~t~0_415 1) v_~m5~0_146)) InVars {~t~0=v_~t~0_415} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_48|, ~m5~0=v_~m5~0_146, ~m4~0=v_~m4~0_132, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_63|, ~m2~0=v_~m2~0_165, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_50|, ~t~0=v_~t~0_413} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:13:35,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (+ v_~m3~0_169 1))) (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_53| 0) (= v_~t~0_441 (+ 2 v_~m1~0_183)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77| (ite (<= .cse0 v_~s~0_767) 1 0)) (= (+ v_~t~0_443 1) v_~m3~0_169) (= (+ v_~m3~0_169 2) v_~m1~0_183) (= |v_thread2Thread1of1ForFork4_#res#1.base_59| 0) (= .cse0 v_~m4~0_142) (= v_~s~0_767 (+ 2 v_~s~0_768)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_59| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_53| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_93| (ite (<= v_~m2~0_179 v_~s~0_768) 1 0)) (= v_~t~0_443 v_~m2~0_179) (= (+ 1 v_~m1~0_183) v_~m5~0_156) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_93| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_93|) (= (ite (= (ite (let ((.cse1 (= v_~x~0_308 1))) (or .cse1 (not (= (mod (ite (= (ite (or .cse1 (not (= (mod v_~b~0_492 256) 0))) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1) v_~b~0_491) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_77|))) InVars {~b~0=v_~b~0_492, ~x~0=v_~x~0_308, ~s~0=v_~s~0_768, ~t~0=v_~t~0_443} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_93|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_59|, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_58|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_77|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_73|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_93|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_60|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_59|, ~m3~0=v_~m3~0_169, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_53|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_69|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_93|, ~b~0=v_~b~0_491, ~m5~0=v_~m5~0_156, ~m4~0=v_~m4~0_142, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_53|, ~m2~0=v_~m2~0_179, ~m1~0=v_~m1~0_183, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_73|, ~x~0=v_~x~0_308, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_65|, ~s~0=v_~s~0_767, ~t~0=v_~t~0_441} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread4Thread1of1ForFork3_#t~post7#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork4_#res#1.base, ~m3~0, thread3Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m5~0, ~m4~0, thread3Thread1of1ForFork1_#res#1.base, ~m2~0, ~m1~0, thread2Thread1of1ForFork4_#t~post3#1, thread3Thread1of1ForFork1_#t~post5#1, ~s~0, ~t~0] and [606] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res#1.offset_27| 0) (= |v_thread4Thread1of1ForFork3_#res#1.base_27| 0) (= (+ v_~s~0_530 1) v_~s~0_529) (not (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| 0)) (= (ite (<= v_~m4~0_73 v_~s~0_530) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|) (= v_~b~0_283 (ite (= (ite (or (not (= (mod v_~b~0_284 256) 0)) (= v_~x~0_182 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|)) InVars {~b~0=v_~b~0_284, ~m4~0=v_~m4~0_73, ~x~0=v_~x~0_182, ~s~0=v_~s~0_530} OutVars{thread4Thread1of1ForFork3_#res#1.base=|v_thread4Thread1of1ForFork3_#res#1.base_27|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_39|, ~b~0=v_~b~0_283, ~m4~0=v_~m4~0_73, thread4Thread1of1ForFork3_#t~post8#1=|v_thread4Thread1of1ForFork3_#t~post8#1_43|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_39|, ~x~0=v_~x~0_182, thread4Thread1of1ForFork3_#res#1.offset=|v_thread4Thread1of1ForFork3_#res#1.offset_27|, ~s~0=v_~s~0_529} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res#1.base, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread4Thread1of1ForFork3_#t~post8#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#res#1.offset, ~s~0] [2022-12-06 00:13:35,541 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:13:35,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1894 [2022-12-06 00:13:35,541 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1114 transitions, 47246 flow [2022-12-06 00:13:35,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:35,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:35,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:35,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 00:13:35,542 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:13:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1055310682, now seen corresponding path program 1 times [2022-12-06 00:13:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:35,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367402947] [2022-12-06 00:13:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:35,624 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 00:13:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367402947] [2022-12-06 00:13:35,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367402947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:35,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:35,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601896156] [2022-12-06 00:13:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:35,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:35,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:13:35,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1114 transitions, 47246 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:35,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:35,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:13:35,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:40,026 INFO L130 PetriNetUnfolder]: 7992/12893 cut-off events. [2022-12-06 00:13:40,026 INFO L131 PetriNetUnfolder]: For 524254/524254 co-relation queries the response was YES. [2022-12-06 00:13:40,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193317 conditions, 12893 events. 7992/12893 cut-off events. For 524254/524254 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 91835 event pairs, 347 based on Foata normal form. 4/12897 useless extension candidates. Maximal degree in co-relation 192710. Up to 12788 conditions per place. [2022-12-06 00:13:40,165 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 1088 selfloop transitions, 36 changer transitions 1/1125 dead transitions. [2022-12-06 00:13:40,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1125 transitions, 49629 flow [2022-12-06 00:13:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 00:13:40,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3404255319148936 [2022-12-06 00:13:40,165 INFO L175 Difference]: Start difference. First operand has 264 places, 1114 transitions, 47246 flow. Second operand 4 states and 64 transitions. [2022-12-06 00:13:40,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1125 transitions, 49629 flow [2022-12-06 00:13:46,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1125 transitions, 48464 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-12-06 00:13:46,488 INFO L231 Difference]: Finished difference. Result has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:46,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=46081, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46152, PETRI_PLACES=258, PETRI_TRANSITIONS=1113} [2022-12-06 00:13:46,489 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 210 predicate places. [2022-12-06 00:13:46,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:46,489 INFO L89 Accepts]: Start accepts. Operand has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:46,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:46,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:46,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:46,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:47,813 INFO L130 PetriNetUnfolder]: 2163/4323 cut-off events. [2022-12-06 00:13:47,814 INFO L131 PetriNetUnfolder]: For 225612/234487 co-relation queries the response was YES. [2022-12-06 00:13:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73408 conditions, 4323 events. 2163/4323 cut-off events. For 225612/234487 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 35544 event pairs, 56 based on Foata normal form. 14/4321 useless extension candidates. Maximal degree in co-relation 73075. Up to 1845 conditions per place. [2022-12-06 00:13:47,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:47,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 3940 [2022-12-06 00:13:47,898 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:47,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1410 [2022-12-06 00:13:47,899 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 1113 transitions, 46152 flow [2022-12-06 00:13:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:47,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:47,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:47,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 00:13:47,899 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:13:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1613626079, now seen corresponding path program 1 times [2022-12-06 00:13:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408067204] [2022-12-06 00:13:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:47,986 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 00:13:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:47,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408067204] [2022-12-06 00:13:47,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408067204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:47,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:47,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:13:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236780985] [2022-12-06 00:13:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:47,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:13:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:13:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:13:47,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:13:47,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1113 transitions, 46152 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:47,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:47,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:13:47,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:52,537 INFO L130 PetriNetUnfolder]: 8025/12952 cut-off events. [2022-12-06 00:13:52,537 INFO L131 PetriNetUnfolder]: For 525778/525778 co-relation queries the response was YES. [2022-12-06 00:13:52,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190291 conditions, 12952 events. 8025/12952 cut-off events. For 525778/525778 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 92363 event pairs, 333 based on Foata normal form. 2/12954 useless extension candidates. Maximal degree in co-relation 188315. Up to 7548 conditions per place. [2022-12-06 00:13:52,667 INFO L137 encePairwiseOnDemand]: 21/46 looper letters, 494 selfloop transitions, 660 changer transitions 9/1163 dead transitions. [2022-12-06 00:13:52,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1163 transitions, 49335 flow [2022-12-06 00:13:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:13:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:13:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 00:13:52,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-06 00:13:52,668 INFO L175 Difference]: Start difference. First operand has 258 places, 1113 transitions, 46152 flow. Second operand 6 states and 104 transitions. [2022-12-06 00:13:52,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1163 transitions, 49335 flow [2022-12-06 00:13:58,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 1163 transitions, 49259 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:58,781 INFO L231 Difference]: Finished difference. Result has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:13:58,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=46062, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=649, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=48801, PETRI_PLACES=263, PETRI_TRANSITIONS=1121} [2022-12-06 00:13:58,782 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 215 predicate places. [2022-12-06 00:13:58,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:58,782 INFO L89 Accepts]: Start accepts. Operand has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:13:58,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:58,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:58,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:13:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:14:00,192 INFO L130 PetriNetUnfolder]: 2166/4332 cut-off events. [2022-12-06 00:14:00,193 INFO L131 PetriNetUnfolder]: For 253820/262205 co-relation queries the response was YES. [2022-12-06 00:14:00,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77482 conditions, 4332 events. 2166/4332 cut-off events. For 253820/262205 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 35641 event pairs, 56 based on Foata normal form. 15/4332 useless extension candidates. Maximal degree in co-relation 77147. Up to 1849 conditions per place. [2022-12-06 00:14:00,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:14:00,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 3956 [2022-12-06 00:14:00,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:00,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1500 [2022-12-06 00:14:00,282 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1121 transitions, 48801 flow [2022-12-06 00:14:00,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:00,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:00,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:00,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 00:14:00,282 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:14:00,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 141325364, now seen corresponding path program 2 times [2022-12-06 00:14:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:00,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369479598] [2022-12-06 00:14:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,383 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 00:14:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369479598] [2022-12-06 00:14:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369479598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:00,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:00,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913271123] [2022-12-06 00:14:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:00,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:14:00,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:14:00,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1121 transitions, 48801 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:00,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:00,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:14:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:05,139 INFO L130 PetriNetUnfolder]: 8009/12924 cut-off events. [2022-12-06 00:14:05,139 INFO L131 PetriNetUnfolder]: For 579639/579639 co-relation queries the response was YES. [2022-12-06 00:14:05,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199135 conditions, 12924 events. 8009/12924 cut-off events. For 579639/579639 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 92086 event pairs, 347 based on Foata normal form. 2/12926 useless extension candidates. Maximal degree in co-relation 197214. Up to 12829 conditions per place. [2022-12-06 00:14:05,384 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 1098 selfloop transitions, 34 changer transitions 5/1137 dead transitions. [2022-12-06 00:14:05,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1137 transitions, 51256 flow [2022-12-06 00:14:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:14:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:14:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-06 00:14:05,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-06 00:14:05,385 INFO L175 Difference]: Start difference. First operand has 263 places, 1121 transitions, 48801 flow. Second operand 7 states and 70 transitions. [2022-12-06 00:14:05,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1137 transitions, 51256 flow [2022-12-06 00:14:12,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1137 transitions, 50607 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:14:12,557 INFO L231 Difference]: Finished difference. Result has 268 places, 1120 transitions, 48078 flow [2022-12-06 00:14:12,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=48153, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1087, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=48078, PETRI_PLACES=268, PETRI_TRANSITIONS=1120} [2022-12-06 00:14:12,558 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 220 predicate places. [2022-12-06 00:14:12,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:12,558 INFO L89 Accepts]: Start accepts. Operand has 268 places, 1120 transitions, 48078 flow [2022-12-06 00:14:12,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:12,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:12,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 1120 transitions, 48078 flow [2022-12-06 00:14:12,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 1120 transitions, 48078 flow [2022-12-06 00:14:13,905 INFO L130 PetriNetUnfolder]: 2166/4330 cut-off events. [2022-12-06 00:14:13,905 INFO L131 PetriNetUnfolder]: For 245660/254009 co-relation queries the response was YES. [2022-12-06 00:14:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76446 conditions, 4330 events. 2166/4330 cut-off events. For 245660/254009 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 35557 event pairs, 56 based on Foata normal form. 14/4330 useless extension candidates. Maximal degree in co-relation 76109. Up to 1847 conditions per place. [2022-12-06 00:14:13,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 1120 transitions, 48078 flow [2022-12-06 00:14:13,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 3954 [2022-12-06 00:14:13,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_449 1) v_~m4~0_144) (= v_~t~0_447 (+ v_~m5~0_158 1)) (= v_~t~0_449 v_~m2~0_181) (= (+ v_~t~0_449 2) v_~m5~0_158)) InVars {~t~0=v_~t~0_449} OutVars{~m5~0=v_~m5~0_158, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_60|, ~m4~0=v_~m4~0_144, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_75|, ~m2~0=v_~m2~0_181, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_62|, ~t~0=v_~t~0_447} AuxVars[] AssignedVars[~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:14:14,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:14,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1503 [2022-12-06 00:14:14,061 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 1120 transitions, 48062 flow [2022-12-06 00:14:14,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:14,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:14,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:14,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 00:14:14,062 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:14:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -146486517, now seen corresponding path program 3 times [2022-12-06 00:14:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:14,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293534054] [2022-12-06 00:14:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:14,177 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 00:14:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:14,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293534054] [2022-12-06 00:14:14,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293534054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:14,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:14,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:14:14,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765565206] [2022-12-06 00:14:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:14:14,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:14:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:14:14,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:14:14,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1120 transitions, 48062 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:14,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:14,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:14:14,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:19,721 INFO L130 PetriNetUnfolder]: 7993/12908 cut-off events. [2022-12-06 00:14:19,721 INFO L131 PetriNetUnfolder]: For 564306/564306 co-relation queries the response was YES. [2022-12-06 00:14:19,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196547 conditions, 12908 events. 7993/12908 cut-off events. For 564306/564306 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 92177 event pairs, 348 based on Foata normal form. 24/12932 useless extension candidates. Maximal degree in co-relation 195666. Up to 12509 conditions per place. [2022-12-06 00:14:19,919 INFO L137 encePairwiseOnDemand]: 23/45 looper letters, 1023 selfloop transitions, 122 changer transitions 12/1157 dead transitions. [2022-12-06 00:14:19,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1157 transitions, 50779 flow [2022-12-06 00:14:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:14:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:14:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-12-06 00:14:19,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2383838383838384 [2022-12-06 00:14:19,922 INFO L175 Difference]: Start difference. First operand has 267 places, 1120 transitions, 48062 flow. Second operand 11 states and 118 transitions. [2022-12-06 00:14:19,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1157 transitions, 50779 flow [2022-12-06 00:14:27,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 1157 transitions, 50376 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 00:14:27,891 INFO L231 Difference]: Finished difference. Result has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:27,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=47580, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=47327, PETRI_PLACES=272, PETRI_TRANSITIONS=1111} [2022-12-06 00:14:27,892 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-06 00:14:27,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:27,892 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:27,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:27,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:27,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:27,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:29,168 INFO L130 PetriNetUnfolder]: 2157/4309 cut-off events. [2022-12-06 00:14:29,168 INFO L131 PetriNetUnfolder]: For 241809/250015 co-relation queries the response was YES. [2022-12-06 00:14:29,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75854 conditions, 4309 events. 2157/4309 cut-off events. For 241809/250015 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 35372 event pairs, 58 based on Foata normal form. 15/4309 useless extension candidates. Maximal degree in co-relation 75520. Up to 1840 conditions per place. [2022-12-06 00:14:29,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:29,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 3932 [2022-12-06 00:14:29,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:29,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1362 [2022-12-06 00:14:29,254 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 1111 transitions, 47327 flow [2022-12-06 00:14:29,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:29,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:29,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:29,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 00:14:29,254 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:14:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1243336270, now seen corresponding path program 1 times [2022-12-06 00:14:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:29,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345321075] [2022-12-06 00:14:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:29,342 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 00:14:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345321075] [2022-12-06 00:14:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345321075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540649682] [2022-12-06 00:14:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:29,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:14:29,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:14:29,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1111 transitions, 47327 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:29,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:29,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:14:29,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:33,889 INFO L130 PetriNetUnfolder]: 7750/12681 cut-off events. [2022-12-06 00:14:33,889 INFO L131 PetriNetUnfolder]: For 574231/574231 co-relation queries the response was YES. [2022-12-06 00:14:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192017 conditions, 12681 events. 7750/12681 cut-off events. For 574231/574231 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 92295 event pairs, 267 based on Foata normal form. 378/13059 useless extension candidates. Maximal degree in co-relation 191155. Up to 5392 conditions per place. [2022-12-06 00:14:34,030 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 351 selfloop transitions, 828 changer transitions 27/1206 dead transitions. [2022-12-06 00:14:34,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1206 transitions, 52534 flow [2022-12-06 00:14:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2022-12-06 00:14:34,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 00:14:34,031 INFO L175 Difference]: Start difference. First operand has 272 places, 1111 transitions, 47327 flow. Second operand 8 states and 154 transitions. [2022-12-06 00:14:34,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1206 transitions, 52534 flow [2022-12-06 00:14:40,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 1206 transitions, 52165 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-12-06 00:14:40,998 INFO L231 Difference]: Finished difference. Result has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:40,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=46103, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=766, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=50073, PETRI_PLACES=268, PETRI_TRANSITIONS=1126} [2022-12-06 00:14:40,999 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 220 predicate places. [2022-12-06 00:14:40,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:40,999 INFO L89 Accepts]: Start accepts. Operand has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:41,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:41,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:41,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:42,304 INFO L130 PetriNetUnfolder]: 2038/4202 cut-off events. [2022-12-06 00:14:42,304 INFO L131 PetriNetUnfolder]: For 242816/251549 co-relation queries the response was YES. [2022-12-06 00:14:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76554 conditions, 4202 events. 2038/4202 cut-off events. For 242816/251549 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 35405 event pairs, 57 based on Foata normal form. 13/4202 useless extension candidates. Maximal degree in co-relation 76215. Up to 1811 conditions per place. [2022-12-06 00:14:42,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:42,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 3934 [2022-12-06 00:14:42,401 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:42,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1403 [2022-12-06 00:14:42,402 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1126 transitions, 50073 flow [2022-12-06 00:14:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:42,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:42,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:42,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 00:14:42,408 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:14:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash -436067158, now seen corresponding path program 1 times [2022-12-06 00:14:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:42,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660918881] [2022-12-06 00:14:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:42,509 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 00:14:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660918881] [2022-12-06 00:14:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660918881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:42,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:42,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614799603] [2022-12-06 00:14:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:42,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:14:42,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:14:42,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1126 transitions, 50073 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:42,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:42,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:14:42,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:47,437 INFO L130 PetriNetUnfolder]: 7647/12536 cut-off events. [2022-12-06 00:14:47,437 INFO L131 PetriNetUnfolder]: For 548274/548274 co-relation queries the response was YES. [2022-12-06 00:14:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195750 conditions, 12536 events. 7647/12536 cut-off events. For 548274/548274 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 91283 event pairs, 327 based on Foata normal form. 28/12564 useless extension candidates. Maximal degree in co-relation 194935. Up to 12174 conditions per place. [2022-12-06 00:14:47,589 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 1027 selfloop transitions, 94 changer transitions 20/1141 dead transitions. [2022-12-06 00:14:47,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 1141 transitions, 52235 flow [2022-12-06 00:14:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 00:14:47,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:14:47,590 INFO L175 Difference]: Start difference. First operand has 268 places, 1126 transitions, 50073 flow. Second operand 8 states and 96 transitions. [2022-12-06 00:14:47,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 1141 transitions, 52235 flow [2022-12-06 00:14:55,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1141 transitions, 51649 flow, removed 109 selfloop flow, removed 3 redundant places. [2022-12-06 00:14:55,672 INFO L231 Difference]: Finished difference. Result has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:55,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=49211, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=48063, PETRI_PLACES=272, PETRI_TRANSITIONS=1103} [2022-12-06 00:14:55,674 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-06 00:14:55,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:55,674 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:55,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:55,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:55,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:57,058 INFO L130 PetriNetUnfolder]: 2028/4171 cut-off events. [2022-12-06 00:14:57,058 INFO L131 PetriNetUnfolder]: For 236488/244585 co-relation queries the response was YES. [2022-12-06 00:14:57,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74426 conditions, 4171 events. 2028/4171 cut-off events. For 236488/244585 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 34904 event pairs, 57 based on Foata normal form. 14/4171 useless extension candidates. Maximal degree in co-relation 74087. Up to 1798 conditions per place. [2022-12-06 00:14:57,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:57,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 3872 [2022-12-06 00:14:57,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:57,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1475 [2022-12-06 00:14:57,149 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 1103 transitions, 48063 flow [2022-12-06 00:14:57,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:57,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:57,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:57,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 00:14:57,150 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:14:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash 686037616, now seen corresponding path program 2 times [2022-12-06 00:14:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:57,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798847563] [2022-12-06 00:14:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:57,267 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 00:14:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:57,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798847563] [2022-12-06 00:14:57,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798847563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:57,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:57,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:14:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919432419] [2022-12-06 00:14:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:57,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:14:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:14:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:14:57,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:14:57,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1103 transitions, 48063 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:14:57,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:57,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:14:57,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:02,034 INFO L130 PetriNetUnfolder]: 7561/12396 cut-off events. [2022-12-06 00:15:02,034 INFO L131 PetriNetUnfolder]: For 536949/536949 co-relation queries the response was YES. [2022-12-06 00:15:02,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189915 conditions, 12396 events. 7561/12396 cut-off events. For 536949/536949 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 90075 event pairs, 314 based on Foata normal form. 56/12452 useless extension candidates. Maximal degree in co-relation 189180. Up to 12093 conditions per place. [2022-12-06 00:15:02,175 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 1018 selfloop transitions, 72 changer transitions 38/1128 dead transitions. [2022-12-06 00:15:02,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1128 transitions, 50125 flow [2022-12-06 00:15:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:15:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:15:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2022-12-06 00:15:02,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24586776859504134 [2022-12-06 00:15:02,176 INFO L175 Difference]: Start difference. First operand has 272 places, 1103 transitions, 48063 flow. Second operand 11 states and 119 transitions. [2022-12-06 00:15:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1128 transitions, 50125 flow [2022-12-06 00:15:10,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1128 transitions, 49944 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-12-06 00:15:10,343 INFO L231 Difference]: Finished difference. Result has 273 places, 1068 transitions, 46080 flow [2022-12-06 00:15:10,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=47372, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1090, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=46080, PETRI_PLACES=273, PETRI_TRANSITIONS=1068} [2022-12-06 00:15:10,345 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 225 predicate places. [2022-12-06 00:15:10,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:10,345 INFO L89 Accepts]: Start accepts. Operand has 273 places, 1068 transitions, 46080 flow [2022-12-06 00:15:10,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:10,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:10,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 1068 transitions, 46080 flow [2022-12-06 00:15:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1068 transitions, 46080 flow [2022-12-06 00:15:11,658 INFO L130 PetriNetUnfolder]: 1997/4112 cut-off events. [2022-12-06 00:15:11,659 INFO L131 PetriNetUnfolder]: For 229519/237811 co-relation queries the response was YES. [2022-12-06 00:15:11,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73141 conditions, 4112 events. 1997/4112 cut-off events. For 229519/237811 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 34419 event pairs, 54 based on Foata normal form. 15/4113 useless extension candidates. Maximal degree in co-relation 72842. Up to 1776 conditions per place. [2022-12-06 00:15:11,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1068 transitions, 46080 flow [2022-12-06 00:15:11,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 3778 [2022-12-06 00:15:11,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:15:11,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:15:11,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:15:11,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] $Ultimate##0-->L105: Formula: (and (= v_~t~0_415 v_~m2~0_165) (= v_~t~0_413 (+ v_~t~0_415 3)) (= v_~m4~0_132 (+ v_~t~0_415 2)) (= (+ v_~t~0_415 1) v_~m5~0_146)) InVars {~t~0=v_~t~0_415} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_48|, ~m5~0=v_~m5~0_146, ~m4~0=v_~m4~0_132, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_63|, ~m2~0=v_~m2~0_165, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_50|, ~t~0=v_~t~0_413} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [682] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_101| (ite (<= v_~m2~0_189 v_~s~0_786) 1 0)) (= v_~t~0_471 (+ v_~t~0_472 1)) (= |v_thread2Thread1of1ForFork4_#res#1.base_67| 0) (= v_~t~0_472 v_~m1~0_189) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_101|)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_67| 0) (= v_~b~0_509 (ite (= (ite (or (= v_~x~0_316 1) (not (= (mod v_~b~0_510 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_101| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_101|) (= (+ v_~s~0_786 1) v_~s~0_785)) InVars {~b~0=v_~b~0_510, ~m2~0=v_~m2~0_189, ~x~0=v_~x~0_316, ~s~0=v_~s~0_786, ~t~0=v_~t~0_472} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_101|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_67|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_75|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_101|, ~b~0=v_~b~0_509, ~m2~0=v_~m2~0_189, ~m1~0=v_~m1~0_189, ~x~0=v_~x~0_316, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_67|, ~s~0=v_~s~0_785, ~t~0=v_~t~0_471} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m1~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:15:11,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_449 1) v_~m4~0_144) (= v_~t~0_447 (+ v_~m5~0_158 1)) (= v_~t~0_449 v_~m2~0_181) (= (+ v_~t~0_449 2) v_~m5~0_158)) InVars {~t~0=v_~t~0_449} OutVars{~m5~0=v_~m5~0_158, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_60|, ~m4~0=v_~m4~0_144, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_75|, ~m2~0=v_~m2~0_181, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_62|, ~t~0=v_~t~0_447} AuxVars[] AssignedVars[~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [683] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_476 v_~m1~0_191) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_103|)) (= |v_thread2Thread1of1ForFork4_#res#1.base_69| 0) (= v_~b~0_513 (ite (= (ite (or (= v_~x~0_318 1) (not (= (mod v_~b~0_514 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_103|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_69| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_103| (ite (<= v_~m2~0_191 v_~s~0_790) 1 0)) (= (+ v_~s~0_790 1) v_~s~0_789) (= v_~t~0_475 (+ v_~t~0_476 1))) InVars {~b~0=v_~b~0_514, ~m2~0=v_~m2~0_191, ~x~0=v_~x~0_318, ~s~0=v_~s~0_790, ~t~0=v_~t~0_476} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_103|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_69|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_77|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_103|, ~b~0=v_~b~0_513, ~m2~0=v_~m2~0_191, ~m1~0=v_~m1~0_191, ~x~0=v_~x~0_318, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_69|, ~s~0=v_~s~0_789, ~t~0=v_~t~0_475} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m1~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:15:12,030 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:15:12,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1685 [2022-12-06 00:15:12,030 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 1067 transitions, 46067 flow [2022-12-06 00:15:12,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:12,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:12,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:15:12,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 00:15:12,031 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:15:12,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1037374462, now seen corresponding path program 2 times [2022-12-06 00:15:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:12,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105544709] [2022-12-06 00:15:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:12,133 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 00:15:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:12,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105544709] [2022-12-06 00:15:12,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105544709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:15:12,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:15:12,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:15:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066710793] [2022-12-06 00:15:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:15:12,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:15:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:15:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:15:12,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:15:12,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1067 transitions, 46067 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:12,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:12,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:15:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:16,774 INFO L130 PetriNetUnfolder]: 7539/12356 cut-off events. [2022-12-06 00:15:16,775 INFO L131 PetriNetUnfolder]: For 515837/515837 co-relation queries the response was YES. [2022-12-06 00:15:16,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188575 conditions, 12356 events. 7539/12356 cut-off events. For 515837/515837 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 89819 event pairs, 141 based on Foata normal form. 2/12358 useless extension candidates. Maximal degree in co-relation 187871. Up to 4281 conditions per place. [2022-12-06 00:15:16,924 INFO L137 encePairwiseOnDemand]: 21/47 looper letters, 148 selfloop transitions, 992 changer transitions 9/1149 dead transitions. [2022-12-06 00:15:16,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1149 transitions, 49281 flow [2022-12-06 00:15:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:15:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:15:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-12-06 00:15:16,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 00:15:16,925 INFO L175 Difference]: Start difference. First operand has 271 places, 1067 transitions, 46067 flow. Second operand 7 states and 147 transitions. [2022-12-06 00:15:16,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1149 transitions, 49281 flow [2022-12-06 00:15:24,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1149 transitions, 48941 flow, removed 88 selfloop flow, removed 11 redundant places. [2022-12-06 00:15:24,807 INFO L231 Difference]: Finished difference. Result has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:24,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=45727, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=981, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49908, PETRI_PLACES=270, PETRI_TRANSITIONS=1079} [2022-12-06 00:15:24,808 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 222 predicate places. [2022-12-06 00:15:24,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:24,808 INFO L89 Accepts]: Start accepts. Operand has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:24,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:24,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:24,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:24,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:26,280 INFO L130 PetriNetUnfolder]: 2000/4135 cut-off events. [2022-12-06 00:15:26,281 INFO L131 PetriNetUnfolder]: For 265415/275792 co-relation queries the response was YES. [2022-12-06 00:15:26,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79719 conditions, 4135 events. 2000/4135 cut-off events. For 265415/275792 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 34673 event pairs, 52 based on Foata normal form. 14/4134 useless extension candidates. Maximal degree in co-relation 79389. Up to 1783 conditions per place. [2022-12-06 00:15:26,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:26,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 3798 [2022-12-06 00:15:26,381 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:15:26,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1573 [2022-12-06 00:15:26,381 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 1079 transitions, 49908 flow [2022-12-06 00:15:26,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:26,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:26,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:15:26,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 00:15:26,382 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:15:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1460223630, now seen corresponding path program 1 times [2022-12-06 00:15:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007377311] [2022-12-06 00:15:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:26,503 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 00:15:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:26,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007377311] [2022-12-06 00:15:26,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007377311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:15:26,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:15:26,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:15:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078781264] [2022-12-06 00:15:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:15:26,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:15:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:15:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:15:26,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:15:26,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1079 transitions, 49908 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:26,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:26,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:15:26,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:33,016 INFO L130 PetriNetUnfolder]: 7522/12321 cut-off events. [2022-12-06 00:15:33,016 INFO L131 PetriNetUnfolder]: For 607503/607503 co-relation queries the response was YES. [2022-12-06 00:15:33,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203755 conditions, 12321 events. 7522/12321 cut-off events. For 607503/607503 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 89165 event pairs, 261 based on Foata normal form. 2/12323 useless extension candidates. Maximal degree in co-relation 203112. Up to 5361 conditions per place. [2022-12-06 00:15:33,174 INFO L137 encePairwiseOnDemand]: 21/47 looper letters, 349 selfloop transitions, 779 changer transitions 4/1132 dead transitions. [2022-12-06 00:15:33,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1132 transitions, 52591 flow [2022-12-06 00:15:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:15:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:15:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2022-12-06 00:15:33,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4095744680851064 [2022-12-06 00:15:33,175 INFO L175 Difference]: Start difference. First operand has 270 places, 1079 transitions, 49908 flow. Second operand 8 states and 154 transitions. [2022-12-06 00:15:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1132 transitions, 52591 flow [2022-12-06 00:15:43,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1132 transitions, 52178 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-06 00:15:43,444 INFO L231 Difference]: Finished difference. Result has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:43,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=49489, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=779, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=50973, PETRI_PLACES=273, PETRI_TRANSITIONS=1075} [2022-12-06 00:15:43,445 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 225 predicate places. [2022-12-06 00:15:43,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:43,445 INFO L89 Accepts]: Start accepts. Operand has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:43,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:43,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:43,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:43,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:44,960 INFO L130 PetriNetUnfolder]: 1998/4134 cut-off events. [2022-12-06 00:15:44,960 INFO L131 PetriNetUnfolder]: For 267417/276915 co-relation queries the response was YES. [2022-12-06 00:15:44,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81182 conditions, 4134 events. 1998/4134 cut-off events. For 267417/276915 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 34694 event pairs, 55 based on Foata normal form. 14/4135 useless extension candidates. Maximal degree in co-relation 80854. Up to 1780 conditions per place. [2022-12-06 00:15:45,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:45,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 3790 [2022-12-06 00:15:45,055 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:15:45,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1611 [2022-12-06 00:15:45,056 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1075 transitions, 50973 flow [2022-12-06 00:15:45,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:45,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:45,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:15:45,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 00:15:45,056 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:15:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 501145609, now seen corresponding path program 1 times [2022-12-06 00:15:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:45,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133793804] [2022-12-06 00:15:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:45,179 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 00:15:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:45,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133793804] [2022-12-06 00:15:45,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133793804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:15:45,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:15:45,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:15:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776312832] [2022-12-06 00:15:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:15:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:15:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:15:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:15:45,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:15:45,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1075 transitions, 50973 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:45,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:45,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:15:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:50,803 INFO L130 PetriNetUnfolder]: 7515/12308 cut-off events. [2022-12-06 00:15:50,803 INFO L131 PetriNetUnfolder]: For 615367/615367 co-relation queries the response was YES. [2022-12-06 00:15:50,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207173 conditions, 12308 events. 7515/12308 cut-off events. For 615367/615367 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 88986 event pairs, 317 based on Foata normal form. 2/12310 useless extension candidates. Maximal degree in co-relation 206570. Up to 12106 conditions per place. [2022-12-06 00:15:51,027 INFO L137 encePairwiseOnDemand]: 25/47 looper letters, 1019 selfloop transitions, 64 changer transitions 7/1090 dead transitions. [2022-12-06 00:15:51,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1090 transitions, 53154 flow [2022-12-06 00:15:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:15:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:15:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-12-06 00:15:51,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23138297872340424 [2022-12-06 00:15:51,029 INFO L175 Difference]: Start difference. First operand has 273 places, 1075 transitions, 50973 flow. Second operand 8 states and 87 transitions. [2022-12-06 00:15:51,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1090 transitions, 53154 flow [2022-12-06 00:16:02,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1090 transitions, 52230 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 00:16:02,992 INFO L231 Difference]: Finished difference. Result has 275 places, 1067 transitions, 49780 flow [2022-12-06 00:16:02,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=50013, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=49780, PETRI_PLACES=275, PETRI_TRANSITIONS=1067} [2022-12-06 00:16:02,994 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 227 predicate places. [2022-12-06 00:16:02,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:02,994 INFO L89 Accepts]: Start accepts. Operand has 275 places, 1067 transitions, 49780 flow [2022-12-06 00:16:03,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:03,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:03,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 1067 transitions, 49780 flow [2022-12-06 00:16:03,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 1067 transitions, 49780 flow [2022-12-06 00:16:04,770 INFO L130 PetriNetUnfolder]: 1996/4121 cut-off events. [2022-12-06 00:16:04,770 INFO L131 PetriNetUnfolder]: For 262663/270576 co-relation queries the response was YES. [2022-12-06 00:16:04,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79621 conditions, 4121 events. 1996/4121 cut-off events. For 262663/270576 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 34479 event pairs, 53 based on Foata normal form. 14/4122 useless extension candidates. Maximal degree in co-relation 79383. Up to 1776 conditions per place. [2022-12-06 00:16:04,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 1067 transitions, 49780 flow [2022-12-06 00:16:04,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 3774 [2022-12-06 00:16:04,883 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:04,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1890 [2022-12-06 00:16:04,884 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 1067 transitions, 49780 flow [2022-12-06 00:16:04,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:04,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:04,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:04,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 00:16:04,884 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:16:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -499225602, now seen corresponding path program 3 times [2022-12-06 00:16:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:04,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644492620] [2022-12-06 00:16:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:05,012 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 00:16:05,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644492620] [2022-12-06 00:16:05,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644492620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:05,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:05,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:16:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848243913] [2022-12-06 00:16:05,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:16:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:16:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:16:05,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:16:05,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1067 transitions, 49780 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:05,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:05,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:16:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:09,994 INFO L130 PetriNetUnfolder]: 7352/12201 cut-off events. [2022-12-06 00:16:09,995 INFO L131 PetriNetUnfolder]: For 652158/652158 co-relation queries the response was YES. [2022-12-06 00:16:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203833 conditions, 12201 events. 7352/12201 cut-off events. For 652158/652158 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 90170 event pairs, 321 based on Foata normal form. 366/12567 useless extension candidates. Maximal degree in co-relation 203332. Up to 6888 conditions per place. [2022-12-06 00:16:10,147 INFO L137 encePairwiseOnDemand]: 21/45 looper letters, 485 selfloop transitions, 669 changer transitions 41/1195 dead transitions. [2022-12-06 00:16:10,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1195 transitions, 58175 flow [2022-12-06 00:16:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:16:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:16:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-06 00:16:10,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 00:16:10,149 INFO L175 Difference]: Start difference. First operand has 274 places, 1067 transitions, 49780 flow. Second operand 8 states and 132 transitions. [2022-12-06 00:16:10,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1195 transitions, 58175 flow [2022-12-06 00:16:19,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 1195 transitions, 57216 flow, removed 13 selfloop flow, removed 12 redundant places. [2022-12-06 00:16:19,290 INFO L231 Difference]: Finished difference. Result has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:19,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=48350, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=576, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=54542, PETRI_PLACES=272, PETRI_TRANSITIONS=1115} [2022-12-06 00:16:19,292 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-06 00:16:19,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:19,292 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:19,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:19,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:19,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:20,725 INFO L130 PetriNetUnfolder]: 1908/3980 cut-off events. [2022-12-06 00:16:20,725 INFO L131 PetriNetUnfolder]: For 289221/295105 co-relation queries the response was YES. [2022-12-06 00:16:20,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80229 conditions, 3980 events. 1908/3980 cut-off events. For 289221/295105 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 33789 event pairs, 61 based on Foata normal form. 12/3981 useless extension candidates. Maximal degree in co-relation 79979. Up to 1756 conditions per place. [2022-12-06 00:16:20,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:20,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 3806 [2022-12-06 00:16:20,813 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:20,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1535 [2022-12-06 00:16:20,827 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 1115 transitions, 54542 flow [2022-12-06 00:16:20,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:20,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:20,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:20,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 00:16:20,828 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:16:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash -313112118, now seen corresponding path program 1 times [2022-12-06 00:16:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:20,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423196515] [2022-12-06 00:16:20,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:20,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:21,033 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 00:16:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423196515] [2022-12-06 00:16:21,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423196515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:21,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:21,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:16:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023530651] [2022-12-06 00:16:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:16:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:16:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:16:21,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:16:21,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1115 transitions, 54542 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:21,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:21,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:16:21,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:25,847 INFO L130 PetriNetUnfolder]: 7238/11997 cut-off events. [2022-12-06 00:16:25,847 INFO L131 PetriNetUnfolder]: For 653246/653246 co-relation queries the response was YES. [2022-12-06 00:16:25,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204026 conditions, 11997 events. 7238/11997 cut-off events. For 653246/653246 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 88403 event pairs, 341 based on Foata normal form. 4/12001 useless extension candidates. Maximal degree in co-relation 203441. Up to 11889 conditions per place. [2022-12-06 00:16:25,999 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 1089 selfloop transitions, 35 changer transitions 9/1133 dead transitions. [2022-12-06 00:16:25,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1133 transitions, 57236 flow [2022-12-06 00:16:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:16:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:16:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-12-06 00:16:26,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18024691358024691 [2022-12-06 00:16:26,000 INFO L175 Difference]: Start difference. First operand has 272 places, 1115 transitions, 54542 flow. Second operand 9 states and 73 transitions. [2022-12-06 00:16:26,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1133 transitions, 57236 flow [2022-12-06 00:16:34,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 1133 transitions, 56385 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-12-06 00:16:34,822 INFO L231 Difference]: Finished difference. Result has 275 places, 1114 transitions, 53747 flow [2022-12-06 00:16:34,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=53701, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1080, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=53747, PETRI_PLACES=275, PETRI_TRANSITIONS=1114} [2022-12-06 00:16:34,823 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 227 predicate places. [2022-12-06 00:16:34,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:34,823 INFO L89 Accepts]: Start accepts. Operand has 275 places, 1114 transitions, 53747 flow [2022-12-06 00:16:34,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:34,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:34,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 1114 transitions, 53747 flow [2022-12-06 00:16:34,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 1114 transitions, 53747 flow [2022-12-06 00:16:36,053 INFO L130 PetriNetUnfolder]: 1906/3988 cut-off events. [2022-12-06 00:16:36,054 INFO L131 PetriNetUnfolder]: For 273356/279234 co-relation queries the response was YES. [2022-12-06 00:16:36,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78654 conditions, 3988 events. 1906/3988 cut-off events. For 273356/279234 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 33851 event pairs, 57 based on Foata normal form. 14/3991 useless extension candidates. Maximal degree in co-relation 78415. Up to 1756 conditions per place. [2022-12-06 00:16:36,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 1114 transitions, 53747 flow [2022-12-06 00:16:36,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 3804 [2022-12-06 00:16:36,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:16:36,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:16:36,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] $Ultimate##0-->L105: Formula: (and (= v_~t~0_415 v_~m2~0_165) (= v_~t~0_413 (+ v_~t~0_415 3)) (= v_~m4~0_132 (+ v_~t~0_415 2)) (= (+ v_~t~0_415 1) v_~m5~0_146)) InVars {~t~0=v_~t~0_415} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_48|, ~m5~0=v_~m5~0_146, ~m4~0=v_~m4~0_132, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_63|, ~m2~0=v_~m2~0_165, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_50|, ~t~0=v_~t~0_413} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [687] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res#1.offset_77| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_111| (ite (<= v_~m2~0_199 v_~s~0_806) 1 0)) (= v_~t~0_496 v_~m3~0_177) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_111|)) (= (+ v_~s~0_806 1) v_~s~0_805) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_111| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_111|) (= |v_thread2Thread1of1ForFork4_#res#1.base_77| 0) (= v_~b~0_529 (ite (= (ite (or (= v_~x~0_326 1) (not (= (mod v_~b~0_530 256) 0))) 1 0) 0) 0 1)) (= (+ v_~t~0_496 1) v_~t~0_495)) InVars {~b~0=v_~b~0_530, ~m2~0=v_~m2~0_199, ~x~0=v_~x~0_326, ~s~0=v_~s~0_806, ~t~0=v_~t~0_496} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_111|, ~m3~0=v_~m3~0_177, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_77|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_111|, ~b~0=v_~b~0_529, ~m2~0=v_~m2~0_199, ~x~0=v_~x~0_326, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_111|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_73|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_77|, ~s~0=v_~s~0_805, ~t~0=v_~t~0_495} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, ~m3~0, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:16:36,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_449 1) v_~m4~0_144) (= v_~t~0_447 (+ v_~m5~0_158 1)) (= v_~t~0_449 v_~m2~0_181) (= (+ v_~t~0_449 2) v_~m5~0_158)) InVars {~t~0=v_~t~0_449} OutVars{~m5~0=v_~m5~0_158, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_60|, ~m4~0=v_~m4~0_144, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_75|, ~m2~0=v_~m2~0_181, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_62|, ~t~0=v_~t~0_447} AuxVars[] AssignedVars[~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [686] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_491 (+ v_~t~0_492 1)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_109|) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_109|)) (= v_~t~0_492 v_~m3~0_175) (= (ite (<= v_~m2~0_197 v_~s~0_802) 1 0) |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_109|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_75| 0) (= (+ v_~s~0_802 1) v_~s~0_801) (= |v_thread2Thread1of1ForFork4_#res#1.base_75| 0) (= v_~b~0_525 (ite (= (ite (or (not (= (mod v_~b~0_526 256) 0)) (= v_~x~0_324 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_526, ~m2~0=v_~m2~0_197, ~x~0=v_~x~0_324, ~s~0=v_~s~0_802, ~t~0=v_~t~0_492} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_109|, ~m3~0=v_~m3~0_175, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_75|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_109|, ~b~0=v_~b~0_525, ~m2~0=v_~m2~0_197, ~x~0=v_~x~0_324, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_109|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_71|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_75|, ~s~0=v_~s~0_801, ~t~0=v_~t~0_491} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, ~m3~0, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:16:36,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_449 1) v_~m4~0_144) (= v_~t~0_447 (+ v_~m5~0_158 1)) (= v_~t~0_449 v_~m2~0_181) (= (+ v_~t~0_449 2) v_~m5~0_158)) InVars {~t~0=v_~t~0_449} OutVars{~m5~0=v_~m5~0_158, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_60|, ~m4~0=v_~m4~0_144, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_75|, ~m2~0=v_~m2~0_181, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_62|, ~t~0=v_~t~0_447} AuxVars[] AssignedVars[~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:16:36,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] $Ultimate##0-->L105: Formula: (and (= v_~t~0_415 v_~m2~0_165) (= v_~t~0_413 (+ v_~t~0_415 3)) (= v_~m4~0_132 (+ v_~t~0_415 2)) (= (+ v_~t~0_415 1) v_~m5~0_146)) InVars {~t~0=v_~t~0_415} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_48|, ~m5~0=v_~m5~0_146, ~m4~0=v_~m4~0_132, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_63|, ~m2~0=v_~m2~0_165, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_50|, ~t~0=v_~t~0_413} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] [2022-12-06 00:16:36,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:16:36,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:16:36,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->L86: Formula: (and (= (+ v_~t~0_519 3) v_~m3~0_185) (= (+ v_~t~0_519 4) v_~t~0_517) (= (+ v_~t~0_519 1) v_~m5~0_176) (= (+ v_~t~0_519 2) v_~m4~0_162) (= v_~t~0_519 v_~m2~0_207)) InVars {~t~0=v_~t~0_519} OutVars{~m3~0=v_~m3~0_185, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_78|, ~m5~0=v_~m5~0_176, ~m4~0=v_~m4~0_162, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_93|, ~m2~0=v_~m2~0_207, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_81|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_80|, ~t~0=v_~t~0_517} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [693] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_119| (ite (<= v_~m2~0_211 v_~s~0_822) 1 0)) (= v_~b~0_545 (ite (= (ite (or (= v_~x~0_334 1) (not (= (mod v_~b~0_546 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_119|) (= (+ v_~s~0_822 1) v_~s~0_821) (= v_~t~0_527 (+ v_~t~0_528 1)) (= |v_thread2Thread1of1ForFork4_#res#1.base_85| 0) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_119|)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_85| 0) (= v_~t~0_528 v_~m1~0_199)) InVars {~b~0=v_~b~0_546, ~m2~0=v_~m2~0_211, ~x~0=v_~x~0_334, ~s~0=v_~s~0_822, ~t~0=v_~t~0_528} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_119|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_85|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_85|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_119|, ~b~0=v_~b~0_545, ~m2~0=v_~m2~0_211, ~m1~0=v_~m1~0_199, ~x~0=v_~x~0_334, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_119|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_85|, ~s~0=v_~s~0_821, ~t~0=v_~t~0_527} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m1~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:16:36,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_183 (+ v_~m5~0_174 1)) (= (+ v_~t~0_513 2) v_~m5~0_174) (= v_~t~0_513 v_~m2~0_205) (= (+ v_~t~0_513 1) v_~m4~0_160) (= v_~t~0_511 (+ 2 v_~m5~0_174))) InVars {~t~0=v_~t~0_513} OutVars{~m3~0=v_~m3~0_183, ~m5~0=v_~m5~0_174, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_76|, ~m4~0=v_~m4~0_160, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_91|, ~m2~0=v_~m2~0_205, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_79|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_78|, ~t~0=v_~t~0_511} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [692] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_542 256) 0)) (= v_~x~0_332 1)) 1 0) 0) 0 1) v_~b~0_541) (= |v_thread2Thread1of1ForFork4_#res#1.base_83| 0) (= (+ v_~s~0_818 1) v_~s~0_817) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_117|)) (= v_~t~0_523 (+ v_~t~0_524 1)) (= v_~t~0_524 v_~m1~0_197) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_117| (ite (<= v_~m2~0_209 v_~s~0_818) 1 0)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_83| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_117|)) InVars {~b~0=v_~b~0_542, ~m2~0=v_~m2~0_209, ~x~0=v_~x~0_332, ~s~0=v_~s~0_818, ~t~0=v_~t~0_524} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_117|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_83|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_117|, ~b~0=v_~b~0_541, ~m2~0=v_~m2~0_209, ~m1~0=v_~m1~0_197, ~x~0=v_~x~0_332, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_83|, ~s~0=v_~s~0_817, ~t~0=v_~t~0_523} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m1~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:16:36,825 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->L86: Formula: (and (= (+ v_~t~0_519 3) v_~m3~0_185) (= (+ v_~t~0_519 4) v_~t~0_517) (= (+ v_~t~0_519 1) v_~m5~0_176) (= (+ v_~t~0_519 2) v_~m4~0_162) (= v_~t~0_519 v_~m2~0_207)) InVars {~t~0=v_~t~0_519} OutVars{~m3~0=v_~m3~0_185, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_78|, ~m5~0=v_~m5~0_176, ~m4~0=v_~m4~0_162, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_93|, ~m2~0=v_~m2~0_207, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_81|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_80|, ~t~0=v_~t~0_517} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork3_#t~post7#1, ~m5~0, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:16:36,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_183 (+ v_~m5~0_174 1)) (= (+ v_~t~0_513 2) v_~m5~0_174) (= v_~t~0_513 v_~m2~0_205) (= (+ v_~t~0_513 1) v_~m4~0_160) (= v_~t~0_511 (+ 2 v_~m5~0_174))) InVars {~t~0=v_~t~0_513} OutVars{~m3~0=v_~m3~0_183, ~m5~0=v_~m5~0_174, thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_76|, ~m4~0=v_~m4~0_160, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_91|, ~m2~0=v_~m2~0_205, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_79|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_78|, ~t~0=v_~t~0_511} AuxVars[] AssignedVars[~m3~0, ~m5~0, thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread3Thread1of1ForFork1_#t~post5#1, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [446] $Ultimate##0-->L45: Formula: (and (= v_~t~0_61 (+ v_~t~0_62 1)) (= v_~m1~0_9 v_~t~0_62)) InVars {~t~0=v_~t~0_62} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:16:36,888 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:16:36,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2065 [2022-12-06 00:16:36,889 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 1112 transitions, 53733 flow [2022-12-06 00:16:36,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:36,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:36,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:36,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 00:16:36,889 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:16:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1874442896, now seen corresponding path program 3 times [2022-12-06 00:16:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:36,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845089024] [2022-12-06 00:16:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:37,031 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 00:16:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845089024] [2022-12-06 00:16:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845089024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:37,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:37,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:16:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251904084] [2022-12-06 00:16:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:16:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:16:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:16:37,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:16:37,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1112 transitions, 53733 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:37,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:37,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:16:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:42,010 INFO L130 PetriNetUnfolder]: 7103/11842 cut-off events. [2022-12-06 00:16:42,010 INFO L131 PetriNetUnfolder]: For 618146/618146 co-relation queries the response was YES. [2022-12-06 00:16:42,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198619 conditions, 11842 events. 7103/11842 cut-off events. For 618146/618146 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 88093 event pairs, 176 based on Foata normal form. 152/11994 useless extension candidates. Maximal degree in co-relation 198060. Up to 4171 conditions per place. [2022-12-06 00:16:42,156 INFO L137 encePairwiseOnDemand]: 20/48 looper letters, 146 selfloop transitions, 1003 changer transitions 36/1185 dead transitions. [2022-12-06 00:16:42,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1185 transitions, 56860 flow [2022-12-06 00:16:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:16:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:16:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-12-06 00:16:42,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2022-12-06 00:16:42,157 INFO L175 Difference]: Start difference. First operand has 270 places, 1112 transitions, 53733 flow. Second operand 7 states and 155 transitions. [2022-12-06 00:16:42,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1185 transitions, 56860 flow [2022-12-06 00:16:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1185 transitions, 56632 flow, removed 86 selfloop flow, removed 4 redundant places. [2022-12-06 00:16:50,138 INFO L231 Difference]: Finished difference. Result has 275 places, 1084 transitions, 56079 flow [2022-12-06 00:16:50,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=52953, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1090, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=985, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=56079, PETRI_PLACES=275, PETRI_TRANSITIONS=1084} [2022-12-06 00:16:50,139 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 227 predicate places. [2022-12-06 00:16:50,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:50,139 INFO L89 Accepts]: Start accepts. Operand has 275 places, 1084 transitions, 56079 flow [2022-12-06 00:16:50,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:50,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:50,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 1084 transitions, 56079 flow [2022-12-06 00:16:50,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 1084 transitions, 56079 flow [2022-12-06 00:16:51,479 INFO L130 PetriNetUnfolder]: 1790/3787 cut-off events. [2022-12-06 00:16:51,479 INFO L131 PetriNetUnfolder]: For 305741/312685 co-relation queries the response was YES. [2022-12-06 00:16:51,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81395 conditions, 3787 events. 1790/3787 cut-off events. For 305741/312685 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 32299 event pairs, 55 based on Foata normal form. 14/3789 useless extension candidates. Maximal degree in co-relation 81142. Up to 1721 conditions per place. [2022-12-06 00:16:51,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 1084 transitions, 56079 flow [2022-12-06 00:16:51,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 3684 [2022-12-06 00:16:51,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:51,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1423 [2022-12-06 00:16:51,562 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 1084 transitions, 56079 flow [2022-12-06 00:16:51,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:51,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:51,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:51,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 00:16:51,562 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:16:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1874472735, now seen corresponding path program 1 times [2022-12-06 00:16:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:51,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201655202] [2022-12-06 00:16:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:51,663 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 00:16:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201655202] [2022-12-06 00:16:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201655202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:51,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:16:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468700508] [2022-12-06 00:16:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:51,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:16:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:16:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:16:51,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:16:51,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1084 transitions, 56079 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:51,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:51,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:16:51,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:56,722 INFO L130 PetriNetUnfolder]: 6908/11557 cut-off events. [2022-12-06 00:16:56,722 INFO L131 PetriNetUnfolder]: For 696070/696070 co-relation queries the response was YES. [2022-12-06 00:16:56,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206474 conditions, 11557 events. 6908/11557 cut-off events. For 696070/696070 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 85808 event pairs, 370 based on Foata normal form. 2/11559 useless extension candidates. Maximal degree in co-relation 205954. Up to 11530 conditions per place. [2022-12-06 00:16:56,880 INFO L137 encePairwiseOnDemand]: 27/46 looper letters, 1070 selfloop transitions, 14 changer transitions 9/1093 dead transitions. [2022-12-06 00:16:56,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 1093 transitions, 58272 flow [2022-12-06 00:16:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:16:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:16:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 00:16:56,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2318840579710145 [2022-12-06 00:16:56,881 INFO L175 Difference]: Start difference. First operand has 270 places, 1084 transitions, 56079 flow. Second operand 6 states and 64 transitions. [2022-12-06 00:16:56,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 1093 transitions, 58272 flow [2022-12-06 00:17:06,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1093 transitions, 57196 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-12-06 00:17:06,943 INFO L231 Difference]: Finished difference. Result has 266 places, 1077 transitions, 54689 flow [2022-12-06 00:17:06,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=54987, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1083, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=54689, PETRI_PLACES=266, PETRI_TRANSITIONS=1077} [2022-12-06 00:17:06,944 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 218 predicate places. [2022-12-06 00:17:06,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:06,944 INFO L89 Accepts]: Start accepts. Operand has 266 places, 1077 transitions, 54689 flow [2022-12-06 00:17:06,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:06,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:06,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 1077 transitions, 54689 flow [2022-12-06 00:17:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1077 transitions, 54689 flow [2022-12-06 00:17:08,371 INFO L130 PetriNetUnfolder]: 1788/3784 cut-off events. [2022-12-06 00:17:08,371 INFO L131 PetriNetUnfolder]: For 292488/299199 co-relation queries the response was YES. [2022-12-06 00:17:08,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79485 conditions, 3784 events. 1788/3784 cut-off events. For 292488/299199 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 32283 event pairs, 57 based on Foata normal form. 14/3787 useless extension candidates. Maximal degree in co-relation 79232. Up to 1718 conditions per place. [2022-12-06 00:17:08,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1077 transitions, 54689 flow [2022-12-06 00:17:08,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 3670 [2022-12-06 00:17:08,453 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:08,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1509 [2022-12-06 00:17:08,454 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1077 transitions, 54689 flow [2022-12-06 00:17:08,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:08,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:08,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 00:17:08,454 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:17:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1517388223, now seen corresponding path program 1 times [2022-12-06 00:17:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864336791] [2022-12-06 00:17:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:08,548 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 00:17:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:08,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864336791] [2022-12-06 00:17:08,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864336791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:08,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:08,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:17:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434865717] [2022-12-06 00:17:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:08,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:17:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:17:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:08,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:17:08,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1077 transitions, 54689 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:08,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:08,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:17:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:13,202 INFO L130 PetriNetUnfolder]: 6893/11532 cut-off events. [2022-12-06 00:17:13,202 INFO L131 PetriNetUnfolder]: For 674046/674046 co-relation queries the response was YES. [2022-12-06 00:17:13,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201672 conditions, 11532 events. 6893/11532 cut-off events. For 674046/674046 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 85555 event pairs, 313 based on Foata normal form. 8/11540 useless extension candidates. Maximal degree in co-relation 201181. Up to 4885 conditions per place. [2022-12-06 00:17:13,344 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 322 selfloop transitions, 790 changer transitions 10/1122 dead transitions. [2022-12-06 00:17:13,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1122 transitions, 57136 flow [2022-12-06 00:17:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:17:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:17:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-12-06 00:17:13,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2022-12-06 00:17:13,345 INFO L175 Difference]: Start difference. First operand has 261 places, 1077 transitions, 54689 flow. Second operand 8 states and 147 transitions. [2022-12-06 00:17:13,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1122 transitions, 57136 flow [2022-12-06 00:17:20,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1122 transitions, 57075 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:17:20,965 INFO L231 Difference]: Finished difference. Result has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:20,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=54527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=790, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=55750, PETRI_PLACES=265, PETRI_TRANSITIONS=1063} [2022-12-06 00:17:20,966 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 217 predicate places. [2022-12-06 00:17:20,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:20,966 INFO L89 Accepts]: Start accepts. Operand has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:20,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:20,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:20,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:20,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:22,349 INFO L130 PetriNetUnfolder]: 1780/3782 cut-off events. [2022-12-06 00:17:22,349 INFO L131 PetriNetUnfolder]: For 299465/307275 co-relation queries the response was YES. [2022-12-06 00:17:22,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81298 conditions, 3782 events. 1780/3782 cut-off events. For 299465/307275 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 32315 event pairs, 57 based on Foata normal form. 12/3781 useless extension candidates. Maximal degree in co-relation 81069. Up to 1709 conditions per place. [2022-12-06 00:17:22,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:22,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 3642 [2022-12-06 00:17:22,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:22,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1472 [2022-12-06 00:17:22,438 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 1063 transitions, 55750 flow [2022-12-06 00:17:22,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:22,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:22,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:22,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 00:17:22,439 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:17:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1340817856, now seen corresponding path program 1 times [2022-12-06 00:17:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:22,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941349902] [2022-12-06 00:17:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:22,541 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 00:17:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941349902] [2022-12-06 00:17:22,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941349902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:22,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:22,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:17:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665800517] [2022-12-06 00:17:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:22,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:17:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:17:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:22,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:17:22,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1063 transitions, 55750 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:22,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:22,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:17:22,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:27,271 INFO L130 PetriNetUnfolder]: 6875/11498 cut-off events. [2022-12-06 00:17:27,272 INFO L131 PetriNetUnfolder]: For 693578/693578 co-relation queries the response was YES. [2022-12-06 00:17:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205983 conditions, 11498 events. 6875/11498 cut-off events. For 693578/693578 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 85041 event pairs, 339 based on Foata normal form. 2/11500 useless extension candidates. Maximal degree in co-relation 205545. Up to 11450 conditions per place. [2022-12-06 00:17:27,430 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 1044 selfloop transitions, 18 changer transitions 9/1071 dead transitions. [2022-12-06 00:17:27,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1071 transitions, 57878 flow [2022-12-06 00:17:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:17:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:17:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 00:17:27,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2077922077922078 [2022-12-06 00:17:27,431 INFO L175 Difference]: Start difference. First operand has 265 places, 1063 transitions, 55750 flow. Second operand 7 states and 64 transitions. [2022-12-06 00:17:27,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1071 transitions, 57878 flow [2022-12-06 00:17:36,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1071 transitions, 56631 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 00:17:36,212 INFO L231 Difference]: Finished difference. Result has 266 places, 1056 transitions, 54041 flow [2022-12-06 00:17:36,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=54469, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=54041, PETRI_PLACES=266, PETRI_TRANSITIONS=1056} [2022-12-06 00:17:36,213 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 218 predicate places. [2022-12-06 00:17:36,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:36,213 INFO L89 Accepts]: Start accepts. Operand has 266 places, 1056 transitions, 54041 flow [2022-12-06 00:17:36,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:36,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:36,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 1056 transitions, 54041 flow [2022-12-06 00:17:36,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 1056 transitions, 54041 flow [2022-12-06 00:17:37,584 INFO L130 PetriNetUnfolder]: 1778/3783 cut-off events. [2022-12-06 00:17:37,584 INFO L131 PetriNetUnfolder]: For 286243/294123 co-relation queries the response was YES. [2022-12-06 00:17:37,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78848 conditions, 3783 events. 1778/3783 cut-off events. For 286243/294123 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 32350 event pairs, 55 based on Foata normal form. 13/3784 useless extension candidates. Maximal degree in co-relation 78620. Up to 1705 conditions per place. [2022-12-06 00:17:37,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 1056 transitions, 54041 flow [2022-12-06 00:17:37,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 3628 [2022-12-06 00:17:37,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:17:37,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_50) (= (+ v_~t~0_50 1) v_~t~0_49)) InVars {~t~0=v_~t~0_50} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_1|, ~t~0=v_~t~0_49} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork1_#t~post5#1, ~t~0] and [601] L67-->thread2EXIT: Formula: (and (= v_~s~0_487 (+ v_~s~0_488 1)) (= v_~b~0_255 (ite (= (ite (or (not (= (mod v_~b~0_256 256) 0)) (= v_~x~0_159 1)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork4_#res#1.base_7|) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|) (= |v_thread2Thread1of1ForFork4_#res#1.offset_7| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_83 v_~s~0_488) 1 0)) (not (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0))) InVars {~b~0=v_~b~0_256, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, ~s~0=v_~s~0_488} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_41|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_7|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, ~b~0=v_~b~0_255, ~m2~0=v_~m2~0_83, ~x~0=v_~x~0_159, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_7|, ~s~0=v_~s~0_487} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0] [2022-12-06 00:17:37,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_307 1) v_~m4~0_108) (= v_~t~0_307 v_~m2~0_123) (= v_~t~0_305 (+ v_~t~0_307 2))) InVars {~t~0=v_~t~0_307} OutVars{thread4Thread1of1ForFork3_#t~post7#1=|v_thread4Thread1of1ForFork3_#t~post7#1_26|, ~m4~0=v_~m4~0_108, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_27|, ~m2~0=v_~m2~0_123, ~t~0=v_~t~0_305} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~post7#1, ~m4~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, ~t~0] and [698] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res#1.base_91| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_125|) (= v_~b~0_557 (ite (= (ite (or (not (= (mod v_~b~0_558 256) 0)) (= v_~x~0_340 1)) 1 0) 0) 0 1)) (= v_~t~0_556 v_~m3~0_195) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_125|)) (= v_~t~0_555 (+ v_~t~0_556 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_91| 0) (= (+ v_~s~0_834 1) v_~s~0_833) (= (ite (<= v_~m2~0_221 v_~s~0_834) 1 0) |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_125|)) InVars {~b~0=v_~b~0_558, ~m2~0=v_~m2~0_221, ~x~0=v_~x~0_340, ~s~0=v_~s~0_834, ~t~0=v_~t~0_556} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_125|, ~m3~0=v_~m3~0_195, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_91|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_125|, ~b~0=v_~b~0_557, ~m2~0=v_~m2~0_221, ~x~0=v_~x~0_340, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_91|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_91|, ~s~0=v_~s~0_833, ~t~0=v_~t~0_555} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, ~m3~0, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:17:37,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L124: Formula: (and (= v_~t~0_311 (+ v_~t~0_313 2)) (= v_~t~0_313 v_~m2~0_125) (= v_~m5~0_126 (+ v_~t~0_313 1))) InVars {~t~0=v_~t~0_313} OutVars{~m5~0=v_~m5~0_126, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_29|, ~m2~0=v_~m2~0_125, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_32|, ~t~0=v_~t~0_311} AuxVars[] AssignedVars[~m5~0, thread2Thread1of1ForFork4_#t~post3#1, ~m2~0, thread5Thread1of1ForFork0_#t~post9#1, ~t~0] and [699] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_559 (+ v_~t~0_560 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_93| 0) (= v_~b~0_561 (ite (= (ite (or (not (= (mod v_~b~0_562 256) 0)) (= v_~x~0_342 1)) 1 0) 0) 0 1)) (= v_~t~0_560 v_~m3~0_197) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_127|)) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_127|) (= (+ v_~s~0_838 1) v_~s~0_837) (= |v_thread2Thread1of1ForFork4_#res#1.base_93| 0) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_127| (ite (<= v_~m2~0_223 v_~s~0_838) 1 0))) InVars {~b~0=v_~b~0_562, ~m2~0=v_~m2~0_223, ~x~0=v_~x~0_342, ~s~0=v_~s~0_838, ~t~0=v_~t~0_560} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_127|, ~m3~0=v_~m3~0_197, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_93|, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_127|, ~b~0=v_~b~0_561, ~m2~0=v_~m2~0_223, ~x~0=v_~x~0_342, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_127|, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_93|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_93|, ~s~0=v_~s~0_837, ~t~0=v_~t~0_559} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, ~m3~0, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork4_#res#1.base, ~s~0, ~t~0] [2022-12-06 00:17:37,926 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:17:37,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1714 [2022-12-06 00:17:37,927 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1056 transitions, 54035 flow [2022-12-06 00:17:37,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:37,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:37,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:37,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 00:17:37,927 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:17:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 395627647, now seen corresponding path program 2 times [2022-12-06 00:17:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:37,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368829908] [2022-12-06 00:17:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:38,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 00:17:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368829908] [2022-12-06 00:17:38,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368829908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:38,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:38,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:17:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653901984] [2022-12-06 00:17:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:38,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:17:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:17:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:38,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:17:38,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1056 transitions, 54035 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:38,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:38,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:17:38,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:42,813 INFO L130 PetriNetUnfolder]: 6866/11479 cut-off events. [2022-12-06 00:17:42,813 INFO L131 PetriNetUnfolder]: For 653036/653036 co-relation queries the response was YES. [2022-12-06 00:17:42,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200009 conditions, 11479 events. 6866/11479 cut-off events. For 653036/653036 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 84877 event pairs, 345 based on Foata normal form. 2/11481 useless extension candidates. Maximal degree in co-relation 199643. Up to 11323 conditions per place. [2022-12-06 00:17:42,958 INFO L137 encePairwiseOnDemand]: 25/46 looper letters, 1018 selfloop transitions, 48 changer transitions 7/1073 dead transitions. [2022-12-06 00:17:42,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1073 transitions, 56195 flow [2022-12-06 00:17:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:17:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:17:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-12-06 00:17:42,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24728260869565216 [2022-12-06 00:17:42,960 INFO L175 Difference]: Start difference. First operand has 263 places, 1056 transitions, 54035 flow. Second operand 8 states and 91 transitions. [2022-12-06 00:17:42,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 1073 transitions, 56195 flow [2022-12-06 00:17:50,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 1073 transitions, 56053 flow, removed 31 selfloop flow, removed 8 redundant places. [2022-12-06 00:17:51,016 INFO L231 Difference]: Finished difference. Result has 262 places, 1048 transitions, 53598 flow [2022-12-06 00:17:51,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=53865, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=53598, PETRI_PLACES=262, PETRI_TRANSITIONS=1048} [2022-12-06 00:17:51,017 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 214 predicate places. [2022-12-06 00:17:51,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:51,017 INFO L89 Accepts]: Start accepts. Operand has 262 places, 1048 transitions, 53598 flow [2022-12-06 00:17:51,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:51,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:51,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 1048 transitions, 53598 flow [2022-12-06 00:17:51,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 1048 transitions, 53598 flow [2022-12-06 00:17:52,426 INFO L130 PetriNetUnfolder]: 1776/3774 cut-off events. [2022-12-06 00:17:52,427 INFO L131 PetriNetUnfolder]: For 285423/294248 co-relation queries the response was YES. [2022-12-06 00:17:52,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78621 conditions, 3774 events. 1776/3774 cut-off events. For 285423/294248 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 32207 event pairs, 58 based on Foata normal form. 14/3776 useless extension candidates. Maximal degree in co-relation 78391. Up to 1701 conditions per place. [2022-12-06 00:17:52,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 1048 transitions, 53598 flow [2022-12-06 00:17:52,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 3612 [2022-12-06 00:17:52,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:52,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1500 [2022-12-06 00:17:52,517 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 1048 transitions, 53598 flow [2022-12-06 00:17:52,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:52,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:52,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:52,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 00:17:52,517 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:17:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash -259232543, now seen corresponding path program 1 times [2022-12-06 00:17:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:52,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29419960] [2022-12-06 00:17:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:52,625 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 00:17:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29419960] [2022-12-06 00:17:52,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29419960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:52,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:52,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:17:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200415969] [2022-12-06 00:17:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:52,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:17:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:17:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:52,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:17:52,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 1048 transitions, 53598 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:52,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:52,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:17:52,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:57,318 INFO L130 PetriNetUnfolder]: 6913/11588 cut-off events. [2022-12-06 00:17:57,319 INFO L131 PetriNetUnfolder]: For 652007/652007 co-relation queries the response was YES. [2022-12-06 00:17:57,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200991 conditions, 11588 events. 6913/11588 cut-off events. For 652007/652007 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 86301 event pairs, 181 based on Foata normal form. 4/11592 useless extension candidates. Maximal degree in co-relation 200361. Up to 4091 conditions per place. [2022-12-06 00:17:57,471 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 152 selfloop transitions, 976 changer transitions 14/1142 dead transitions. [2022-12-06 00:17:57,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1142 transitions, 57266 flow [2022-12-06 00:17:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:17:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:17:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-06 00:17:57,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2022-12-06 00:17:57,472 INFO L175 Difference]: Start difference. First operand has 260 places, 1048 transitions, 53598 flow. Second operand 7 states and 149 transitions. [2022-12-06 00:17:57,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 1142 transitions, 57266 flow [2022-12-06 00:18:05,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1142 transitions, 56306 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-12-06 00:18:05,441 INFO L231 Difference]: Finished difference. Result has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:05,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=52655, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=962, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=56991, PETRI_PLACES=261, PETRI_TRANSITIONS=1064} [2022-12-06 00:18:05,442 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 213 predicate places. [2022-12-06 00:18:05,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:05,442 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:05,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:05,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:05,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:05,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:07,055 INFO L130 PetriNetUnfolder]: 1780/3810 cut-off events. [2022-12-06 00:18:07,055 INFO L131 PetriNetUnfolder]: For 325787/334455 co-relation queries the response was YES. [2022-12-06 00:18:07,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83544 conditions, 3810 events. 1780/3810 cut-off events. For 325787/334455 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 32710 event pairs, 59 based on Foata normal form. 16/3815 useless extension candidates. Maximal degree in co-relation 83253. Up to 1711 conditions per place. [2022-12-06 00:18:07,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:07,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 3656 [2022-12-06 00:18:07,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:18:07,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1700 [2022-12-06 00:18:07,142 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1064 transitions, 56991 flow [2022-12-06 00:18:07,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:07,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:07,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:07,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 00:18:07,143 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:18:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2063526195, now seen corresponding path program 2 times [2022-12-06 00:18:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:07,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472799291] [2022-12-06 00:18:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:07,264 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 00:18:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:07,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472799291] [2022-12-06 00:18:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472799291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:18:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:18:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:18:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77921835] [2022-12-06 00:18:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:18:07,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:18:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:18:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:18:07,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:18:07,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1064 transitions, 56991 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:07,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:07,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:18:07,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:12,302 INFO L130 PetriNetUnfolder]: 6886/11541 cut-off events. [2022-12-06 00:18:12,302 INFO L131 PetriNetUnfolder]: For 735804/735804 co-relation queries the response was YES. [2022-12-06 00:18:12,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211732 conditions, 11541 events. 6886/11541 cut-off events. For 735804/735804 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 86068 event pairs, 126 based on Foata normal form. 4/11545 useless extension candidates. Maximal degree in co-relation 211034. Up to 4075 conditions per place. [2022-12-06 00:18:12,448 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 145 selfloop transitions, 979 changer transitions 4/1128 dead transitions. [2022-12-06 00:18:12,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1128 transitions, 59775 flow [2022-12-06 00:18:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:18:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:18:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-12-06 00:18:12,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-06 00:18:12,449 INFO L175 Difference]: Start difference. First operand has 261 places, 1064 transitions, 56991 flow. Second operand 7 states and 147 transitions. [2022-12-06 00:18:12,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1128 transitions, 59775 flow [2022-12-06 00:18:22,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1128 transitions, 58503 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-06 00:18:22,815 INFO L231 Difference]: Finished difference. Result has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:22,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=55714, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=977, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=57689, PETRI_PLACES=263, PETRI_TRANSITIONS=1062} [2022-12-06 00:18:22,816 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 215 predicate places. [2022-12-06 00:18:22,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:22,816 INFO L89 Accepts]: Start accepts. Operand has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:22,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:22,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:22,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:22,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:24,136 INFO L130 PetriNetUnfolder]: 1778/3811 cut-off events. [2022-12-06 00:18:24,136 INFO L131 PetriNetUnfolder]: For 334792/344211 co-relation queries the response was YES. [2022-12-06 00:18:24,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84162 conditions, 3811 events. 1778/3811 cut-off events. For 334792/344211 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 32727 event pairs, 56 based on Foata normal form. 15/3816 useless extension candidates. Maximal degree in co-relation 83869. Up to 1706 conditions per place. [2022-12-06 00:18:24,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:24,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 3652 [2022-12-06 00:18:24,317 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:18:24,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1502 [2022-12-06 00:18:24,318 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1062 transitions, 57689 flow [2022-12-06 00:18:24,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:24,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:24,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:24,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 00:18:24,318 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:18:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 84359795, now seen corresponding path program 3 times [2022-12-06 00:18:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:24,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697272685] [2022-12-06 00:18:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:24,426 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 00:18:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697272685] [2022-12-06 00:18:24,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697272685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:18:24,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:18:24,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:18:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839232803] [2022-12-06 00:18:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:18:24,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:18:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:18:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:18:24,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:18:24,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1062 transitions, 57689 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:24,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:24,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:18:24,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:29,758 INFO L130 PetriNetUnfolder]: 6888/11543 cut-off events. [2022-12-06 00:18:29,758 INFO L131 PetriNetUnfolder]: For 792973/792973 co-relation queries the response was YES. [2022-12-06 00:18:29,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213658 conditions, 11543 events. 6888/11543 cut-off events. For 792973/792973 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 85663 event pairs, 325 based on Foata normal form. 4/11547 useless extension candidates. Maximal degree in co-relation 212958. Up to 6555 conditions per place. [2022-12-06 00:18:29,899 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 462 selfloop transitions, 637 changer transitions 4/1103 dead transitions. [2022-12-06 00:18:29,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1103 transitions, 60726 flow [2022-12-06 00:18:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:18:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:18:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 00:18:29,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2022-12-06 00:18:29,901 INFO L175 Difference]: Start difference. First operand has 263 places, 1062 transitions, 57689 flow. Second operand 8 states and 123 transitions. [2022-12-06 00:18:29,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 1103 transitions, 60726 flow [2022-12-06 00:18:39,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1103 transitions, 60627 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:18:39,039 INFO L231 Difference]: Finished difference. Result has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:39,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=57592, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=634, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=59773, PETRI_PLACES=271, PETRI_TRANSITIONS=1063} [2022-12-06 00:18:39,040 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 223 predicate places. [2022-12-06 00:18:39,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:39,040 INFO L89 Accepts]: Start accepts. Operand has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:39,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:39,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:39,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:39,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:40,363 INFO L130 PetriNetUnfolder]: 1777/3802 cut-off events. [2022-12-06 00:18:40,363 INFO L131 PetriNetUnfolder]: For 364755/374496 co-relation queries the response was YES. [2022-12-06 00:18:40,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86880 conditions, 3802 events. 1777/3802 cut-off events. For 364755/374496 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 32681 event pairs, 59 based on Foata normal form. 14/3804 useless extension candidates. Maximal degree in co-relation 86594. Up to 1707 conditions per place. [2022-12-06 00:18:40,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:40,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 3654 [2022-12-06 00:18:40,460 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:18:40,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1420 [2022-12-06 00:18:40,460 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 1063 transitions, 59773 flow [2022-12-06 00:18:40,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:40,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:40,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:40,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 00:18:40,461 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:18:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash -924563359, now seen corresponding path program 4 times [2022-12-06 00:18:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:40,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618380312] [2022-12-06 00:18:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:40,578 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 00:18:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:40,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618380312] [2022-12-06 00:18:40,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618380312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:18:40,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:18:40,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:18:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068754636] [2022-12-06 00:18:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:18:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:18:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:18:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:18:40,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:18:40,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1063 transitions, 59773 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:40,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:40,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:18:40,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:45,875 INFO L130 PetriNetUnfolder]: 6875/11528 cut-off events. [2022-12-06 00:18:45,875 INFO L131 PetriNetUnfolder]: For 856513/856513 co-relation queries the response was YES. [2022-12-06 00:18:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219601 conditions, 11528 events. 6875/11528 cut-off events. For 856513/856513 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 85624 event pairs, 294 based on Foata normal form. 8/11536 useless extension candidates. Maximal degree in co-relation 218902. Up to 6806 conditions per place. [2022-12-06 00:18:46,064 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 523 selfloop transitions, 565 changer transitions 18/1106 dead transitions. [2022-12-06 00:18:46,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1106 transitions, 62371 flow [2022-12-06 00:18:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:18:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:18:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-06 00:18:46,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:18:46,065 INFO L175 Difference]: Start difference. First operand has 271 places, 1063 transitions, 59773 flow. Second operand 8 states and 132 transitions. [2022-12-06 00:18:46,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1106 transitions, 62371 flow [2022-12-06 00:18:55,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1106 transitions, 61681 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-06 00:18:55,910 INFO L231 Difference]: Finished difference. Result has 272 places, 1042 transitions, 59181 flow [2022-12-06 00:18:55,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=58974, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=565, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=59181, PETRI_PLACES=272, PETRI_TRANSITIONS=1042} [2022-12-06 00:18:55,911 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-06 00:18:55,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:55,912 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1042 transitions, 59181 flow [2022-12-06 00:18:55,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:55,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:55,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1042 transitions, 59181 flow [2022-12-06 00:18:55,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 1042 transitions, 59181 flow [2022-12-06 00:18:57,473 INFO L130 PetriNetUnfolder]: 1773/3804 cut-off events. [2022-12-06 00:18:57,473 INFO L131 PetriNetUnfolder]: For 370983/378486 co-relation queries the response was YES. [2022-12-06 00:18:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86679 conditions, 3804 events. 1773/3804 cut-off events. For 370983/378486 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 32615 event pairs, 58 based on Foata normal form. 13/3806 useless extension candidates. Maximal degree in co-relation 86368. Up to 1697 conditions per place. [2022-12-06 00:18:57,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1042 transitions, 59181 flow [2022-12-06 00:18:57,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 3592 [2022-12-06 00:18:57,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res#1.base_97| 0) (= (+ v_~s~0_846 1) v_~s~0_845) (= v_~t~0_569 (+ v_~m3~0_201 1)) (= |v_thread2Thread1of1ForFork4_#res#1.offset_97| 0) (= (ite (<= v_~m2~0_227 v_~s~0_846) 1 0) |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_131|) (= v_~t~0_571 v_~m2~0_227) (= |v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_131|) (= v_~m3~0_201 (+ v_~t~0_571 2)) (= v_~b~0_569 (ite (= (ite (or (not (= (mod v_~b~0_570 256) 0)) (= v_~x~0_346 1)) 1 0) 0) 0 1)) (= (+ v_~t~0_571 1) v_~m5~0_186) (not (= 0 |v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_131|))) InVars {~b~0=v_~b~0_570, ~x~0=v_~x~0_346, ~s~0=v_~s~0_846, ~t~0=v_~t~0_571} OutVars{thread2Thread1of1ForFork4_#t~post4#1=|v_thread2Thread1of1ForFork4_#t~post4#1_131|, thread2Thread1of1ForFork4_#res#1.offset=|v_thread2Thread1of1ForFork4_#res#1.offset_97|, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1_131|, thread5Thread1of1ForFork0_#t~post9#1=|v_thread5Thread1of1ForFork0_#t~post9#1_90|, thread2Thread1of1ForFork4_#res#1.base=|v_thread2Thread1of1ForFork4_#res#1.base_97|, ~m3~0=v_~m3~0_201, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_131|, ~b~0=v_~b~0_569, ~m5~0=v_~m5~0_186, ~m2~0=v_~m2~0_227, thread2Thread1of1ForFork4_#t~post3#1=|v_thread2Thread1of1ForFork4_#t~post3#1_105|, ~x~0=v_~x~0_346, thread3Thread1of1ForFork1_#t~post5#1=|v_thread3Thread1of1ForFork1_#t~post5#1_97|, ~s~0=v_~s~0_845, ~t~0=v_~t~0_569} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#t~post4#1, thread2Thread1of1ForFork4_#res#1.offset, thread2Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork4_#res#1.base, ~m3~0, thread2Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, ~m5~0, ~m2~0, thread2Thread1of1ForFork4_#t~post3#1, thread3Thread1of1ForFork1_#t~post5#1, ~s~0, ~t~0] and [599] L124-->thread5EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_244 256) 0)) (= v_~x~0_153 1)) 1 0) 0) 0 1) v_~b~0_243) (= 0 |v_thread5Thread1of1ForFork0_#res#1.offset_7|) (not (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_77 v_~s~0_478) 1 0)) (= (+ v_~s~0_478 1) v_~s~0_477) (= |v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|)) InVars {~b~0=v_~b~0_244, ~m5~0=v_~m5~0_77, ~x~0=v_~x~0_153, ~s~0=v_~s~0_478} OutVars{thread5Thread1of1ForFork0_#t~post10#1=|v_thread5Thread1of1ForFork0_#t~post10#1_49|, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~b~0=v_~b~0_243, ~m5~0=v_~m5~0_77, thread5Thread1of1ForFork0_#res#1.offset=|v_thread5Thread1of1ForFork0_#res#1.offset_7|, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork0_#res#1.base=|v_thread5Thread1of1ForFork0_#res#1.base_7|, ~x~0=v_~x~0_153, ~s~0=v_~s~0_477} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_#t~post10#1, thread5Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~b~0, thread5Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork0_#res#1.base, ~s~0] [2022-12-06 00:18:57,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:18:57,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1850 [2022-12-06 00:18:57,761 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 1041 transitions, 59117 flow [2022-12-06 00:18:57,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:57,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:57,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:57,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 00:18:57,761 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:18:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1424836209, now seen corresponding path program 1 times [2022-12-06 00:18:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:57,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168242116] [2022-12-06 00:18:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:57,861 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 00:18:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:57,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168242116] [2022-12-06 00:18:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168242116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:18:57,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:18:57,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:18:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137058382] [2022-12-06 00:18:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:18:57,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:18:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:18:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:18:57,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:18:57,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1041 transitions, 59117 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:57,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:57,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:18:57,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:02,772 INFO L130 PetriNetUnfolder]: 6841/11440 cut-off events. [2022-12-06 00:19:02,772 INFO L131 PetriNetUnfolder]: For 859833/859833 co-relation queries the response was YES. [2022-12-06 00:19:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218941 conditions, 11440 events. 6841/11440 cut-off events. For 859833/859833 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 84492 event pairs, 357 based on Foata normal form. 2/11442 useless extension candidates. Maximal degree in co-relation 218253. Up to 6529 conditions per place. [2022-12-06 00:19:02,926 INFO L137 encePairwiseOnDemand]: 21/41 looper letters, 456 selfloop transitions, 621 changer transitions 3/1080 dead transitions. [2022-12-06 00:19:02,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1080 transitions, 61816 flow [2022-12-06 00:19:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:19:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:19:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2022-12-06 00:19:02,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2022-12-06 00:19:02,927 INFO L175 Difference]: Start difference. First operand has 271 places, 1041 transitions, 59117 flow. Second operand 8 states and 125 transitions. [2022-12-06 00:19:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1080 transitions, 61816 flow [2022-12-06 00:19:12,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1080 transitions, 56795 flow, removed 30 selfloop flow, removed 17 redundant places. [2022-12-06 00:19:12,330 INFO L231 Difference]: Finished difference. Result has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:12,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=54092, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=55208, PETRI_PLACES=261, PETRI_TRANSITIONS=1037} [2022-12-06 00:19:12,331 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 213 predicate places. [2022-12-06 00:19:12,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:12,332 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:12,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:12,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:12,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:12,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:13,672 INFO L130 PetriNetUnfolder]: 1772/3757 cut-off events. [2022-12-06 00:19:13,672 INFO L131 PetriNetUnfolder]: For 323443/329603 co-relation queries the response was YES. [2022-12-06 00:19:13,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80847 conditions, 3757 events. 1772/3757 cut-off events. For 323443/329603 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 31966 event pairs, 59 based on Foata normal form. 13/3760 useless extension candidates. Maximal degree in co-relation 80584. Up to 1694 conditions per place. [2022-12-06 00:19:13,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:13,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 3582 [2022-12-06 00:19:13,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:13,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1425 [2022-12-06 00:19:13,756 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1037 transitions, 55208 flow [2022-12-06 00:19:13,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:13,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:13,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:13,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 00:19:13,756 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:19:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -8375607, now seen corresponding path program 2 times [2022-12-06 00:19:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:13,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947959328] [2022-12-06 00:19:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:13,865 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 00:19:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947959328] [2022-12-06 00:19:13,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947959328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:13,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:13,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:19:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925074120] [2022-12-06 00:19:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:13,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:19:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:19:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:19:13,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:19:13,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1037 transitions, 55208 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:13,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:13,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:19:13,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:18,391 INFO L130 PetriNetUnfolder]: 6837/11418 cut-off events. [2022-12-06 00:19:18,391 INFO L131 PetriNetUnfolder]: For 750678/750678 co-relation queries the response was YES. [2022-12-06 00:19:18,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205477 conditions, 11418 events. 6837/11418 cut-off events. For 750678/750678 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 84269 event pairs, 288 based on Foata normal form. 2/11420 useless extension candidates. Maximal degree in co-relation 204847. Up to 4302 conditions per place. [2022-12-06 00:19:18,529 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 285 selfloop transitions, 787 changer transitions 6/1078 dead transitions. [2022-12-06 00:19:18,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1078 transitions, 58045 flow [2022-12-06 00:19:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:19:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:19:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 00:19:18,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2022-12-06 00:19:18,530 INFO L175 Difference]: Start difference. First operand has 261 places, 1037 transitions, 55208 flow. Second operand 6 states and 101 transitions. [2022-12-06 00:19:18,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 1078 transitions, 58045 flow [2022-12-06 00:19:26,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1078 transitions, 54847 flow, removed 1 selfloop flow, removed 11 redundant places. [2022-12-06 00:19:26,711 INFO L231 Difference]: Finished difference. Result has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:26,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=52027, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=787, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=53492, PETRI_PLACES=255, PETRI_TRANSITIONS=1032} [2022-12-06 00:19:26,712 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 207 predicate places. [2022-12-06 00:19:26,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:26,712 INFO L89 Accepts]: Start accepts. Operand has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:26,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:26,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:26,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:26,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:27,993 INFO L130 PetriNetUnfolder]: 1772/3762 cut-off events. [2022-12-06 00:19:27,993 INFO L131 PetriNetUnfolder]: For 301352/307450 co-relation queries the response was YES. [2022-12-06 00:19:28,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78917 conditions, 3762 events. 1772/3762 cut-off events. For 301352/307450 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 32035 event pairs, 60 based on Foata normal form. 14/3765 useless extension candidates. Maximal degree in co-relation 78645. Up to 1693 conditions per place. [2022-12-06 00:19:28,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:28,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 3572 [2022-12-06 00:19:28,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:28,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1363 [2022-12-06 00:19:28,076 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 1032 transitions, 53492 flow [2022-12-06 00:19:28,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:28,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:28,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:28,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-06 00:19:28,076 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:19:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 47838421, now seen corresponding path program 3 times [2022-12-06 00:19:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561905027] [2022-12-06 00:19:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:28,200 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 00:19:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:28,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561905027] [2022-12-06 00:19:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561905027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:28,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:28,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:19:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426685640] [2022-12-06 00:19:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:28,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:19:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:19:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:19:28,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:19:28,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 1032 transitions, 53492 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:28,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:28,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:19:28,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:32,925 INFO L130 PetriNetUnfolder]: 6892/11527 cut-off events. [2022-12-06 00:19:32,925 INFO L131 PetriNetUnfolder]: For 720577/720577 co-relation queries the response was YES. [2022-12-06 00:19:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203566 conditions, 11527 events. 6892/11527 cut-off events. For 720577/720577 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 85525 event pairs, 280 based on Foata normal form. 70/11597 useless extension candidates. Maximal degree in co-relation 202905. Up to 5159 conditions per place. [2022-12-06 00:19:33,061 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 399 selfloop transitions, 708 changer transitions 17/1124 dead transitions. [2022-12-06 00:19:33,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1124 transitions, 58387 flow [2022-12-06 00:19:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:19:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:19:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-06 00:19:33,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2022-12-06 00:19:33,063 INFO L175 Difference]: Start difference. First operand has 255 places, 1032 transitions, 53492 flow. Second operand 9 states and 161 transitions. [2022-12-06 00:19:33,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1124 transitions, 58387 flow [2022-12-06 00:19:41,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 1124 transitions, 53278 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-12-06 00:19:41,476 INFO L231 Difference]: Finished difference. Result has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:41,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=48597, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=683, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=50887, PETRI_PLACES=250, PETRI_TRANSITIONS=1046} [2022-12-06 00:19:41,478 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 202 predicate places. [2022-12-06 00:19:41,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:41,478 INFO L89 Accepts]: Start accepts. Operand has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:41,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:41,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:41,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:41,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:42,884 INFO L130 PetriNetUnfolder]: 1775/3784 cut-off events. [2022-12-06 00:19:42,884 INFO L131 PetriNetUnfolder]: For 264733/271001 co-relation queries the response was YES. [2022-12-06 00:19:42,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73597 conditions, 3784 events. 1775/3784 cut-off events. For 264733/271001 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 32422 event pairs, 56 based on Foata normal form. 12/3784 useless extension candidates. Maximal degree in co-relation 73333. Up to 1709 conditions per place. [2022-12-06 00:19:42,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:42,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 3592 [2022-12-06 00:19:42,960 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:42,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1483 [2022-12-06 00:19:42,961 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 1046 transitions, 50887 flow [2022-12-06 00:19:42,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:42,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:42,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:42,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 00:19:42,961 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:19:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1536224903, now seen corresponding path program 4 times [2022-12-06 00:19:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063825187] [2022-12-06 00:19:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:43,075 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 00:19:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063825187] [2022-12-06 00:19:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063825187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:43,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:43,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:19:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442157787] [2022-12-06 00:19:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:43,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:19:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:19:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:19:43,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:19:43,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1046 transitions, 50887 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:43,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:43,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:19:43,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:47,879 INFO L130 PetriNetUnfolder]: 7142/12007 cut-off events. [2022-12-06 00:19:47,879 INFO L131 PetriNetUnfolder]: For 669598/669598 co-relation queries the response was YES. [2022-12-06 00:19:47,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197870 conditions, 12007 events. 7142/12007 cut-off events. For 669598/669598 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 90562 event pairs, 359 based on Foata normal form. 82/12089 useless extension candidates. Maximal degree in co-relation 197251. Up to 4945 conditions per place. [2022-12-06 00:19:48,021 INFO L137 encePairwiseOnDemand]: 21/40 looper letters, 347 selfloop transitions, 881 changer transitions 21/1249 dead transitions. [2022-12-06 00:19:48,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1249 transitions, 61637 flow [2022-12-06 00:19:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:19:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:19:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2022-12-06 00:19:48,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-06 00:19:48,026 INFO L175 Difference]: Start difference. First operand has 250 places, 1046 transitions, 50887 flow. Second operand 12 states and 198 transitions. [2022-12-06 00:19:48,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1249 transitions, 61637 flow [2022-12-06 00:19:55,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1249 transitions, 61290 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 00:19:55,610 INFO L231 Difference]: Finished difference. Result has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:55,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=50599, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=767, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=58608, PETRI_PLACES=258, PETRI_TRANSITIONS=1154} [2022-12-06 00:19:55,611 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 210 predicate places. [2022-12-06 00:19:55,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:55,611 INFO L89 Accepts]: Start accepts. Operand has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:55,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:55,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:55,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:55,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:57,011 INFO L130 PetriNetUnfolder]: 1841/3931 cut-off events. [2022-12-06 00:19:57,012 INFO L131 PetriNetUnfolder]: For 295427/300534 co-relation queries the response was YES. [2022-12-06 00:19:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79273 conditions, 3931 events. 1841/3931 cut-off events. For 295427/300534 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 34263 event pairs, 74 based on Foata normal form. 11/3931 useless extension candidates. Maximal degree in co-relation 79031. Up to 1793 conditions per place. [2022-12-06 00:19:57,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:57,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 3820 [2022-12-06 00:19:57,101 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:57,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1491 [2022-12-06 00:19:57,102 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 1154 transitions, 58608 flow [2022-12-06 00:19:57,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:57,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:57,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:57,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 00:19:57,115 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:19:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:57,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1546895691, now seen corresponding path program 5 times [2022-12-06 00:19:57,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:57,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727352665] [2022-12-06 00:19:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:57,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 00:19:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:57,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727352665] [2022-12-06 00:19:57,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727352665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:57,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:57,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:19:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242608300] [2022-12-06 00:19:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:57,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:19:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:19:57,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:19:57,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:19:57,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1154 transitions, 58608 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:57,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:57,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:19:57,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:03,237 INFO L130 PetriNetUnfolder]: 7663/12980 cut-off events. [2022-12-06 00:20:03,237 INFO L131 PetriNetUnfolder]: For 791385/791385 co-relation queries the response was YES. [2022-12-06 00:20:03,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221147 conditions, 12980 events. 7663/12980 cut-off events. For 791385/791385 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 100485 event pairs, 315 based on Foata normal form. 240/13220 useless extension candidates. Maximal degree in co-relation 220526. Up to 4987 conditions per place. [2022-12-06 00:20:03,640 INFO L137 encePairwiseOnDemand]: 21/40 looper letters, 345 selfloop transitions, 907 changer transitions 162/1414 dead transitions. [2022-12-06 00:20:03,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1414 transitions, 73478 flow [2022-12-06 00:20:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:20:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:20:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2022-12-06 00:20:03,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-06 00:20:03,643 INFO L175 Difference]: Start difference. First operand has 258 places, 1154 transitions, 58608 flow. Second operand 12 states and 198 transitions. [2022-12-06 00:20:03,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1414 transitions, 73478 flow [2022-12-06 00:20:14,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1414 transitions, 72091 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:14,094 INFO L231 Difference]: Finished difference. Result has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:14,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=57356, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=762, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=60670, PETRI_PLACES=264, PETRI_TRANSITIONS=1179} [2022-12-06 00:20:14,095 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 216 predicate places. [2022-12-06 00:20:14,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:14,095 INFO L89 Accepts]: Start accepts. Operand has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:14,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:14,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:14,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:14,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:15,463 INFO L130 PetriNetUnfolder]: 1806/4043 cut-off events. [2022-12-06 00:20:15,463 INFO L131 PetriNetUnfolder]: For 297536/301424 co-relation queries the response was YES. [2022-12-06 00:20:15,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81879 conditions, 4043 events. 1806/4043 cut-off events. For 297536/301424 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 36960 event pairs, 81 based on Foata normal form. 9/4043 useless extension candidates. Maximal degree in co-relation 81618. Up to 1876 conditions per place. [2022-12-06 00:20:15,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:15,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 3954 [2022-12-06 00:20:15,548 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:15,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1453 [2022-12-06 00:20:15,548 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1179 transitions, 60670 flow [2022-12-06 00:20:15,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:15,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:15,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 00:20:15,549 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:20:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1435375086, now seen corresponding path program 5 times [2022-12-06 00:20:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:15,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527493458] [2022-12-06 00:20:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:15,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 00:20:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:15,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527493458] [2022-12-06 00:20:15,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527493458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:15,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:15,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446413220] [2022-12-06 00:20:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:15,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:15,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:20:15,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1179 transitions, 60670 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:15,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:20:15,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:22,507 INFO L130 PetriNetUnfolder]: 7246/12429 cut-off events. [2022-12-06 00:20:22,507 INFO L131 PetriNetUnfolder]: For 693074/693074 co-relation queries the response was YES. [2022-12-06 00:20:22,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208866 conditions, 12429 events. 7246/12429 cut-off events. For 693074/693074 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 97289 event pairs, 310 based on Foata normal form. 76/12505 useless extension candidates. Maximal degree in co-relation 208244. Up to 5139 conditions per place. [2022-12-06 00:20:22,656 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 368 selfloop transitions, 862 changer transitions 39/1269 dead transitions. [2022-12-06 00:20:22,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1269 transitions, 65282 flow [2022-12-06 00:20:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:20:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:20:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2022-12-06 00:20:22,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2022-12-06 00:20:22,658 INFO L175 Difference]: Start difference. First operand has 264 places, 1179 transitions, 60670 flow. Second operand 9 states and 167 transitions. [2022-12-06 00:20:22,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1269 transitions, 65282 flow [2022-12-06 00:20:31,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1269 transitions, 64032 flow, removed 134 selfloop flow, removed 7 redundant places. [2022-12-06 00:20:31,856 INFO L231 Difference]: Finished difference. Result has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:31,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=59306, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=847, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=60086, PETRI_PLACES=265, PETRI_TRANSITIONS=1165} [2022-12-06 00:20:31,857 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 217 predicate places. [2022-12-06 00:20:31,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:31,857 INFO L89 Accepts]: Start accepts. Operand has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:31,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:31,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:31,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:31,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:33,302 INFO L130 PetriNetUnfolder]: 1758/4008 cut-off events. [2022-12-06 00:20:33,303 INFO L131 PetriNetUnfolder]: For 292260/296820 co-relation queries the response was YES. [2022-12-06 00:20:33,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81350 conditions, 4008 events. 1758/4008 cut-off events. For 292260/296820 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 37021 event pairs, 80 based on Foata normal form. 9/4007 useless extension candidates. Maximal degree in co-relation 81081. Up to 1872 conditions per place. [2022-12-06 00:20:33,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:33,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 3902 [2022-12-06 00:20:33,383 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:33,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1527 [2022-12-06 00:20:33,384 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 1165 transitions, 60086 flow [2022-12-06 00:20:33,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:33,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:33,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:33,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 00:20:33,384 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 00:20:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1124245470, now seen corresponding path program 6 times [2022-12-06 00:20:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:33,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591362692] [2022-12-06 00:20:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:33,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 00:20:33,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591362692] [2022-12-06 00:20:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591362692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668705796] [2022-12-06 00:20:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:33,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:33,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:20:33,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1165 transitions, 60086 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:33,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:33,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:20:33,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:39,039 INFO L130 PetriNetUnfolder]: 7264/12551 cut-off events. [2022-12-06 00:20:39,039 INFO L131 PetriNetUnfolder]: For 706768/706768 co-relation queries the response was YES. [2022-12-06 00:20:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212137 conditions, 12551 events. 7264/12551 cut-off events. For 706768/706768 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 99395 event pairs, 343 based on Foata normal form. 106/12657 useless extension candidates. Maximal degree in co-relation 211521. Up to 5019 conditions per place. [2022-12-06 00:20:39,229 INFO L137 encePairwiseOnDemand]: 21/40 looper letters, 349 selfloop transitions, 937 changer transitions 52/1338 dead transitions. [2022-12-06 00:20:39,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1338 transitions, 68653 flow [2022-12-06 00:20:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:20:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:20:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2022-12-06 00:20:39,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 00:20:39,231 INFO L175 Difference]: Start difference. First operand has 265 places, 1165 transitions, 60086 flow. Second operand 12 states and 210 transitions. [2022-12-06 00:20:39,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1338 transitions, 68653 flow Received shutdown request... [2022-12-06 00:20:43,377 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 00:20:43,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 00:20:43,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 00:20:43,420 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 00:20:43,421 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 00:20:43,421 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 00:20:43,422 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 00:20:43,422 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 00:20:43,422 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-06 00:20:43,422 INFO L458 BasicCegarLoop]: Path program histogram: [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:43,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:20:43,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:20:43,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:20:43 BasicIcfg [2022-12-06 00:20:43,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:20:43,428 INFO L158 Benchmark]: Toolchain (without parser) took 824502.45ms. Allocated memory was 183.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 159.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 00:20:43,428 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:20:43,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.36ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 143.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:20:43,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:20:43,429 INFO L158 Benchmark]: Boogie Preprocessor took 46.81ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:20:43,430 INFO L158 Benchmark]: RCFGBuilder took 507.57ms. Allocated memory is still 183.5MB. Free memory was 139.5MB in the beginning and 114.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 00:20:43,430 INFO L158 Benchmark]: TraceAbstraction took 823706.01ms. Allocated memory was 183.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 113.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 00:20:43,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.36ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 143.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.81ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 507.57ms. Allocated memory is still 183.5MB. Free memory was 139.5MB in the beginning and 114.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 823706.01ms. Allocated memory was 183.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 113.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 153 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 32 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 63 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 1115, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1106, independent: 1076, independent conditional: 0, independent unconditional: 1076, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1106, independent: 1013, independent conditional: 0, independent unconditional: 1013, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1151, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1106, unknown conditional: 0, unknown unconditional: 1106] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1542, Positive conditional cache size: 0, Positive unconditional cache size: 1542, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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, 45 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 44, independent unconditional: 76, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 106, independent conditional: 52, independent unconditional: 54, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 156, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 24, independent unconditional: 11, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 35, independent conditional: 24, independent unconditional: 11, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 24, independent unconditional: 11, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 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] ], Cache Queries: [ total: 47, independent: 33, independent conditional: 22, independent unconditional: 11, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 31, Positive conditional cache size: 2, Positive unconditional cache size: 29, Negative cache size: 6, Negative conditional cache size: 1, Negative unconditional cache size: 5, 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, 53 PlacesBefore, 53 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 75, independent conditional: 64, independent unconditional: 11, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 75, independent conditional: 64, independent unconditional: 11, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 75, independent conditional: 64, independent unconditional: 11, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 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] ], Cache Queries: [ total: 91, independent: 72, independent conditional: 61, independent unconditional: 11, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 5, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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.2s, 57 PlacesBefore, 56 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, 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: 47, independent: 47, independent conditional: 36, independent unconditional: 11, 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: 47, independent: 47, independent conditional: 36, independent unconditional: 11, 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: 47, independent: 47, independent conditional: 36, independent unconditional: 11, 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: 47, independent: 40, independent conditional: 29, independent unconditional: 11, 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): 48, Positive cache size: 41, Positive conditional cache size: 12, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 71 PlacesBefore, 70 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 700 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): 51, Positive cache size: 44, Positive conditional cache size: 15, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 70 PlacesBefore, 70 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 45, Positive conditional cache size: 16, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 67 PlacesBefore, 67 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 670 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): 52, Positive cache size: 45, Positive conditional cache size: 16, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 656 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): 52, Positive cache size: 45, Positive conditional cache size: 16, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 66 PlacesAfterwards, 105 TransitionsBefore, 104 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 17, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 47 TransitionsBefore, 47 TransitionsAfterwards, 390 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): 53, Positive cache size: 46, Positive conditional cache size: 17, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 814 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): 53, Positive cache size: 46, Positive conditional cache size: 17, Positive unconditional cache size: 29, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 67 PlacesBefore, 65 PlacesAfterwards, 157 TransitionsBefore, 155 TransitionsAfterwards, 1066 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 42, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 60, Positive conditional cache size: 25, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 70 PlacesBefore, 70 PlacesAfterwards, 236 TransitionsBefore, 236 TransitionsAfterwards, 1474 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): 67, Positive cache size: 60, Positive conditional cache size: 25, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 355 TransitionsBefore, 355 TransitionsAfterwards, 1898 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): 67, Positive cache size: 60, Positive conditional cache size: 25, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 89 PlacesBefore, 89 PlacesAfterwards, 380 TransitionsBefore, 380 TransitionsAfterwards, 1932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 70, Positive cache size: 63, Positive conditional cache size: 28, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 97 PlacesBefore, 97 PlacesAfterwards, 480 TransitionsBefore, 480 TransitionsAfterwards, 2360 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): 70, Positive cache size: 63, Positive conditional cache size: 28, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 103 PlacesBefore, 103 PlacesAfterwards, 470 TransitionsBefore, 470 TransitionsAfterwards, 2324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 29, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 112 PlacesBefore, 112 PlacesAfterwards, 507 TransitionsBefore, 507 TransitionsAfterwards, 2526 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): 71, Positive cache size: 64, Positive conditional cache size: 29, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 113 PlacesBefore, 113 PlacesAfterwards, 429 TransitionsBefore, 429 TransitionsAfterwards, 1862 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 121 PlacesBefore, 121 PlacesAfterwards, 557 TransitionsBefore, 557 TransitionsAfterwards, 2514 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 125 PlacesBefore, 125 PlacesAfterwards, 605 TransitionsBefore, 605 TransitionsAfterwards, 2694 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 627 TransitionsBefore, 627 TransitionsAfterwards, 2726 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 135 PlacesBefore, 135 PlacesAfterwards, 698 TransitionsBefore, 698 TransitionsAfterwards, 3196 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 701 TransitionsBefore, 701 TransitionsAfterwards, 2958 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): 78, Positive cache size: 71, Positive conditional cache size: 36, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 151 PlacesBefore, 150 PlacesAfterwards, 679 TransitionsBefore, 678 TransitionsAfterwards, 2854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 154 PlacesBefore, 154 PlacesAfterwards, 807 TransitionsBefore, 807 TransitionsAfterwards, 3186 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 158 PlacesBefore, 158 PlacesAfterwards, 809 TransitionsBefore, 809 TransitionsAfterwards, 3158 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 162 PlacesBefore, 162 PlacesAfterwards, 859 TransitionsBefore, 859 TransitionsAfterwards, 3270 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 165 PlacesBefore, 165 PlacesAfterwards, 908 TransitionsBefore, 908 TransitionsAfterwards, 3448 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 170 PlacesBefore, 170 PlacesAfterwards, 935 TransitionsBefore, 935 TransitionsAfterwards, 3518 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 173 PlacesBefore, 173 PlacesAfterwards, 935 TransitionsBefore, 935 TransitionsAfterwards, 3502 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 179 PlacesBefore, 179 PlacesAfterwards, 987 TransitionsBefore, 987 TransitionsAfterwards, 3606 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 1020 TransitionsBefore, 1020 TransitionsAfterwards, 3680 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): 87, Positive cache size: 80, Positive conditional cache size: 41, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 188 PlacesBefore, 188 PlacesAfterwards, 1026 TransitionsBefore, 1026 TransitionsAfterwards, 3680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 199 PlacesBefore, 199 PlacesAfterwards, 1158 TransitionsBefore, 1158 TransitionsAfterwards, 4006 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): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 1155 TransitionsBefore, 1155 TransitionsAfterwards, 3992 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): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 1154 TransitionsBefore, 1154 TransitionsAfterwards, 3982 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): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 214 PlacesBefore, 214 PlacesAfterwards, 1177 TransitionsBefore, 1177 TransitionsAfterwards, 4092 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): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 220 PlacesBefore, 220 PlacesAfterwards, 1152 TransitionsBefore, 1152 TransitionsAfterwards, 4038 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): 93, Positive cache size: 86, Positive conditional cache size: 45, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 229 PlacesBefore, 228 PlacesAfterwards, 1145 TransitionsBefore, 1144 TransitionsAfterwards, 4024 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 87, Positive conditional cache size: 46, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 231 PlacesBefore, 231 PlacesAfterwards, 1140 TransitionsBefore, 1140 TransitionsAfterwards, 4014 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): 94, Positive cache size: 87, Positive conditional cache size: 46, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 236 PlacesBefore, 236 PlacesAfterwards, 1143 TransitionsBefore, 1143 TransitionsAfterwards, 4020 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): 94, Positive cache size: 87, Positive conditional cache size: 46, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 242 PlacesBefore, 240 PlacesAfterwards, 1143 TransitionsBefore, 1141 TransitionsAfterwards, 4020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 89, Positive conditional cache size: 48, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 242 PlacesBefore, 240 PlacesAfterwards, 1141 TransitionsBefore, 1139 TransitionsAfterwards, 4016 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 91, Positive conditional cache size: 50, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 245 PlacesBefore, 245 PlacesAfterwards, 1138 TransitionsBefore, 1138 TransitionsAfterwards, 4010 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): 98, Positive cache size: 91, Positive conditional cache size: 50, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 250 PlacesBefore, 250 PlacesAfterwards, 1137 TransitionsBefore, 1137 TransitionsAfterwards, 4008 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): 98, Positive cache size: 91, Positive conditional cache size: 50, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 254 PlacesBefore, 252 PlacesAfterwards, 1136 TransitionsBefore, 1134 TransitionsAfterwards, 4006 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 98, Positive conditional cache size: 55, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 248 PlacesBefore, 247 PlacesAfterwards, 1136 TransitionsBefore, 1135 TransitionsAfterwards, 4002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 102, Positive conditional cache size: 57, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 247 PlacesBefore, 247 PlacesAfterwards, 1134 TransitionsBefore, 1134 TransitionsAfterwards, 3998 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): 109, Positive cache size: 102, Positive conditional cache size: 57, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 251 PlacesBefore, 251 PlacesAfterwards, 1131 TransitionsBefore, 1131 TransitionsAfterwards, 3992 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): 109, Positive cache size: 102, Positive conditional cache size: 57, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 255 PlacesBefore, 255 PlacesAfterwards, 1130 TransitionsBefore, 1130 TransitionsAfterwards, 3990 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 112, Positive cache size: 105, Positive conditional cache size: 60, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 259 PlacesBefore, 259 PlacesAfterwards, 1131 TransitionsBefore, 1131 TransitionsAfterwards, 3992 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): 112, Positive cache size: 105, Positive conditional cache size: 60, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 1129 TransitionsBefore, 1129 TransitionsAfterwards, 3984 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): 112, Positive cache size: 105, Positive conditional cache size: 60, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 264 PlacesBefore, 264 PlacesAfterwards, 1125 TransitionsBefore, 1125 TransitionsAfterwards, 3972 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): 112, Positive cache size: 105, Positive conditional cache size: 60, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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.8s, 272 PlacesBefore, 268 PlacesAfterwards, 1122 TransitionsBefore, 1119 TransitionsAfterwards, 3962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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] , 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: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 116, Positive conditional cache size: 69, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 266 PlacesBefore, 264 PlacesAfterwards, 1115 TransitionsBefore, 1114 TransitionsAfterwards, 3944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 118, Positive conditional cache size: 71, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 258 PlacesBefore, 258 PlacesAfterwards, 1113 TransitionsBefore, 1113 TransitionsAfterwards, 3940 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): 125, Positive cache size: 118, Positive conditional cache size: 71, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 263 PlacesBefore, 263 PlacesAfterwards, 1121 TransitionsBefore, 1121 TransitionsAfterwards, 3956 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): 125, Positive cache size: 118, Positive conditional cache size: 71, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 267 PlacesBefore, 267 PlacesAfterwards, 1120 TransitionsBefore, 1120 TransitionsAfterwards, 3954 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 119, Positive conditional cache size: 72, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 272 PlacesBefore, 272 PlacesAfterwards, 1111 TransitionsBefore, 1111 TransitionsAfterwards, 3932 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): 126, Positive cache size: 119, Positive conditional cache size: 72, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 268 PlacesBefore, 268 PlacesAfterwards, 1126 TransitionsBefore, 1126 TransitionsAfterwards, 3934 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): 126, Positive cache size: 119, Positive conditional cache size: 72, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 272 PlacesBefore, 272 PlacesAfterwards, 1103 TransitionsBefore, 1103 TransitionsAfterwards, 3872 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): 126, Positive cache size: 119, Positive conditional cache size: 72, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 272 PlacesBefore, 271 PlacesAfterwards, 1068 TransitionsBefore, 1067 TransitionsAfterwards, 3778 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 2, independent conditional: 2, 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): 129, Positive cache size: 122, Positive conditional cache size: 75, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 270 PlacesBefore, 270 PlacesAfterwards, 1079 TransitionsBefore, 1079 TransitionsAfterwards, 3798 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): 129, Positive cache size: 122, Positive conditional cache size: 75, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 273 PlacesBefore, 273 PlacesAfterwards, 1075 TransitionsBefore, 1075 TransitionsAfterwards, 3790 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): 129, Positive cache size: 122, Positive conditional cache size: 75, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 274 PlacesBefore, 274 PlacesAfterwards, 1067 TransitionsBefore, 1067 TransitionsAfterwards, 3774 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): 129, Positive cache size: 122, Positive conditional cache size: 75, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 272 PlacesBefore, 272 PlacesAfterwards, 1115 TransitionsBefore, 1115 TransitionsAfterwards, 3806 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): 129, Positive cache size: 122, Positive conditional cache size: 75, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 273 PlacesBefore, 270 PlacesAfterwards, 1114 TransitionsBefore, 1112 TransitionsAfterwards, 3804 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 6, independent conditional: 6, 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): 139, Positive cache size: 132, Positive conditional cache size: 81, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 270 PlacesBefore, 270 PlacesAfterwards, 1084 TransitionsBefore, 1084 TransitionsAfterwards, 3684 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): 139, Positive cache size: 132, Positive conditional cache size: 81, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 1077 TransitionsBefore, 1077 TransitionsAfterwards, 3670 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): 139, Positive cache size: 132, Positive conditional cache size: 81, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 265 PlacesBefore, 265 PlacesAfterwards, 1063 TransitionsBefore, 1063 TransitionsAfterwards, 3642 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): 139, Positive cache size: 132, Positive conditional cache size: 81, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 263 PlacesBefore, 263 PlacesAfterwards, 1056 TransitionsBefore, 1056 TransitionsAfterwards, 3628 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 140, Positive conditional cache size: 89, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 260 PlacesBefore, 260 PlacesAfterwards, 1048 TransitionsBefore, 1048 TransitionsAfterwards, 3612 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): 147, Positive cache size: 140, Positive conditional cache size: 89, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 1064 TransitionsBefore, 1064 TransitionsAfterwards, 3656 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): 147, Positive cache size: 140, Positive conditional cache size: 89, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 263 PlacesBefore, 263 PlacesAfterwards, 1062 TransitionsBefore, 1062 TransitionsAfterwards, 3652 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): 147, Positive cache size: 140, Positive conditional cache size: 89, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 271 PlacesBefore, 271 PlacesAfterwards, 1063 TransitionsBefore, 1063 TransitionsAfterwards, 3654 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): 147, Positive cache size: 140, Positive conditional cache size: 89, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 272 PlacesBefore, 271 PlacesAfterwards, 1042 TransitionsBefore, 1041 TransitionsAfterwards, 3592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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, 261 PlacesBefore, 261 PlacesAfterwards, 1037 TransitionsBefore, 1037 TransitionsAfterwards, 3582 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 255 PlacesBefore, 255 PlacesAfterwards, 1032 TransitionsBefore, 1032 TransitionsAfterwards, 3572 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 250 PlacesBefore, 250 PlacesAfterwards, 1046 TransitionsBefore, 1046 TransitionsAfterwards, 3592 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 258 PlacesBefore, 258 PlacesAfterwards, 1154 TransitionsBefore, 1154 TransitionsAfterwards, 3820 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 264 PlacesBefore, 264 PlacesAfterwards, 1179 TransitionsBefore, 1179 TransitionsAfterwards, 3954 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 265 PlacesBefore, 265 PlacesAfterwards, 1165 TransitionsBefore, 1165 TransitionsAfterwards, 3902 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): 148, Positive cache size: 141, Positive conditional cache size: 90, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 168]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 159]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 198 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 823.6s, OverallIterations: 85, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 713.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3154 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3154 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30285 IncrementalHoareTripleChecker+Invalid, 33033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2748 mSolverCounterUnsat, 0 mSDtfsCounter, 30285 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60670occurred in iteration=83, InterpolantAutomatonStates: 643, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2327 NumberOfCodeBlocks, 2327 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 7528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 85 InterpolantComputations, 85 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown