/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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:52:10,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:52:10,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:52:10,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:52:10,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:52:10,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:52:10,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:52:10,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:52:10,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:52:10,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:52:10,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:52:10,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:52:10,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:52:10,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:52:10,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:52:10,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:52:10,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:52:10,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:52:10,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:52:10,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:52:10,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:52:10,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:52:10,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:52:10,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:52:10,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:52:10,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:52:10,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:52:10,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:52:10,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:52:10,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:52:10,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:52:10,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:52:10,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:52:10,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:52:10,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:52:10,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:52:10,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:52:10,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:52:10,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:52:10,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:52:10,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:52:10,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:52:10,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:52:10,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:52:10,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:52:10,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:52:10,590 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:52:10,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:52:10,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:52:10,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:52:10,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:52:10,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:52:10,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:52:10,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:52:10,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:52:10,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:52:10,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:52:10,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:10,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:52:10,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:52:10,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:52:10,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:52:10,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:52:10,594 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-13 00:52:10,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:52:10,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:52:10,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:52:10,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:52:10,886 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:52:10,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:52:11,896 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:52:12,146 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:52:12,146 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:52:12,159 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a763fa101/c03ec32aad474a21b4fa029f48194c83/FLAG114f54be2 [2022-12-13 00:52:12,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a763fa101/c03ec32aad474a21b4fa029f48194c83 [2022-12-13 00:52:12,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:52:12,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:52:12,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:12,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:52:12,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:52:12,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a06704c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12, skipping insertion in model container [2022-12-13 00:52:12,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:52:12,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:52:12,366 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 00:52:12,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:12,503 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:52:12,511 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 00:52:12,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:12,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:12,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:12,569 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:52:12,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12 WrapperNode [2022-12-13 00:52:12,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:12,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:12,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:52:12,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:52:12,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,600 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2022-12-13 00:52:12,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:12,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:52:12,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:52:12,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:52:12,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:52:12,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:52:12,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:52:12,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:52:12,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (1/1) ... [2022-12-13 00:52:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:52:12,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:52:12,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:52:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:52:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:52:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:52:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:52:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:52:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:52:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:52:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:52:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:52:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:52:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:52:12,722 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:52:12,806 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:52:12,807 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:52:13,036 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:52:13,041 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:52:13,041 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:52:13,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:13 BoogieIcfgContainer [2022-12-13 00:52:13,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:52:13,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:52:13,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:52:13,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:52:13,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:12" (1/3) ... [2022-12-13 00:52:13,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc9369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:13, skipping insertion in model container [2022-12-13 00:52:13,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:12" (2/3) ... [2022-12-13 00:52:13,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc9369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:13, skipping insertion in model container [2022-12-13 00:52:13,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:13" (3/3) ... [2022-12-13 00:52:13,048 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:52:13,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:52:13,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:52:13,067 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:52:13,125 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:52:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 99 transitions, 218 flow [2022-12-13 00:52:13,220 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 00:52:13,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:13,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 00:52:13,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 99 transitions, 218 flow [2022-12-13 00:52:13,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 81 transitions, 174 flow [2022-12-13 00:52:13,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:13,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 81 transitions, 174 flow [2022-12-13 00:52:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 81 transitions, 174 flow [2022-12-13 00:52:13,282 INFO L130 PetriNetUnfolder]: 1/81 cut-off events. [2022-12-13 00:52:13,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:13,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 81 events. 1/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:52:13,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 81 transitions, 174 flow [2022-12-13 00:52:13,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-13 00:52:15,355 INFO L241 LiptonReduction]: Total number of compositions: 61 [2022-12-13 00:52:15,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:52:15,378 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;@2682461c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:52:15,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:52:15,382 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:52:15,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:15,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:15,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:15,384 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-13 00:52:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash 274327310, now seen corresponding path program 1 times [2022-12-13 00:52:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:15,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270840140] [2022-12-13 00:52:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:15,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270840140] [2022-12-13 00:52:15,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270840140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:15,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:15,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433727915] [2022-12-13 00:52:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:15,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:15,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:52:15,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:15,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:15,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:52:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:16,302 INFO L130 PetriNetUnfolder]: 5599/8282 cut-off events. [2022-12-13 00:52:16,302 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 00:52:16,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 8282 events. 5599/8282 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 47658 event pairs, 2229 based on Foata normal form. 244/6494 useless extension candidates. Maximal degree in co-relation 16450. Up to 5259 conditions per place. [2022-12-13 00:52:16,347 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-13 00:52:16,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 213 flow [2022-12-13 00:52:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 00:52:16,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 00:52:16,356 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 71 transitions. [2022-12-13 00:52:16,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 213 flow [2022-12-13 00:52:16,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:52:16,361 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 00:52:16,364 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-13 00:52:16,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:16,365 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:16,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:16,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,376 INFO L130 PetriNetUnfolder]: 45/199 cut-off events. [2022-12-13 00:52:16,376 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 00:52:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 199 events. 45/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1203 event pairs, 27 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 309. Up to 78 conditions per place. [2022-12-13 00:52:16,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 00:52:16,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:16,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 00:52:16,433 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2022-12-13 00:52:16,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:16,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:16,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:16,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:52:16,433 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-13 00:52:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -85788509, now seen corresponding path program 1 times [2022-12-13 00:52:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:16,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343745548] [2022-12-13 00:52:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343745548] [2022-12-13 00:52:16,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343745548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:16,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:16,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016404024] [2022-12-13 00:52:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:16,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:16,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:16,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:16,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:16,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:17,045 INFO L130 PetriNetUnfolder]: 5350/8039 cut-off events. [2022-12-13 00:52:17,046 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-13 00:52:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18495 conditions, 8039 events. 5350/8039 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 47097 event pairs, 637 based on Foata normal form. 76/6138 useless extension candidates. Maximal degree in co-relation 18484. Up to 4304 conditions per place. [2022-12-13 00:52:17,092 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 48 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2022-12-13 00:52:17,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 288 flow [2022-12-13 00:52:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:52:17,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 00:52:17,095 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:52:17,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 288 flow [2022-12-13 00:52:17,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:17,112 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 00:52:17,113 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-13 00:52:17,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:17,113 INFO L89 Accepts]: Start accepts. Operand has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:17,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:17,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,125 INFO L130 PetriNetUnfolder]: 35/172 cut-off events. [2022-12-13 00:52:17,125 INFO L131 PetriNetUnfolder]: For 41/52 co-relation queries the response was YES. [2022-12-13 00:52:17,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 172 events. 35/172 cut-off events. For 41/52 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1011 event pairs, 19 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 315. Up to 63 conditions per place. [2022-12-13 00:52:17,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 700 [2022-12-13 00:52:17,131 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:17,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:52:17,133 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 137 flow [2022-12-13 00:52:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:17,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:17,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:17,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:52:17,133 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-13 00:52:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash -85788819, now seen corresponding path program 1 times [2022-12-13 00:52:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063807259] [2022-12-13 00:52:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:17,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063807259] [2022-12-13 00:52:17,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063807259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:17,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:17,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033499848] [2022-12-13 00:52:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:17,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:17,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:17,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:17,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:17,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:17,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:17,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:17,704 INFO L130 PetriNetUnfolder]: 5079/7658 cut-off events. [2022-12-13 00:52:17,704 INFO L131 PetriNetUnfolder]: For 3320/3320 co-relation queries the response was YES. [2022-12-13 00:52:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18862 conditions, 7658 events. 5079/7658 cut-off events. For 3320/3320 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 44873 event pairs, 1335 based on Foata normal form. 52/5814 useless extension candidates. Maximal degree in co-relation 18848. Up to 4289 conditions per place. [2022-12-13 00:52:17,738 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 53 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2022-12-13 00:52:17,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 342 flow [2022-12-13 00:52:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 00:52:17,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 00:52:17,740 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 137 flow. Second operand 4 states and 88 transitions. [2022-12-13 00:52:17,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 342 flow [2022-12-13 00:52:17,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:17,745 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 00:52:17,746 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 00:52:17,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:17,746 INFO L89 Accepts]: Start accepts. Operand has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:17,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:17,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,754 INFO L130 PetriNetUnfolder]: 28/151 cut-off events. [2022-12-13 00:52:17,755 INFO L131 PetriNetUnfolder]: For 89/106 co-relation queries the response was YES. [2022-12-13 00:52:17,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 151 events. 28/151 cut-off events. For 89/106 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 814 event pairs, 14 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 311. Up to 53 conditions per place. [2022-12-13 00:52:17,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-13 00:52:17,757 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:17,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:52:17,758 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 173 flow [2022-12-13 00:52:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:17,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:17,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:17,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:52:17,758 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-13 00:52:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1635522680, now seen corresponding path program 1 times [2022-12-13 00:52:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:17,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104712779] [2022-12-13 00:52:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104712779] [2022-12-13 00:52:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104712779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:17,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759066611] [2022-12-13 00:52:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:17,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:17,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:17,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:17,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:18,381 INFO L130 PetriNetUnfolder]: 4919/7468 cut-off events. [2022-12-13 00:52:18,381 INFO L131 PetriNetUnfolder]: For 6827/6827 co-relation queries the response was YES. [2022-12-13 00:52:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19379 conditions, 7468 events. 4919/7468 cut-off events. For 6827/6827 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43337 event pairs, 495 based on Foata normal form. 16/5636 useless extension candidates. Maximal degree in co-relation 19362. Up to 4027 conditions per place. [2022-12-13 00:52:18,417 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 47 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-12-13 00:52:18,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 372 flow [2022-12-13 00:52:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:52:18,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 00:52:18,420 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 173 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:52:18,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 372 flow [2022-12-13 00:52:18,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:18,453 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 00:52:18,454 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-12-13 00:52:18,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:18,454 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:18,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:18,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,462 INFO L130 PetriNetUnfolder]: 22/123 cut-off events. [2022-12-13 00:52:18,462 INFO L131 PetriNetUnfolder]: For 109/119 co-relation queries the response was YES. [2022-12-13 00:52:18,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 123 events. 22/123 cut-off events. For 109/119 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 617 event pairs, 8 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 295. Up to 45 conditions per place. [2022-12-13 00:52:18,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 00:52:18,464 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:18,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:52:18,472 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 222 flow [2022-12-13 00:52:18,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:18,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:18,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:18,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:52:18,472 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-13 00:52:18,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash -611006580, now seen corresponding path program 1 times [2022-12-13 00:52:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:18,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552310249] [2022-12-13 00:52:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552310249] [2022-12-13 00:52:18,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552310249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:18,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:18,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895712341] [2022-12-13 00:52:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:18,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:52:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:52:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:52:18,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:18,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:18,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:18,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:18,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:19,211 INFO L130 PetriNetUnfolder]: 7111/10860 cut-off events. [2022-12-13 00:52:19,212 INFO L131 PetriNetUnfolder]: For 12996/12996 co-relation queries the response was YES. [2022-12-13 00:52:19,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28513 conditions, 10860 events. 7111/10860 cut-off events. For 12996/12996 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 67848 event pairs, 1459 based on Foata normal form. 228/8276 useless extension candidates. Maximal degree in co-relation 28494. Up to 4560 conditions per place. [2022-12-13 00:52:19,250 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 51 selfloop transitions, 8 changer transitions 14/81 dead transitions. [2022-12-13 00:52:19,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 487 flow [2022-12-13 00:52:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:52:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:52:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 00:52:19,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 00:52:19,252 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 222 flow. Second operand 5 states and 105 transitions. [2022-12-13 00:52:19,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 487 flow [2022-12-13 00:52:19,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:19,317 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2022-12-13 00:52:19,318 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-12-13 00:52:19,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:19,318 INFO L89 Accepts]: Start accepts. Operand has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:19,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:19,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,324 INFO L130 PetriNetUnfolder]: 13/93 cut-off events. [2022-12-13 00:52:19,324 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 00:52:19,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 93 events. 13/93 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 419 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 232. Up to 32 conditions per place. [2022-12-13 00:52:19,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-13 00:52:19,328 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:19,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 00:52:19,329 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 205 flow [2022-12-13 00:52:19,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:19,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:19,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:52:19,329 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-13 00:52:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash -382033787, now seen corresponding path program 1 times [2022-12-13 00:52:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749947338] [2022-12-13 00:52:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749947338] [2022-12-13 00:52:19,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749947338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:19,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:19,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295068033] [2022-12-13 00:52:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:19,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:19,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:19,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:19,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:19,891 INFO L130 PetriNetUnfolder]: 4716/7153 cut-off events. [2022-12-13 00:52:19,891 INFO L131 PetriNetUnfolder]: For 10806/10806 co-relation queries the response was YES. [2022-12-13 00:52:19,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18848 conditions, 7153 events. 4716/7153 cut-off events. For 10806/10806 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 42149 event pairs, 843 based on Foata normal form. 192/5308 useless extension candidates. Maximal degree in co-relation 18826. Up to 3779 conditions per place. [2022-12-13 00:52:19,927 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 43 selfloop transitions, 7 changer transitions 1/59 dead transitions. [2022-12-13 00:52:19,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 351 flow [2022-12-13 00:52:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 00:52:19,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 00:52:19,928 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 205 flow. Second operand 4 states and 80 transitions. [2022-12-13 00:52:19,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 351 flow [2022-12-13 00:52:19,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 319 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 00:52:19,952 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2022-12-13 00:52:19,953 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2022-12-13 00:52:19,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:19,953 INFO L89 Accepts]: Start accepts. Operand has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:19,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:19,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,961 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-12-13 00:52:19,961 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 00:52:19,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 92 events. 7/92 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 416 event pairs, 3 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 196. Up to 26 conditions per place. [2022-12-13 00:52:19,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 00:52:19,964 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:19,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:52:19,965 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 185 flow [2022-12-13 00:52:19,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:19,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:19,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:52:19,965 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-13 00:52:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash -838700026, now seen corresponding path program 2 times [2022-12-13 00:52:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:19,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025894331] [2022-12-13 00:52:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:20,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:20,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025894331] [2022-12-13 00:52:20,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025894331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:20,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:20,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285035937] [2022-12-13 00:52:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:20,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:20,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:52:20,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:20,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:20,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:52:20,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:20,502 INFO L130 PetriNetUnfolder]: 5661/8823 cut-off events. [2022-12-13 00:52:20,502 INFO L131 PetriNetUnfolder]: For 9412/9432 co-relation queries the response was YES. [2022-12-13 00:52:20,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21123 conditions, 8823 events. 5661/8823 cut-off events. For 9412/9432 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 60281 event pairs, 1815 based on Foata normal form. 211/6298 useless extension candidates. Maximal degree in co-relation 21103. Up to 3856 conditions per place. [2022-12-13 00:52:20,541 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 48 selfloop transitions, 4 changer transitions 16/78 dead transitions. [2022-12-13 00:52:20,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 507 flow [2022-12-13 00:52:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 00:52:20,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 00:52:20,542 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 185 flow. Second operand 4 states and 90 transitions. [2022-12-13 00:52:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 507 flow [2022-12-13 00:52:20,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 445 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 00:52:20,549 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2022-12-13 00:52:20,550 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-12-13 00:52:20,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:20,550 INFO L89 Accepts]: Start accepts. Operand has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:20,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:20,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,555 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-12-13 00:52:20,555 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 00:52:20,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 92 events. 7/92 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 400 event pairs, 3 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 192. Up to 26 conditions per place. [2022-12-13 00:52:20,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-13 00:52:20,558 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:20,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 00:52:20,558 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 173 flow [2022-12-13 00:52:20,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:20,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:20,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:20,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:52:20,559 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-13 00:52:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash -230917178, now seen corresponding path program 1 times [2022-12-13 00:52:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:20,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233529677] [2022-12-13 00:52:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233529677] [2022-12-13 00:52:20,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233529677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:20,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:20,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137563545] [2022-12-13 00:52:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:20,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:20,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:52:20,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:20,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:20,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:52:20,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:21,187 INFO L130 PetriNetUnfolder]: 8172/11416 cut-off events. [2022-12-13 00:52:21,187 INFO L131 PetriNetUnfolder]: For 13141/13173 co-relation queries the response was YES. [2022-12-13 00:52:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28537 conditions, 11416 events. 8172/11416 cut-off events. For 13141/13173 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 68465 event pairs, 4115 based on Foata normal form. 26/5211 useless extension candidates. Maximal degree in co-relation 28517. Up to 11218 conditions per place. [2022-12-13 00:52:21,315 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 43 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-13 00:52:21,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 383 flow [2022-12-13 00:52:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:52:21,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 00:52:21,316 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 173 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:52:21,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 383 flow [2022-12-13 00:52:21,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 354 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 00:52:21,322 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-13 00:52:21,324 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-13 00:52:21,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:21,325 INFO L89 Accepts]: Start accepts. Operand has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:21,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:21,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,566 INFO L130 PetriNetUnfolder]: 5330/7915 cut-off events. [2022-12-13 00:52:21,566 INFO L131 PetriNetUnfolder]: For 1527/1632 co-relation queries the response was YES. [2022-12-13 00:52:21,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16809 conditions, 7915 events. 5330/7915 cut-off events. For 1527/1632 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 56210 event pairs, 3274 based on Foata normal form. 6/3198 useless extension candidates. Maximal degree in co-relation 16794. Up to 7468 conditions per place. [2022-12-13 00:52:21,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 00:52:21,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:21,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 00:52:21,634 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 242 flow [2022-12-13 00:52:21,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:21,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:21,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:21,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:52:21,635 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-13 00:52:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1491816606, now seen corresponding path program 1 times [2022-12-13 00:52:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990905239] [2022-12-13 00:52:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:21,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990905239] [2022-12-13 00:52:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990905239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:21,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:21,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804030177] [2022-12-13 00:52:21,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:21,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:21,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:52:21,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:21,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:21,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:52:21,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:22,170 INFO L130 PetriNetUnfolder]: 6450/9451 cut-off events. [2022-12-13 00:52:22,170 INFO L131 PetriNetUnfolder]: For 5511/6752 co-relation queries the response was YES. [2022-12-13 00:52:22,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30353 conditions, 9451 events. 6450/9451 cut-off events. For 5511/6752 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 59268 event pairs, 1727 based on Foata normal form. 126/4612 useless extension candidates. Maximal degree in co-relation 30335. Up to 8974 conditions per place. [2022-12-13 00:52:22,203 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 51 selfloop transitions, 25 changer transitions 0/84 dead transitions. [2022-12-13 00:52:22,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 548 flow [2022-12-13 00:52:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 00:52:22,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-12-13 00:52:22,204 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 242 flow. Second operand 4 states and 89 transitions. [2022-12-13 00:52:22,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 548 flow [2022-12-13 00:52:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:22,214 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-13 00:52:22,214 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-12-13 00:52:22,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:22,214 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:22,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:22,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,457 INFO L130 PetriNetUnfolder]: 4361/6886 cut-off events. [2022-12-13 00:52:22,457 INFO L131 PetriNetUnfolder]: For 2573/10748 co-relation queries the response was YES. [2022-12-13 00:52:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21809 conditions, 6886 events. 4361/6886 cut-off events. For 2573/10748 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 50999 event pairs, 1387 based on Foata normal form. 5/2979 useless extension candidates. Maximal degree in co-relation 21792. Up to 6358 conditions per place. [2022-12-13 00:52:22,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-13 00:52:22,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:22,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-13 00:52:22,514 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 377 flow [2022-12-13 00:52:22,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:22,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:22,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:22,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:52:22,515 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-13 00:52:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -998348875, now seen corresponding path program 1 times [2022-12-13 00:52:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470381505] [2022-12-13 00:52:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:22,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-13 00:52:22,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:22,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470381505] [2022-12-13 00:52:22,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470381505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:22,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:22,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:52:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435960257] [2022-12-13 00:52:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:22,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:52:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:52:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:52:22,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:52:22,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:22,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:22,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:52:22,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:22,893 INFO L130 PetriNetUnfolder]: 4374/6700 cut-off events. [2022-12-13 00:52:22,893 INFO L131 PetriNetUnfolder]: For 4281/7334 co-relation queries the response was YES. [2022-12-13 00:52:22,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28021 conditions, 6700 events. 4374/6700 cut-off events. For 4281/7334 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 43614 event pairs, 362 based on Foata normal form. 368/3578 useless extension candidates. Maximal degree in co-relation 28001. Up to 5701 conditions per place. [2022-12-13 00:52:22,919 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 56 selfloop transitions, 37 changer transitions 0/101 dead transitions. [2022-12-13 00:52:22,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 766 flow [2022-12-13 00:52:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:52:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:52:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 00:52:22,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 00:52:22,921 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 377 flow. Second operand 5 states and 112 transitions. [2022-12-13 00:52:22,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 766 flow [2022-12-13 00:52:22,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 716 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:22,926 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:22,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-13 00:52:22,927 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-13 00:52:22,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:22,927 INFO L89 Accepts]: Start accepts. Operand has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:22,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:22,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:22,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:22,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:23,148 INFO L130 PetriNetUnfolder]: 2759/4690 cut-off events. [2022-12-13 00:52:23,149 INFO L131 PetriNetUnfolder]: For 2972/10535 co-relation queries the response was YES. [2022-12-13 00:52:23,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19698 conditions, 4690 events. 2759/4690 cut-off events. For 2972/10535 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 35620 event pairs, 271 based on Foata normal form. 12/2059 useless extension candidates. Maximal degree in co-relation 19680. Up to 4321 conditions per place. [2022-12-13 00:52:23,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:23,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 00:52:23,185 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:23,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 00:52:23,186 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 523 flow [2022-12-13 00:52:23,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:23,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:23,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:23,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:52:23,186 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-13 00:52:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -307672070, now seen corresponding path program 1 times [2022-12-13 00:52:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:23,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058532854] [2022-12-13 00:52:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:23,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:23,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058532854] [2022-12-13 00:52:23,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058532854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:23,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:23,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:52:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866479359] [2022-12-13 00:52:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:23,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:52:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:52:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:52:23,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:23,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:23,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:23,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:23,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:23,802 INFO L130 PetriNetUnfolder]: 5365/8405 cut-off events. [2022-12-13 00:52:23,802 INFO L131 PetriNetUnfolder]: For 13761/15423 co-relation queries the response was YES. [2022-12-13 00:52:23,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40498 conditions, 8405 events. 5365/8405 cut-off events. For 13761/15423 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 56161 event pairs, 575 based on Foata normal form. 570/6654 useless extension candidates. Maximal degree in co-relation 40477. Up to 7053 conditions per place. [2022-12-13 00:52:23,842 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 84 selfloop transitions, 8 changer transitions 59/171 dead transitions. [2022-12-13 00:52:23,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1550 flow [2022-12-13 00:52:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:52:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:52:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-13 00:52:23,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2022-12-13 00:52:23,844 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 523 flow. Second operand 6 states and 115 transitions. [2022-12-13 00:52:23,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1550 flow [2022-12-13 00:52:23,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 1272 flow, removed 68 selfloop flow, removed 3 redundant places. [2022-12-13 00:52:23,889 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:23,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2022-12-13 00:52:23,891 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2022-12-13 00:52:23,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:23,891 INFO L89 Accepts]: Start accepts. Operand has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:23,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:23,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:23,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:23,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:24,164 INFO L130 PetriNetUnfolder]: 3514/5801 cut-off events. [2022-12-13 00:52:24,164 INFO L131 PetriNetUnfolder]: For 5051/7412 co-relation queries the response was YES. [2022-12-13 00:52:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20031 conditions, 5801 events. 3514/5801 cut-off events. For 5051/7412 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 44306 event pairs, 352 based on Foata normal form. 40/2451 useless extension candidates. Maximal degree in co-relation 20012. Up to 5023 conditions per place. [2022-12-13 00:52:24,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:24,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 00:52:24,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:24,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-13 00:52:24,210 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 444 flow [2022-12-13 00:52:24,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:24,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:24,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:24,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:52:24,210 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-13 00:52:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash -725121462, now seen corresponding path program 1 times [2022-12-13 00:52:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:24,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783946036] [2022-12-13 00:52:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:52:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783946036] [2022-12-13 00:52:24,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783946036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:24,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:24,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:52:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952977422] [2022-12-13 00:52:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:24,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:52:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:52:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:52:24,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:52:24,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:24,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:24,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:52:24,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:24,632 INFO L130 PetriNetUnfolder]: 3374/5336 cut-off events. [2022-12-13 00:52:24,633 INFO L131 PetriNetUnfolder]: For 6478/8622 co-relation queries the response was YES. [2022-12-13 00:52:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21458 conditions, 5336 events. 3374/5336 cut-off events. For 6478/8622 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 35502 event pairs, 11 based on Foata normal form. 615/2940 useless extension candidates. Maximal degree in co-relation 21436. Up to 3619 conditions per place. [2022-12-13 00:52:24,651 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 25 selfloop transitions, 49 changer transitions 22/101 dead transitions. [2022-12-13 00:52:24,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 782 flow [2022-12-13 00:52:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:52:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:52:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:52:24,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-13 00:52:24,652 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 444 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:52:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 782 flow [2022-12-13 00:52:24,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 731 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 00:52:24,685 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 494 flow [2022-12-13 00:52:24,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2022-12-13 00:52:24,686 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2022-12-13 00:52:24,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:24,686 INFO L89 Accepts]: Start accepts. Operand has 65 places, 67 transitions, 494 flow [2022-12-13 00:52:24,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:24,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:24,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 67 transitions, 494 flow [2022-12-13 00:52:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 494 flow [2022-12-13 00:52:24,730 INFO L130 PetriNetUnfolder]: 513/947 cut-off events. [2022-12-13 00:52:24,730 INFO L131 PetriNetUnfolder]: For 843/1764 co-relation queries the response was YES. [2022-12-13 00:52:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 947 events. 513/947 cut-off events. For 843/1764 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 5666 event pairs, 0 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 4155. Up to 730 conditions per place. [2022-12-13 00:52:24,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 67 transitions, 494 flow [2022-12-13 00:52:24,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 00:52:25,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] $Ultimate##0-->L747: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_13| v_P1Thread1of1ForFork1_~arg.offset_13) (= v_P1Thread1of1ForFork1_~arg.base_13 |v_P1Thread1of1ForFork1_#in~arg.base_13|) (= v_~__unbuffered_cnt~0_661 (+ v_~__unbuffered_cnt~0_662 1)) (= v_~x~0_46 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_662} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_13, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_661, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= 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_7} 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_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 00:52:25,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [299] $Ultimate##0-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_91| 0) (= v_~__unbuffered_cnt~0_665 (+ v_~__unbuffered_cnt~0_666 1)) (= |v_P1Thread1of1ForFork1_#res.offset_91| 0) (= v_~x~0_48 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_666} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_91|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_665, ~x~0=v_~x~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= 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_7} 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_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 00:52:25,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] $Ultimate##0-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_669 (+ v_~__unbuffered_cnt~0_670 1)) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= v_~x~0_50 1) (= |v_P1Thread1of1ForFork1_#res.base_93| 0) (= |v_P1Thread1of1ForFork1_#res.offset_93| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_670} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_93|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_669, ~x~0=v_~x~0_50, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= 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_7} 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_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 00:52:25,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] $Ultimate##0-->L742: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_5 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= 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_7} 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_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 00:52:25,884 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:52:25,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1199 [2022-12-13 00:52:25,885 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 564 flow [2022-12-13 00:52:25,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:25,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:25,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:25,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:52:25,886 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-13 00:52:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1851942395, now seen corresponding path program 1 times [2022-12-13 00:52:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:25,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828061626] [2022-12-13 00:52:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:26,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-13 00:52:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:26,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828061626] [2022-12-13 00:52:26,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828061626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:26,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:26,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:26,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429044279] [2022-12-13 00:52:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:26,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:26,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:26,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-13 00:52:26,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:26,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:26,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-13 00:52:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:26,126 INFO L130 PetriNetUnfolder]: 587/913 cut-off events. [2022-12-13 00:52:26,126 INFO L131 PetriNetUnfolder]: For 1924/1930 co-relation queries the response was YES. [2022-12-13 00:52:26,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 913 events. 587/913 cut-off events. For 1924/1930 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 4033 event pairs, 0 based on Foata normal form. 87/645 useless extension candidates. Maximal degree in co-relation 4992. Up to 661 conditions per place. [2022-12-13 00:52:26,129 INFO L137 encePairwiseOnDemand]: 19/45 looper letters, 0 selfloop transitions, 0 changer transitions 78/78 dead transitions. [2022-12-13 00:52:26,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 782 flow [2022-12-13 00:52:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:52:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:52:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 00:52:26,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3511111111111111 [2022-12-13 00:52:26,130 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 564 flow. Second operand 5 states and 79 transitions. [2022-12-13 00:52:26,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 782 flow [2022-12-13 00:52:26,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 497 flow, removed 39 selfloop flow, removed 12 redundant places. [2022-12-13 00:52:26,139 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2022-12-13 00:52:26,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2022-12-13 00:52:26,139 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-13 00:52:26,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:26,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 0 transitions, 0 flow [2022-12-13 00:52:26,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:26,140 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:52:26,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:26,140 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-13 00:52:26,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:26,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:52:26,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:26,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 00:52:26,141 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:26,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:26,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:52:26,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 00:52:26,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:52:26,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:52:26,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 00:52:26,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:52:26,143 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:26,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:52:26,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:52:26,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:52:26 BasicIcfg [2022-12-13 00:52:26,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:52:26,147 INFO L158 Benchmark]: Toolchain (without parser) took 13970.34ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 165.0MB in the beginning and 869.6MB in the end (delta: -704.6MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 00:52:26,147 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:52:26,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.99ms. Allocated memory is still 189.8MB. Free memory was 165.0MB in the beginning and 141.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 00:52:26,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 189.8MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:52:26,148 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 189.8MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:52:26,148 INFO L158 Benchmark]: RCFGBuilder took 416.16ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 123.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 00:52:26,148 INFO L158 Benchmark]: TraceAbstraction took 13102.99ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.0MB in the beginning and 869.6MB in the end (delta: -747.6MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 00:52:26,149 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.09ms. Allocated memory is still 189.8MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 390.99ms. Allocated memory is still 189.8MB. Free memory was 165.0MB in the beginning and 141.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 189.8MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 189.8MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 416.16ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 123.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13102.99ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.0MB in the beginning and 869.6MB in the end (delta: -747.6MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 93 PlacesBefore, 45 PlacesAfterwards, 81 TransitionsBefore, 33 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 61 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1445, independent: 1390, independent conditional: 1390, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1445, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1445, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1445, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1130, independent: 1093, independent conditional: 0, independent unconditional: 1093, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1130, independent: 1057, independent conditional: 0, independent unconditional: 1057, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1445, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1130, unknown conditional: 0, unknown unconditional: 1130] , Statistics on independence cache: Total cache size (in pairs): 1785, Positive cache size: 1748, Positive conditional cache size: 0, Positive unconditional cache size: 1748, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 146, independent conditional: 26, independent unconditional: 120, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 132, independent: 124, independent conditional: 8, independent unconditional: 116, 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: 132, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 132, unknown conditional: 8, unknown unconditional: 124] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 124, Positive conditional cache size: 8, Positive unconditional cache size: 116, 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: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 136, independent conditional: 35, independent unconditional: 101, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 136, independent conditional: 17, independent unconditional: 119, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 136, independent conditional: 17, independent unconditional: 119, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 146, independent: 136, independent conditional: 17, independent unconditional: 119, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 124, Positive conditional cache size: 8, Positive unconditional cache size: 116, 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: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 75, independent conditional: 75, 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: 82, independent: 75, independent conditional: 19, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 75, independent conditional: 3, independent unconditional: 72, 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: 82, independent: 75, independent conditional: 3, independent unconditional: 72, 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: 82, independent: 75, independent conditional: 3, independent unconditional: 72, 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): 132, Positive cache size: 124, Positive conditional cache size: 8, Positive unconditional cache size: 116, 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: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 69, independent conditional: 69, 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: 76, independent: 69, independent conditional: 19, independent unconditional: 50, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 69, independent conditional: 7, independent unconditional: 62, 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: 76, independent: 69, independent conditional: 7, independent unconditional: 62, 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: 76, independent: 69, independent conditional: 7, independent unconditional: 62, 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): 132, Positive cache size: 124, Positive conditional cache size: 8, Positive unconditional cache size: 116, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 53, independent conditional: 53, 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: 60, independent: 53, independent conditional: 12, independent unconditional: 41, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 60, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 60, independent: 53, independent conditional: 0, independent unconditional: 53, 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): 132, Positive cache size: 124, Positive conditional cache size: 8, Positive unconditional cache size: 116, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 48, independent conditional: 48, 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: 55, independent: 48, independent conditional: 9, independent unconditional: 39, 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: 58, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 58, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 37, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 8, Positive unconditional cache size: 122, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 61 PlacesBefore, 57 PlacesAfterwards, 67 TransitionsBefore, 63 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 643, independent: 643, independent conditional: 643, 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: 643, independent: 643, independent conditional: 636, independent unconditional: 7, 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: 643, independent: 643, independent conditional: 633, independent unconditional: 10, 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: 643, independent: 643, independent conditional: 633, independent unconditional: 10, 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: 42, independent: 42, independent conditional: 39, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 643, independent: 601, independent conditional: 594, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 42, unknown conditional: 39, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 343, Positive conditional cache size: 47, Positive unconditional cache size: 296, 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: 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): 352, Positive cache size: 343, Positive conditional cache size: 47, Positive unconditional cache size: 296, 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: 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, 128 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: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 17 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=12, InterpolantAutomatonStates: 57, 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.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 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-13 00:52:26,170 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...