/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/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:19:01,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:19:01,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:19:01,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:19:01,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:19:01,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:19:01,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:19:01,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:19:01,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:19:01,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:19:01,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:19:01,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:19:01,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:19:01,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:19:01,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:19:01,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:19:01,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:19:01,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:19:01,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:19:01,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:19:01,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:19:01,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:19:01,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:19:01,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:19:01,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:19:01,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:19:01,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:19:01,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:19:01,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:19:01,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:19:01,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:19:01,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:19:01,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:19:01,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:19:01,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:19:01,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:19:01,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:19:01,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:19:01,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:19:01,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:19:01,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:19:01,477 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-05 23:19:01,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:19:01,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:19:01,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:19:01,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:19:01,504 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:19:01,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:19:01,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:19:01,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:19:01,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:19:01,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:19:01,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:19:01,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:01,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:19:01,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:19:01,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:19:01,508 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-05 23:19:01,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:19:01,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:19:01,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:19:01,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:19:01,803 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:19:01,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:19:02,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:19:02,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:19:02,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:19:03,011 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8487b01a0/bf09c1887a0f4210a1b0ebd9326086bc/FLAG384fa5995 [2022-12-05 23:19:03,030 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8487b01a0/bf09c1887a0f4210a1b0ebd9326086bc [2022-12-05 23:19:03,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:19:03,035 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:19:03,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:03,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:19:03,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:19:03,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cf66aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03, skipping insertion in model container [2022-12-05 23:19:03,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:19:03,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:19:03,223 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:19:03,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:03,383 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:19:03,393 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:19:03,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:03,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:03,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:03,470 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:19:03,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03 WrapperNode [2022-12-05 23:19:03,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:03,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:03,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:19:03,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:19:03,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,518 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2022-12-05 23:19:03,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:03,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:19:03,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:19:03,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:19:03,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,545 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:19:03,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:19:03,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:19:03,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:19:03,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (1/1) ... [2022-12-05 23:19:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:19:03,612 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-05 23:19:03,620 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-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:19:03,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:19:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:19:03,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:19:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:19:03,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:19:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:19:03,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:19:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:19:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:19:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:19:03,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:19:03,661 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:19:03,815 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:19:03,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:19:03,953 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:19:03,958 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:19:03,958 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:19:03,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:03 BoogieIcfgContainer [2022-12-05 23:19:03,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:19:03,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:19:03,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:19:03,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:19:03,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:19:03" (1/3) ... [2022-12-05 23:19:03,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cbeb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:03, skipping insertion in model container [2022-12-05 23:19:03,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:03" (2/3) ... [2022-12-05 23:19:03,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cbeb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:03, skipping insertion in model container [2022-12-05 23:19:03,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:03" (3/3) ... [2022-12-05 23:19:03,965 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:19:03,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:19:03,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:19:03,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:19:04,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:19:04,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 100 transitions, 220 flow [2022-12-05 23:19:04,111 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-12-05 23:19:04,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:04,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-05 23:19:04,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 100 transitions, 220 flow [2022-12-05 23:19:04,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 82 transitions, 176 flow [2022-12-05 23:19:04,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:04,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 82 transitions, 176 flow [2022-12-05 23:19:04,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 82 transitions, 176 flow [2022-12-05 23:19:04,190 INFO L130 PetriNetUnfolder]: 1/82 cut-off events. [2022-12-05 23:19:04,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:04,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 82 events. 1/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 23:19:04,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 82 transitions, 176 flow [2022-12-05 23:19:04,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-05 23:19:06,133 INFO L203 LiptonReduction]: Total number of compositions: 62 [2022-12-05 23:19:06,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:19:06,156 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;@2868de6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:19:06,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:19:06,160 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:19:06,160 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:06,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:06,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:06,161 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 2 more)] === [2022-12-05 23:19:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash -793814867, now seen corresponding path program 1 times [2022-12-05 23:19:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973561516] [2022-12-05 23:19:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:06,504 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-05 23:19:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973561516] [2022-12-05 23:19:06,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973561516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:06,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:06,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606906148] [2022-12-05 23:19:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:06,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:06,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:06,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:06,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:19:06,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:06,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:06,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:19:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:06,788 INFO L130 PetriNetUnfolder]: 1299/1851 cut-off events. [2022-12-05 23:19:06,789 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-05 23:19:06,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1851 events. 1299/1851 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7514 event pairs, 339 based on Foata normal form. 9/1860 useless extension candidates. Maximal degree in co-relation 3826. Up to 1795 conditions per place. [2022-12-05 23:19:06,804 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-05 23:19:06,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 153 flow [2022-12-05 23:19:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:19:06,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:19:06,814 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 54 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:19:06,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 153 flow [2022-12-05 23:19:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:19:06,820 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-05 23:19:06,825 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2022-12-05 23:19:06,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:06,826 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,828 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:06,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:06,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,835 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-05 23:19:06,835 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:06,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-05 23:19:06,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-05 23:19:06,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:06,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:19:06,855 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 67 flow [2022-12-05 23:19:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:06,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:06,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:06,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:19:06,859 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 2 more)] === [2022-12-05 23:19:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1161541770, now seen corresponding path program 1 times [2022-12-05 23:19:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:06,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541934147] [2022-12-05 23:19:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:07,023 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-05 23:19:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:07,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541934147] [2022-12-05 23:19:07,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541934147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:07,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:07,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649659239] [2022-12-05 23:19:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:07,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:07,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:19:07,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:07,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:19:07,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:07,109 INFO L130 PetriNetUnfolder]: 623/992 cut-off events. [2022-12-05 23:19:07,110 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2022-12-05 23:19:07,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 992 events. 623/992 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4558 event pairs, 161 based on Foata normal form. 18/1009 useless extension candidates. Maximal degree in co-relation 2264. Up to 688 conditions per place. [2022-12-05 23:19:07,115 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2022-12-05 23:19:07,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 141 flow [2022-12-05 23:19:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:19:07,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-05 23:19:07,116 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 67 flow. Second operand 3 states and 34 transitions. [2022-12-05 23:19:07,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 141 flow [2022-12-05 23:19:07,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:07,118 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-05 23:19:07,119 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-05 23:19:07,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:07,119 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,119 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:07,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:07,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,123 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-05 23:19:07,123 INFO L131 PetriNetUnfolder]: For 4/8 co-relation queries the response was YES. [2022-12-05 23:19:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 26 events. 2/26 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 43. Up to 8 conditions per place. [2022-12-05 23:19:07,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-05 23:19:07,126 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:07,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 23:19:07,126 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 75 flow [2022-12-05 23:19:07,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:07,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:07,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:19:07,127 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 2 more)] === [2022-12-05 23:19:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:07,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1161542328, now seen corresponding path program 1 times [2022-12-05 23:19:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:07,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154400755] [2022-12-05 23:19:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:07,274 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-05 23:19:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154400755] [2022-12-05 23:19:07,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154400755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:07,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:07,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:07,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336036436] [2022-12-05 23:19:07,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:07,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:07,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:07,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 75 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:07,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:07,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:07,453 INFO L130 PetriNetUnfolder]: 1426/2036 cut-off events. [2022-12-05 23:19:07,454 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2022-12-05 23:19:07,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2036 events. 1426/2036 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8548 event pairs, 154 based on Foata normal form. 36/2072 useless extension candidates. Maximal degree in co-relation 4860. Up to 1310 conditions per place. [2022-12-05 23:19:07,467 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 51 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-05 23:19:07,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 323 flow [2022-12-05 23:19:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-05 23:19:07,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-05 23:19:07,469 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 75 flow. Second operand 5 states and 64 transitions. [2022-12-05 23:19:07,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 323 flow [2022-12-05 23:19:07,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:07,473 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-05 23:19:07,474 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-05 23:19:07,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:07,474 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,476 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:07,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:07,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,485 INFO L130 PetriNetUnfolder]: 25/87 cut-off events. [2022-12-05 23:19:07,486 INFO L131 PetriNetUnfolder]: For 89/196 co-relation queries the response was YES. [2022-12-05 23:19:07,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 87 events. 25/87 cut-off events. For 89/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 333 event pairs, 4 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 240. Up to 42 conditions per place. [2022-12-05 23:19:07,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 23:19:07,509 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:07,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-05 23:19:07,510 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 166 flow [2022-12-05 23:19:07,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:07,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:07,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:19:07,511 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 2 more)] === [2022-12-05 23:19:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1648068424, now seen corresponding path program 1 times [2022-12-05 23:19:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:07,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920268269] [2022-12-05 23:19:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:07,627 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-05 23:19:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920268269] [2022-12-05 23:19:07,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920268269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:07,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:07,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620092365] [2022-12-05 23:19:07,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:07,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:07,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:07,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 166 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:07,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:07,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:07,917 INFO L130 PetriNetUnfolder]: 1356/1942 cut-off events. [2022-12-05 23:19:07,917 INFO L131 PetriNetUnfolder]: For 2189/2189 co-relation queries the response was YES. [2022-12-05 23:19:07,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6164 conditions, 1942 events. 1356/1942 cut-off events. For 2189/2189 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8023 event pairs, 534 based on Foata normal form. 24/1966 useless extension candidates. Maximal degree in co-relation 6148. Up to 1643 conditions per place. [2022-12-05 23:19:07,945 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 42 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-05 23:19:07,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 318 flow [2022-12-05 23:19:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:19:07,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:19:07,964 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 166 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:19:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 318 flow [2022-12-05 23:19:07,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:07,967 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-05 23:19:07,968 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-05 23:19:07,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:07,968 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,968 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:07,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:07,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,974 INFO L130 PetriNetUnfolder]: 27/83 cut-off events. [2022-12-05 23:19:07,974 INFO L131 PetriNetUnfolder]: For 145/236 co-relation queries the response was YES. [2022-12-05 23:19:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 83 events. 27/83 cut-off events. For 145/236 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 298 event pairs, 5 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 243. Up to 41 conditions per place. [2022-12-05 23:19:07,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 23:19:07,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:07,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:19:07,998 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 179 flow [2022-12-05 23:19:07,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:07,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:07,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:07,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:19:07,998 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 2 more)] === [2022-12-05 23:19:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1684917411, now seen corresponding path program 1 times [2022-12-05 23:19:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:07,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77232512] [2022-12-05 23:19:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:07,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:08,181 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-05 23:19:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:08,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77232512] [2022-12-05 23:19:08,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77232512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:08,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:08,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:08,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836728577] [2022-12-05 23:19:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:08,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:08,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:08,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 179 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:08,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:08,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:08,358 INFO L130 PetriNetUnfolder]: 1548/2213 cut-off events. [2022-12-05 23:19:08,358 INFO L131 PetriNetUnfolder]: For 3753/3753 co-relation queries the response was YES. [2022-12-05 23:19:08,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7022 conditions, 2213 events. 1548/2213 cut-off events. For 3753/3753 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9109 event pairs, 137 based on Foata normal form. 27/2240 useless extension candidates. Maximal degree in co-relation 7004. Up to 1128 conditions per place. [2022-12-05 23:19:08,369 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 60 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2022-12-05 23:19:08,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 80 transitions, 592 flow [2022-12-05 23:19:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-05 23:19:08,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-05 23:19:08,372 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 179 flow. Second operand 5 states and 56 transitions. [2022-12-05 23:19:08,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 80 transitions, 592 flow [2022-12-05 23:19:08,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:08,378 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2022-12-05 23:19:08,380 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-12-05 23:19:08,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:08,380 INFO L89 Accepts]: Start accepts. Operand has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,381 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:08,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:08,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,393 INFO L130 PetriNetUnfolder]: 69/175 cut-off events. [2022-12-05 23:19:08,394 INFO L131 PetriNetUnfolder]: For 522/646 co-relation queries the response was YES. [2022-12-05 23:19:08,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 175 events. 69/175 cut-off events. For 522/646 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 809 event pairs, 6 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 684. Up to 86 conditions per place. [2022-12-05 23:19:08,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-05 23:19:08,398 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:08,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:19:08,398 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 380 flow [2022-12-05 23:19:08,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:08,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:08,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:19:08,399 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 2 more)] === [2022-12-05 23:19:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -744882975, now seen corresponding path program 1 times [2022-12-05 23:19:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47507398] [2022-12-05 23:19:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:08,480 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-05 23:19:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:08,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47507398] [2022-12-05 23:19:08,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47507398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:08,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124937171] [2022-12-05 23:19:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:08,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:08,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 380 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:08,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:08,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:08,685 INFO L130 PetriNetUnfolder]: 1811/2614 cut-off events. [2022-12-05 23:19:08,685 INFO L131 PetriNetUnfolder]: For 7605/7605 co-relation queries the response was YES. [2022-12-05 23:19:08,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9473 conditions, 2614 events. 1811/2614 cut-off events. For 7605/7605 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11003 event pairs, 414 based on Foata normal form. 78/2692 useless extension candidates. Maximal degree in co-relation 9452. Up to 938 conditions per place. [2022-12-05 23:19:08,694 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 44 selfloop transitions, 8 changer transitions 25/77 dead transitions. [2022-12-05 23:19:08,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 700 flow [2022-12-05 23:19:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 23:19:08,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:19:08,695 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 380 flow. Second operand 4 states and 40 transitions. [2022-12-05 23:19:08,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 700 flow [2022-12-05 23:19:08,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:08,699 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-05 23:19:08,700 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-05 23:19:08,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:08,700 INFO L89 Accepts]: Start accepts. Operand has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,701 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:08,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:08,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,707 INFO L130 PetriNetUnfolder]: 27/84 cut-off events. [2022-12-05 23:19:08,707 INFO L131 PetriNetUnfolder]: For 217/219 co-relation queries the response was YES. [2022-12-05 23:19:08,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 84 events. 27/84 cut-off events. For 217/219 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 268 event pairs, 4 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 356. Up to 41 conditions per place. [2022-12-05 23:19:08,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-05 23:19:08,709 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:08,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:19:08,710 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 263 flow [2022-12-05 23:19:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:08,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:08,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:19:08,710 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 2 more)] === [2022-12-05 23:19:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 692828177, now seen corresponding path program 1 times [2022-12-05 23:19:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:08,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923132901] [2022-12-05 23:19:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:08,783 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-05 23:19:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923132901] [2022-12-05 23:19:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923132901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:08,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308586344] [2022-12-05 23:19:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:08,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:08,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 263 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:08,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:08,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:08,896 INFO L130 PetriNetUnfolder]: 887/1328 cut-off events. [2022-12-05 23:19:08,896 INFO L131 PetriNetUnfolder]: For 4202/4202 co-relation queries the response was YES. [2022-12-05 23:19:08,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1328 events. 887/1328 cut-off events. For 4202/4202 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5389 event pairs, 355 based on Foata normal form. 54/1382 useless extension candidates. Maximal degree in co-relation 4830. Up to 600 conditions per place. [2022-12-05 23:19:08,901 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 36 selfloop transitions, 6 changer transitions 17/59 dead transitions. [2022-12-05 23:19:08,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 511 flow [2022-12-05 23:19:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-05 23:19:08,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-05 23:19:08,903 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 263 flow. Second operand 4 states and 46 transitions. [2022-12-05 23:19:08,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 511 flow [2022-12-05 23:19:08,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 445 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-05 23:19:08,908 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2022-12-05 23:19:08,908 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2022-12-05 23:19:08,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:08,909 INFO L89 Accepts]: Start accepts. Operand has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,909 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:08,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:08,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,913 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-05 23:19:08,913 INFO L131 PetriNetUnfolder]: For 104/106 co-relation queries the response was YES. [2022-12-05 23:19:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 45 events. 10/45 cut-off events. For 104/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 6 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 184. Up to 21 conditions per place. [2022-12-05 23:19:08,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-05 23:19:08,919 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:08,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:19:08,920 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 176 flow [2022-12-05 23:19:08,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:08,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:08,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:19:08,920 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 2 more)] === [2022-12-05 23:19:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1049215771, now seen corresponding path program 1 times [2022-12-05 23:19:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:08,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114860678] [2022-12-05 23:19:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:09,024 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-05 23:19:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:09,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114860678] [2022-12-05 23:19:09,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114860678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:09,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:09,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240773736] [2022-12-05 23:19:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:09,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:09,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:09,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:09,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:19:09,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:09,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:09,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:19:09,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:09,103 INFO L130 PetriNetUnfolder]: 377/616 cut-off events. [2022-12-05 23:19:09,104 INFO L131 PetriNetUnfolder]: For 4513/4822 co-relation queries the response was YES. [2022-12-05 23:19:09,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 616 events. 377/616 cut-off events. For 4513/4822 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2700 event pairs, 110 based on Foata normal form. 35/605 useless extension candidates. Maximal degree in co-relation 2411. Up to 389 conditions per place. [2022-12-05 23:19:09,107 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 60 selfloop transitions, 9 changer transitions 2/73 dead transitions. [2022-12-05 23:19:09,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 635 flow [2022-12-05 23:19:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 23:19:09,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-05 23:19:09,108 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 176 flow. Second operand 5 states and 59 transitions. [2022-12-05 23:19:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 635 flow [2022-12-05 23:19:09,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 564 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-05 23:19:09,112 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 222 flow [2022-12-05 23:19:09,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2022-12-05 23:19:09,114 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-05 23:19:09,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:09,114 INFO L89 Accepts]: Start accepts. Operand has 50 places, 34 transitions, 222 flow [2022-12-05 23:19:09,116 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:09,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:09,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 34 transitions, 222 flow [2022-12-05 23:19:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 34 transitions, 222 flow [2022-12-05 23:19:09,150 INFO L130 PetriNetUnfolder]: 174/319 cut-off events. [2022-12-05 23:19:09,150 INFO L131 PetriNetUnfolder]: For 1243/1443 co-relation queries the response was YES. [2022-12-05 23:19:09,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 319 events. 174/319 cut-off events. For 1243/1443 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1462 event pairs, 95 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 1208. Up to 235 conditions per place. [2022-12-05 23:19:09,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 34 transitions, 222 flow [2022-12-05 23:19:09,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-05 23:19:09,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L797-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [298] L771-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_149 (+ v_~__unbuffered_cnt~0_150 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:19:09,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L797-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [244] L744-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-05 23:19:09,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L797-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [282] L732-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P0Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-05 23:19:09,297 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:19:09,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-05 23:19:09,297 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 198 flow [2022-12-05 23:19:09,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:09,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:09,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:09,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:19:09,298 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 2 more)] === [2022-12-05 23:19:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2094325370, now seen corresponding path program 1 times [2022-12-05 23:19:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794949585] [2022-12-05 23:19:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:09,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-05 23:19:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794949585] [2022-12-05 23:19:09,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794949585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:09,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:09,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166774057] [2022-12-05 23:19:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:09,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:09,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:19:09,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 5.0) 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-05 23:19:09,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:09,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:19:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:09,464 INFO L130 PetriNetUnfolder]: 260/448 cut-off events. [2022-12-05 23:19:09,464 INFO L131 PetriNetUnfolder]: For 3190/3470 co-relation queries the response was YES. [2022-12-05 23:19:09,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 448 events. 260/448 cut-off events. For 3190/3470 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1876 event pairs, 36 based on Foata normal form. 49/468 useless extension candidates. Maximal degree in co-relation 2060. Up to 273 conditions per place. [2022-12-05 23:19:09,467 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 63 selfloop transitions, 13 changer transitions 3/81 dead transitions. [2022-12-05 23:19:09,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 692 flow [2022-12-05 23:19:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:19:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:19:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-05 23:19:09,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-05 23:19:09,468 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 198 flow. Second operand 6 states and 71 transitions. [2022-12-05 23:19:09,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 692 flow [2022-12-05 23:19:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 685 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:09,472 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 301 flow [2022-12-05 23:19:09,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-05 23:19:09,473 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-12-05 23:19:09,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:09,473 INFO L89 Accepts]: Start accepts. Operand has 54 places, 38 transitions, 301 flow [2022-12-05 23:19:09,474 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:09,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:09,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 301 flow [2022-12-05 23:19:09,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 38 transitions, 301 flow [2022-12-05 23:19:09,488 INFO L130 PetriNetUnfolder]: 116/241 cut-off events. [2022-12-05 23:19:09,488 INFO L131 PetriNetUnfolder]: For 1505/1841 co-relation queries the response was YES. [2022-12-05 23:19:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 241 events. 116/241 cut-off events. For 1505/1841 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1063 event pairs, 29 based on Foata normal form. 7/229 useless extension candidates. Maximal degree in co-relation 1220. Up to 186 conditions per place. [2022-12-05 23:19:09,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 301 flow [2022-12-05 23:19:09,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-05 23:19:09,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:09,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-05 23:19:09,508 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 293 flow [2022-12-05 23:19:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) 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-05 23:19:09,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:09,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:09,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:19:09,509 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 2 more)] === [2022-12-05 23:19:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1322802192, now seen corresponding path program 1 times [2022-12-05 23:19:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:09,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939949411] [2022-12-05 23:19:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:09,584 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-05 23:19:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939949411] [2022-12-05 23:19:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939949411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582623895] [2022-12-05 23:19:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:09,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:09,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:09,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:09,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 293 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:09,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:09,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:09,664 INFO L130 PetriNetUnfolder]: 303/525 cut-off events. [2022-12-05 23:19:09,664 INFO L131 PetriNetUnfolder]: For 3053/3053 co-relation queries the response was YES. [2022-12-05 23:19:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 525 events. 303/525 cut-off events. For 3053/3053 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2016 event pairs, 53 based on Foata normal form. 15/540 useless extension candidates. Maximal degree in co-relation 2928. Up to 343 conditions per place. [2022-12-05 23:19:09,667 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 51 selfloop transitions, 10 changer transitions 2/63 dead transitions. [2022-12-05 23:19:09,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 599 flow [2022-12-05 23:19:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:19:09,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-05 23:19:09,668 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 293 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:19:09,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 599 flow [2022-12-05 23:19:09,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 516 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-05 23:19:09,672 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 297 flow [2022-12-05 23:19:09,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2022-12-05 23:19:09,673 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-12-05 23:19:09,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:09,673 INFO L89 Accepts]: Start accepts. Operand has 54 places, 37 transitions, 297 flow [2022-12-05 23:19:09,673 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:09,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:09,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 297 flow [2022-12-05 23:19:09,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 37 transitions, 297 flow [2022-12-05 23:19:09,688 INFO L130 PetriNetUnfolder]: 125/254 cut-off events. [2022-12-05 23:19:09,688 INFO L131 PetriNetUnfolder]: For 1076/1202 co-relation queries the response was YES. [2022-12-05 23:19:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 254 events. 125/254 cut-off events. For 1076/1202 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1111 event pairs, 28 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 1064. Up to 183 conditions per place. [2022-12-05 23:19:09,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 297 flow [2022-12-05 23:19:09,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-05 23:19:09,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [269] $Ultimate##0-->L756: Formula: (and (= v_~x~0_20 v_~__unbuffered_p2_EAX~0_27) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_20} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] and [206] L729-->L732: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-05 23:19:09,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:09,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-05 23:19:09,716 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 303 flow [2022-12-05 23:19:09,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:09,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:09,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:09,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:19:09,716 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 2 more)] === [2022-12-05 23:19:09,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1448872371, now seen corresponding path program 1 times [2022-12-05 23:19:09,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:09,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619146157] [2022-12-05 23:19:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:09,796 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-05 23:19:09,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:09,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619146157] [2022-12-05 23:19:09,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619146157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:09,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:09,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579695412] [2022-12-05 23:19:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:09,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:09,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:19:09,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) 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-05 23:19:09,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:09,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:19:09,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:09,879 INFO L130 PetriNetUnfolder]: 206/386 cut-off events. [2022-12-05 23:19:09,880 INFO L131 PetriNetUnfolder]: For 2483/2760 co-relation queries the response was YES. [2022-12-05 23:19:09,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 386 events. 206/386 cut-off events. For 2483/2760 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1651 event pairs, 11 based on Foata normal form. 57/427 useless extension candidates. Maximal degree in co-relation 1870. Up to 221 conditions per place. [2022-12-05 23:19:09,882 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 48 selfloop transitions, 13 changer transitions 18/83 dead transitions. [2022-12-05 23:19:09,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 848 flow [2022-12-05 23:19:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:19:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:19:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-05 23:19:09,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 23:19:09,883 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 303 flow. Second operand 7 states and 77 transitions. [2022-12-05 23:19:09,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 848 flow [2022-12-05 23:19:09,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 834 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:09,886 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 364 flow [2022-12-05 23:19:09,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2022-12-05 23:19:09,887 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2022-12-05 23:19:09,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:09,887 INFO L89 Accepts]: Start accepts. Operand has 61 places, 40 transitions, 364 flow [2022-12-05 23:19:09,888 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:09,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:09,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 40 transitions, 364 flow [2022-12-05 23:19:09,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 40 transitions, 364 flow [2022-12-05 23:19:09,899 INFO L130 PetriNetUnfolder]: 65/154 cut-off events. [2022-12-05 23:19:09,900 INFO L131 PetriNetUnfolder]: For 906/994 co-relation queries the response was YES. [2022-12-05 23:19:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 154 events. 65/154 cut-off events. For 906/994 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 585 event pairs, 4 based on Foata normal form. 11/156 useless extension candidates. Maximal degree in co-relation 761. Up to 106 conditions per place. [2022-12-05 23:19:09,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 364 flow [2022-12-05 23:19:09,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-05 23:19:09,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:09,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:19:09,902 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 364 flow [2022-12-05 23:19:09,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) 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-05 23:19:09,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:09,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:09,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:19:09,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash 272359654, now seen corresponding path program 1 times [2022-12-05 23:19:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437105213] [2022-12-05 23:19:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:09,977 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-05 23:19:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:09,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437105213] [2022-12-05 23:19:09,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437105213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:09,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:09,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582667468] [2022-12-05 23:19:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:09,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:19:09,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 364 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:09,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:09,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:19:09,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:10,050 INFO L130 PetriNetUnfolder]: 220/400 cut-off events. [2022-12-05 23:19:10,051 INFO L131 PetriNetUnfolder]: For 2361/2361 co-relation queries the response was YES. [2022-12-05 23:19:10,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 400 events. 220/400 cut-off events. For 2361/2361 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1455 event pairs, 31 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 2253. Up to 230 conditions per place. [2022-12-05 23:19:10,053 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 49 selfloop transitions, 8 changer transitions 11/68 dead transitions. [2022-12-05 23:19:10,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 748 flow [2022-12-05 23:19:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-05 23:19:10,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-05 23:19:10,054 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 364 flow. Second operand 5 states and 38 transitions. [2022-12-05 23:19:10,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 748 flow [2022-12-05 23:19:10,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 638 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-05 23:19:10,058 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 333 flow [2022-12-05 23:19:10,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2022-12-05 23:19:10,058 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2022-12-05 23:19:10,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:10,059 INFO L89 Accepts]: Start accepts. Operand has 60 places, 39 transitions, 333 flow [2022-12-05 23:19:10,059 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:10,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:10,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 39 transitions, 333 flow [2022-12-05 23:19:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 39 transitions, 333 flow [2022-12-05 23:19:10,070 INFO L130 PetriNetUnfolder]: 56/152 cut-off events. [2022-12-05 23:19:10,070 INFO L131 PetriNetUnfolder]: For 484/555 co-relation queries the response was YES. [2022-12-05 23:19:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 152 events. 56/152 cut-off events. For 484/555 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 652 event pairs, 2 based on Foata normal form. 9/150 useless extension candidates. Maximal degree in co-relation 546. Up to 69 conditions per place. [2022-12-05 23:19:10,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 39 transitions, 333 flow [2022-12-05 23:19:10,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-05 23:19:10,153 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:10,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 23:19:10,153 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 331 flow [2022-12-05 23:19:10,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:10,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:10,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:10,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:19:10,154 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 2 more)] === [2022-12-05 23:19:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1340766201, now seen corresponding path program 1 times [2022-12-05 23:19:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:10,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882455849] [2022-12-05 23:19:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:10,336 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-05 23:19:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:10,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882455849] [2022-12-05 23:19:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882455849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:10,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278388256] [2022-12-05 23:19:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:10,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:10,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 23:19:10,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) 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-05 23:19:10,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:10,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 23:19:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:10,385 INFO L130 PetriNetUnfolder]: 136/264 cut-off events. [2022-12-05 23:19:10,385 INFO L131 PetriNetUnfolder]: For 1391/1503 co-relation queries the response was YES. [2022-12-05 23:19:10,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 264 events. 136/264 cut-off events. For 1391/1503 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1064 event pairs, 7 based on Foata normal form. 39/293 useless extension candidates. Maximal degree in co-relation 1262. Up to 87 conditions per place. [2022-12-05 23:19:10,386 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2022-12-05 23:19:10,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 699 flow [2022-12-05 23:19:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:19:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:19:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-05 23:19:10,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2022-12-05 23:19:10,387 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 331 flow. Second operand 6 states and 55 transitions. [2022-12-05 23:19:10,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 699 flow [2022-12-05 23:19:10,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 659 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-05 23:19:10,389 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2022-12-05 23:19:10,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2022-12-05 23:19:10,390 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2022-12-05 23:19:10,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:10,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 0 transitions, 0 flow [2022-12-05 23:19:10,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:19:10,391 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:19:10,391 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:10,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:19:10,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:19:10,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:19:10,391 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:10,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:19:10,392 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:19:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) 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-05 23:19:10,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:19:10,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-05 23:19:10,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:19:10,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:19:10,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-05 23:19:10,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:19:10,395 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:10,397 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:19:10,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:19:10,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:19:10 BasicIcfg [2022-12-05 23:19:10,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:19:10,399 INFO L158 Benchmark]: Toolchain (without parser) took 7364.51ms. Allocated memory was 169.9MB in the beginning and 425.7MB in the end (delta: 255.9MB). Free memory was 144.2MB in the beginning and 174.1MB in the end (delta: -30.0MB). Peak memory consumption was 227.5MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,399 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:19:10,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.29ms. Allocated memory is still 169.9MB. Free memory was 144.2MB in the beginning and 119.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.43ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 117.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,400 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 115.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,400 INFO L158 Benchmark]: RCFGBuilder took 403.26ms. Allocated memory is still 169.9MB. Free memory was 115.9MB in the beginning and 101.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,400 INFO L158 Benchmark]: TraceAbstraction took 6437.61ms. Allocated memory was 169.9MB in the beginning and 425.7MB in the end (delta: 255.9MB). Free memory was 100.7MB in the beginning and 174.1MB in the end (delta: -73.5MB). Peak memory consumption was 183.4MB. Max. memory is 8.0GB. [2022-12-05 23:19:10,401 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 169.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.29ms. Allocated memory is still 169.9MB. Free memory was 144.2MB in the beginning and 119.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.43ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 117.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 115.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.26ms. Allocated memory is still 169.9MB. Free memory was 115.9MB in the beginning and 101.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6437.61ms. Allocated memory was 169.9MB in the beginning and 425.7MB in the end (delta: 255.9MB). Free memory was 100.7MB in the beginning and 174.1MB in the end (delta: -73.5MB). Peak memory consumption was 183.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 94 PlacesBefore, 33 PlacesAfterwards, 82 TransitionsBefore, 21 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 1074, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 969, independent: 936, independent conditional: 0, independent unconditional: 936, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 969, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1111, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 969, unknown conditional: 0, unknown unconditional: 969] , Statistics on independence cache: Total cache size (in pairs): 1493, Positive cache size: 1460, Positive conditional cache size: 0, Positive unconditional cache size: 1460, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 5, independent unconditional: 36, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 41, independent conditional: 41, 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: 53, independent: 41, independent conditional: 6, independent unconditional: 35, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 30, independent unconditional: 36, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 66, independent conditional: 5, independent unconditional: 61, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 66, independent conditional: 5, independent unconditional: 61, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 2, independent unconditional: 14, 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: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 50, independent conditional: 3, independent unconditional: 47, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 16, unknown conditional: 2, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 21, independent unconditional: 19, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 47, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 96, independent conditional: 62, independent unconditional: 34, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 96, independent conditional: 9, independent unconditional: 87, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 96, independent conditional: 9, independent unconditional: 87, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 105, independent: 96, independent conditional: 9, independent unconditional: 87, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 44, independent conditional: 20, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 44, independent conditional: 2, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 44, independent conditional: 2, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 52, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 57, Positive conditional cache size: 2, Positive unconditional cache size: 55, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 58, Positive conditional cache size: 2, Positive unconditional cache size: 56, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 48 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 102, independent conditional: 78, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 102, independent conditional: 44, independent unconditional: 58, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 102, independent conditional: 44, independent unconditional: 58, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 7, independent unconditional: 12, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 108, independent: 83, independent conditional: 37, independent unconditional: 46, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 19, unknown conditional: 7, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 9, Positive unconditional cache size: 73, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 61, independent conditional: 45, independent unconditional: 16, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 61, independent conditional: 28, independent unconditional: 33, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 61, independent conditional: 28, independent unconditional: 33, dependent: 6, dependent conditional: 6, 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: 67, independent: 61, independent conditional: 28, independent unconditional: 33, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 9, Positive unconditional cache size: 73, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 4, independent conditional: 4, 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): 103, Positive cache size: 91, Positive conditional cache size: 15, Positive unconditional cache size: 76, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, 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, 59 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 194 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): 103, Positive cache size: 91, Positive conditional cache size: 15, Positive unconditional cache size: 76, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, 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, 60 PlacesBefore, 59 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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): 103, Positive cache size: 91, Positive conditional cache size: 15, Positive unconditional cache size: 76, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 91, Positive conditional cache size: 15, Positive unconditional cache size: 76, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 129 locations, 5 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: 6.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 14 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=5, InterpolantAutomatonStates: 61, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:19:10,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...