/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 21:16:51,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 21:16:51,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 21:16:51,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 21:16:51,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 21:16:51,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 21:16:51,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 21:16:51,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 21:16:51,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 21:16:51,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 21:16:51,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 21:16:51,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 21:16:51,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 21:16:52,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 21:16:52,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 21:16:52,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 21:16:52,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 21:16:52,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 21:16:52,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 21:16:52,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 21:16:52,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 21:16:52,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 21:16:52,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 21:16:52,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 21:16:52,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 21:16:52,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 21:16:52,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 21:16:52,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 21:16:52,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 21:16:52,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 21:16:52,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 21:16:52,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 21:16:52,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 21:16:52,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 21:16:52,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 21:16:52,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 21:16:52,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 21:16:52,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 21:16:52,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 21:16:52,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 21:16:52,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 21:16:52,040 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-SemanticLbe.epf [2022-12-05 21:16:52,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 21:16:52,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 21:16:52,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 21:16:52,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 21:16:52,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 21:16:52,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 21:16:52,058 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 21:16:52,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 21:16:52,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 21:16:52,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 21:16:52,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 21:16:52,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 21:16:52,060 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 21:16:52,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 21:16:52,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 21:16:52,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 21:16:52,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 21:16:52,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 21:16:52,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:16:52,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 21:16:52,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 21:16:52,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 21:16:52,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 21:16:52,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 21:16:52,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 21:16:52,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 21:16:52,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 21:16:52,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 21:16:52,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 21:16:52,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 21:16:52,361 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 21:16:52,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-05 21:16:53,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 21:16:53,524 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 21:16:53,525 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-05 21:16:53,529 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea8d275b/af1b8448eca74f469d4b81329c96114c/FLAG6ce999f28 [2022-12-05 21:16:53,540 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea8d275b/af1b8448eca74f469d4b81329c96114c [2022-12-05 21:16:53,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 21:16:53,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 21:16:53,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 21:16:53,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 21:16:53,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 21:16:53,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdb1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53, skipping insertion in model container [2022-12-05 21:16:53,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 21:16:53,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 21:16:53,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,712 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-05 21:16:53,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:16:53,721 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 21:16:53,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:16:53,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:16:53,764 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-05 21:16:53,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:16:53,783 INFO L208 MainTranslator]: Completed translation [2022-12-05 21:16:53,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53 WrapperNode [2022-12-05 21:16:53,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 21:16:53,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 21:16:53,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 21:16:53,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 21:16:53,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,832 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 255 [2022-12-05 21:16:53,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 21:16:53,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 21:16:53,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 21:16:53,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 21:16:53,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 21:16:53,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 21:16:53,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 21:16:53,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 21:16:53,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (1/1) ... [2022-12-05 21:16:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:16:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:16:53,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 21:16:53,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 21:16:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 21:16:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 21:16:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 21:16:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 21:16:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 21:16:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 21:16:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 21:16:53,955 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 21:16:54,049 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 21:16:54,050 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 21:16:54,329 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 21:16:54,439 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 21:16:54,440 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 21:16:54,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:54 BoogieIcfgContainer [2022-12-05 21:16:54,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 21:16:54,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 21:16:54,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 21:16:54,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 21:16:54,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:53" (1/3) ... [2022-12-05 21:16:54,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250e6d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:54, skipping insertion in model container [2022-12-05 21:16:54,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:53" (2/3) ... [2022-12-05 21:16:54,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250e6d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:54, skipping insertion in model container [2022-12-05 21:16:54,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:54" (3/3) ... [2022-12-05 21:16:54,455 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-12-05 21:16:54,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 21:16:54,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 21:16:54,467 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 21:16:54,540 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 21:16:54,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 145 transitions, 314 flow [2022-12-05 21:16:54,651 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-05 21:16:54,652 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:16:54,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-05 21:16:54,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 145 transitions, 314 flow [2022-12-05 21:16:54,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 132 transitions, 282 flow [2022-12-05 21:16:54,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 21:16:54,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-05 21:16:54,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 282 flow [2022-12-05 21:16:54,752 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-05 21:16:54,752 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:16:54,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-05 21:16:54,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-05 21:16:54,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-05 21:16:58,497 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-05 21:16:58,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 21:16:58,510 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=PETRI_NET, 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;@dcbca96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 21:16:58,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 21:16:58,516 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-05 21:16:58,516 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:16:58,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:16:58,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:16:58,517 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 1 more)] === [2022-12-05 21:16:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:16:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash 748936163, now seen corresponding path program 1 times [2022-12-05 21:16:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:16:58,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410318352] [2022-12-05 21:16:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:16:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:16:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:16:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:16:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:16:59,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410318352] [2022-12-05 21:16:59,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410318352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:16:59,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:16:59,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:16:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457691262] [2022-12-05 21:16:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:16:59,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:16:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:16:59,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:16:59,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:16:59,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 21:16:59,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:16:59,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:16:59,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 21:16:59,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:00,137 INFO L130 PetriNetUnfolder]: 6197/9388 cut-off events. [2022-12-05 21:17:00,137 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-05 21:17:00,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19181 conditions, 9388 events. 6197/9388 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 50152 event pairs, 2421 based on Foata normal form. 1/9371 useless extension candidates. Maximal degree in co-relation 16901. Up to 3168 conditions per place. [2022-12-05 21:17:00,179 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 158 selfloop transitions, 15 changer transitions 22/198 dead transitions. [2022-12-05 21:17:00,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 198 transitions, 858 flow [2022-12-05 21:17:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:17:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:17:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2022-12-05 21:17:00,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48414376321353064 [2022-12-05 21:17:00,191 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 104 flow. Second operand 11 states and 229 transitions. [2022-12-05 21:17:00,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 198 transitions, 858 flow [2022-12-05 21:17:00,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 198 transitions, 810 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 21:17:00,200 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 184 flow [2022-12-05 21:17:00,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-05 21:17:00,204 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2022-12-05 21:17:00,204 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 184 flow [2022-12-05 21:17:00,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:00,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:00,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 21:17:00,204 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 1 more)] === [2022-12-05 21:17:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 392671169, now seen corresponding path program 2 times [2022-12-05 21:17:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:00,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660313923] [2022-12-05 21:17:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:00,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660313923] [2022-12-05 21:17:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660313923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:00,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 21:17:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110084189] [2022-12-05 21:17:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:00,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 21:17:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 21:17:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 21:17:00,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:00,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 184 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:00,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:00,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:00,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:01,207 INFO L130 PetriNetUnfolder]: 4993/8642 cut-off events. [2022-12-05 21:17:01,207 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-05 21:17:01,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17811 conditions, 8642 events. 4993/8642 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 55919 event pairs, 2425 based on Foata normal form. 106/8529 useless extension candidates. Maximal degree in co-relation 17789. Up to 6702 conditions per place. [2022-12-05 21:17:01,245 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 85 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2022-12-05 21:17:01,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 520 flow [2022-12-05 21:17:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 21:17:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 21:17:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-05 21:17:01,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2022-12-05 21:17:01,246 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 184 flow. Second operand 8 states and 152 transitions. [2022-12-05 21:17:01,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 520 flow [2022-12-05 21:17:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 518 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 21:17:01,252 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 283 flow [2022-12-05 21:17:01,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2022-12-05 21:17:01,252 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2022-12-05 21:17:01,252 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 283 flow [2022-12-05 21:17:01,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:01,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:01,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:01,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 21:17:01,253 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 1 more)] === [2022-12-05 21:17:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 28740645, now seen corresponding path program 3 times [2022-12-05 21:17:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:01,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759756491] [2022-12-05 21:17:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759756491] [2022-12-05 21:17:01,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759756491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:01,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:01,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901794224] [2022-12-05 21:17:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:01,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:01,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 21:17:01,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 283 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:01,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:01,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 21:17:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:02,439 INFO L130 PetriNetUnfolder]: 8204/12774 cut-off events. [2022-12-05 21:17:02,440 INFO L131 PetriNetUnfolder]: For 4910/4922 co-relation queries the response was YES. [2022-12-05 21:17:02,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32272 conditions, 12774 events. 8204/12774 cut-off events. For 4910/4922 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 74597 event pairs, 2898 based on Foata normal form. 3/12752 useless extension candidates. Maximal degree in co-relation 22979. Up to 3685 conditions per place. [2022-12-05 21:17:02,513 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 209 selfloop transitions, 26 changer transitions 29/268 dead transitions. [2022-12-05 21:17:02,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 268 transitions, 1435 flow [2022-12-05 21:17:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:17:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:17:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 245 transitions. [2022-12-05 21:17:02,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5179704016913319 [2022-12-05 21:17:02,515 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 283 flow. Second operand 11 states and 245 transitions. [2022-12-05 21:17:02,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 268 transitions, 1435 flow [2022-12-05 21:17:02,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 268 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:02,526 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 490 flow [2022-12-05 21:17:02,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=490, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2022-12-05 21:17:02,539 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2022-12-05 21:17:02,540 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 490 flow [2022-12-05 21:17:02,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:02,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:02,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:02,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 21:17:02,540 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 1 more)] === [2022-12-05 21:17:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1998365207, now seen corresponding path program 4 times [2022-12-05 21:17:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:02,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356508713] [2022-12-05 21:17:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:02,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:02,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356508713] [2022-12-05 21:17:02,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356508713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:02,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:02,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 21:17:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520035011] [2022-12-05 21:17:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:02,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 21:17:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:02,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 21:17:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 21:17:02,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-05 21:17:02,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:02,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:02,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-05 21:17:02,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:03,210 INFO L130 PetriNetUnfolder]: 4305/7870 cut-off events. [2022-12-05 21:17:03,210 INFO L131 PetriNetUnfolder]: For 4193/4331 co-relation queries the response was YES. [2022-12-05 21:17:03,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19927 conditions, 7870 events. 4305/7870 cut-off events. For 4193/4331 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 55252 event pairs, 3514 based on Foata normal form. 50/7576 useless extension candidates. Maximal degree in co-relation 19866. Up to 6112 conditions per place. [2022-12-05 21:17:03,251 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 60 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2022-12-05 21:17:03,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 113 transitions, 677 flow [2022-12-05 21:17:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:17:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:17:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-05 21:17:03,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2022-12-05 21:17:03,252 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 490 flow. Second operand 3 states and 80 transitions. [2022-12-05 21:17:03,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 113 transitions, 677 flow [2022-12-05 21:17:03,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 671 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 21:17:03,270 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 506 flow [2022-12-05 21:17:03,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2022-12-05 21:17:03,271 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2022-12-05 21:17:03,271 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 506 flow [2022-12-05 21:17:03,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:03,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:03,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:03,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 21:17:03,272 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 1 more)] === [2022-12-05 21:17:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1715563337, now seen corresponding path program 5 times [2022-12-05 21:17:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:03,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51790075] [2022-12-05 21:17:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:03,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:03,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51790075] [2022-12-05 21:17:03,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51790075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:03,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:03,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380930896] [2022-12-05 21:17:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:03,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:03,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:03,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 21:17:03,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:03,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:03,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 21:17:03,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:04,504 INFO L130 PetriNetUnfolder]: 8035/12607 cut-off events. [2022-12-05 21:17:04,505 INFO L131 PetriNetUnfolder]: For 10205/10217 co-relation queries the response was YES. [2022-12-05 21:17:04,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35895 conditions, 12607 events. 8035/12607 cut-off events. For 10205/10217 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 74185 event pairs, 2886 based on Foata normal form. 3/12587 useless extension candidates. Maximal degree in co-relation 34105. Up to 3637 conditions per place. [2022-12-05 21:17:04,572 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 211 selfloop transitions, 28 changer transitions 29/272 dead transitions. [2022-12-05 21:17:04,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 272 transitions, 1706 flow [2022-12-05 21:17:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:17:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:17:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 241 transitions. [2022-12-05 21:17:04,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5095137420718816 [2022-12-05 21:17:04,573 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 506 flow. Second operand 11 states and 241 transitions. [2022-12-05 21:17:04,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 272 transitions, 1706 flow [2022-12-05 21:17:04,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 272 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 21:17:04,641 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 610 flow [2022-12-05 21:17:04,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=610, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2022-12-05 21:17:04,642 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2022-12-05 21:17:04,642 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 610 flow [2022-12-05 21:17:04,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:04,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:04,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:04,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 21:17:04,643 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 1 more)] === [2022-12-05 21:17:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1161128977, now seen corresponding path program 6 times [2022-12-05 21:17:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552858091] [2022-12-05 21:17:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552858091] [2022-12-05 21:17:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552858091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:05,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:05,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 21:17:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108773824] [2022-12-05 21:17:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:05,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:05,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 610 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:05,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:05,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:05,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:06,082 INFO L130 PetriNetUnfolder]: 7449/12852 cut-off events. [2022-12-05 21:17:06,083 INFO L131 PetriNetUnfolder]: For 9379/9519 co-relation queries the response was YES. [2022-12-05 21:17:06,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34463 conditions, 12852 events. 7449/12852 cut-off events. For 9379/9519 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 89147 event pairs, 2425 based on Foata normal form. 184/12670 useless extension candidates. Maximal degree in co-relation 34391. Up to 8465 conditions per place. [2022-12-05 21:17:06,149 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 130 selfloop transitions, 28 changer transitions 1/206 dead transitions. [2022-12-05 21:17:06,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 206 transitions, 1259 flow [2022-12-05 21:17:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:17:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:17:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2022-12-05 21:17:06,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5167958656330749 [2022-12-05 21:17:06,151 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 610 flow. Second operand 9 states and 200 transitions. [2022-12-05 21:17:06,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 206 transitions, 1259 flow [2022-12-05 21:17:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 206 transitions, 1214 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-05 21:17:06,218 INFO L231 Difference]: Finished difference. Result has 106 places, 128 transitions, 796 flow [2022-12-05 21:17:06,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=796, PETRI_PLACES=106, PETRI_TRANSITIONS=128} [2022-12-05 21:17:06,220 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2022-12-05 21:17:06,220 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 128 transitions, 796 flow [2022-12-05 21:17:06,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:06,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:06,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:06,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 21:17:06,221 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 1 more)] === [2022-12-05 21:17:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash -902425605, now seen corresponding path program 7 times [2022-12-05 21:17:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:06,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137049010] [2022-12-05 21:17:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137049010] [2022-12-05 21:17:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137049010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:06,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:06,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 21:17:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942497135] [2022-12-05 21:17:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 21:17:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 21:17:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 21:17:06,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-05 21:17:06,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 128 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:06,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-05 21:17:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:07,161 INFO L130 PetriNetUnfolder]: 5808/10438 cut-off events. [2022-12-05 21:17:07,161 INFO L131 PetriNetUnfolder]: For 13337/13774 co-relation queries the response was YES. [2022-12-05 21:17:07,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32314 conditions, 10438 events. 5808/10438 cut-off events. For 13337/13774 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 75164 event pairs, 4050 based on Foata normal form. 112/10126 useless extension candidates. Maximal degree in co-relation 31401. Up to 8324 conditions per place. [2022-12-05 21:17:07,211 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 94 selfloop transitions, 10 changer transitions 0/158 dead transitions. [2022-12-05 21:17:07,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 158 transitions, 1161 flow [2022-12-05 21:17:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:17:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:17:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-05 21:17:07,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2022-12-05 21:17:07,212 INFO L175 Difference]: Start difference. First operand has 106 places, 128 transitions, 796 flow. Second operand 3 states and 80 transitions. [2022-12-05 21:17:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 158 transitions, 1161 flow [2022-12-05 21:17:07,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 158 transitions, 1127 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:07,263 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 804 flow [2022-12-05 21:17:07,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2022-12-05 21:17:07,264 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2022-12-05 21:17:07,264 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 804 flow [2022-12-05 21:17:07,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:07,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:07,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:07,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 21:17:07,264 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 1 more)] === [2022-12-05 21:17:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 647081491, now seen corresponding path program 8 times [2022-12-05 21:17:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931482090] [2022-12-05 21:17:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:07,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931482090] [2022-12-05 21:17:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931482090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:07,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:07,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 21:17:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101766935] [2022-12-05 21:17:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:07,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:07,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:07,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 804 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:07,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:07,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:09,062 INFO L130 PetriNetUnfolder]: 8612/15343 cut-off events. [2022-12-05 21:17:09,062 INFO L131 PetriNetUnfolder]: For 19906/20344 co-relation queries the response was YES. [2022-12-05 21:17:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48788 conditions, 15343 events. 8612/15343 cut-off events. For 19906/20344 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 113350 event pairs, 1701 based on Foata normal form. 232/15222 useless extension candidates. Maximal degree in co-relation 47657. Up to 7754 conditions per place. [2022-12-05 21:17:09,152 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 163 selfloop transitions, 37 changer transitions 3/250 dead transitions. [2022-12-05 21:17:09,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 250 transitions, 1742 flow [2022-12-05 21:17:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:17:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:17:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2022-12-05 21:17:09,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.524547803617571 [2022-12-05 21:17:09,154 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 804 flow. Second operand 9 states and 203 transitions. [2022-12-05 21:17:09,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 250 transitions, 1742 flow [2022-12-05 21:17:09,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 250 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 21:17:09,237 INFO L231 Difference]: Finished difference. Result has 122 places, 155 transitions, 1101 flow [2022-12-05 21:17:09,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=122, PETRI_TRANSITIONS=155} [2022-12-05 21:17:09,239 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 69 predicate places. [2022-12-05 21:17:09,239 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 155 transitions, 1101 flow [2022-12-05 21:17:09,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:09,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:09,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:09,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 21:17:09,239 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 1 more)] === [2022-12-05 21:17:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash -46493515, now seen corresponding path program 9 times [2022-12-05 21:17:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:09,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571385561] [2022-12-05 21:17:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571385561] [2022-12-05 21:17:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571385561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:09,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:09,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 21:17:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860089272] [2022-12-05 21:17:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:09,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:17:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:17:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:17:09,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:09,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 155 transitions, 1101 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:09,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:09,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:09,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:11,502 INFO L130 PetriNetUnfolder]: 9367/16982 cut-off events. [2022-12-05 21:17:11,502 INFO L131 PetriNetUnfolder]: For 34881/36057 co-relation queries the response was YES. [2022-12-05 21:17:11,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59441 conditions, 16982 events. 9367/16982 cut-off events. For 34881/36057 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 129280 event pairs, 3914 based on Foata normal form. 89/16743 useless extension candidates. Maximal degree in co-relation 57697. Up to 10536 conditions per place. [2022-12-05 21:17:11,604 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 199 selfloop transitions, 52 changer transitions 0/298 dead transitions. [2022-12-05 21:17:11,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2370 flow [2022-12-05 21:17:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:17:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:17:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2022-12-05 21:17:11,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 21:17:11,606 INFO L175 Difference]: Start difference. First operand has 122 places, 155 transitions, 1101 flow. Second operand 9 states and 215 transitions. [2022-12-05 21:17:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2370 flow [2022-12-05 21:17:11,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2326 flow, removed 22 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:11,814 INFO L231 Difference]: Finished difference. Result has 136 places, 189 transitions, 1546 flow [2022-12-05 21:17:11,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1546, PETRI_PLACES=136, PETRI_TRANSITIONS=189} [2022-12-05 21:17:11,815 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 83 predicate places. [2022-12-05 21:17:11,815 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 189 transitions, 1546 flow [2022-12-05 21:17:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:11,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:11,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:11,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 21:17:11,815 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 1 more)] === [2022-12-05 21:17:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1752300565, now seen corresponding path program 10 times [2022-12-05 21:17:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:11,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860578478] [2022-12-05 21:17:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860578478] [2022-12-05 21:17:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860578478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 21:17:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287421016] [2022-12-05 21:17:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:11,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 21:17:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 21:17:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 21:17:11,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-05 21:17:11,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 189 transitions, 1546 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:11,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:11,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-05 21:17:11,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:12,078 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 42#L190-4true, 24#L136true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 22#L56true, 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,078 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-05 21:17:12,078 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-05 21:17:12,078 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-05 21:17:12,078 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-05 21:17:12,108 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 42#L190-4true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 124#L142true, Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 22#L56true, 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 43#L103true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,108 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2022-12-05 21:17:12,109 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-05 21:17:12,109 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-05 21:17:12,109 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-05 21:17:12,135 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 42#L190-4true, 24#L136true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), 9#L60true, Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,136 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,136 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,136 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,136 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,137 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 24#L136true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 22#L56true, 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, 117#L191-1true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,137 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,137 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,137 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,137 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-05 21:17:12,159 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 42#L190-4true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), 124#L142true, Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), 9#L60true, Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 43#L103true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,159 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,159 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,159 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,159 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,169 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 124#L142true, Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 22#L56true, 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 43#L103true, 117#L191-1true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,169 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,169 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,169 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,169 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-05 21:17:12,196 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 24#L136true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 9#L60true, Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, 117#L191-1true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,196 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,196 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,196 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,196 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,197 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 42#L190-4true, 24#L136true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), 102#L63true, Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 158#(= ~i~0 0), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,197 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,197 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,197 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,197 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-05 21:17:12,223 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), 124#L142true, Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), 9#L60true, Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 117#L191-1true, 43#L103true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,223 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,226 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 42#L190-4true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), 102#L63true, Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 124#L142true, Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 43#L103true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,226 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,226 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,226 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,226 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-05 21:17:12,265 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L103-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (not (= v_~n1~0_45 0)) (or (< v_~n1~0_45 v_~n2~0_41) (= v_~n1~0_45 v_~n2~0_41)))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_41, ~n1~0=v_~n1~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][38], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 24#L136true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), 102#L63true, Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 158#(= ~i~0 0), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 183#true, Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 6#L106true, 117#L191-1true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,266 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-05 21:17:12,266 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 21:17:12,266 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 21:17:12,266 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 21:17:12,295 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1][63], [Black: 243#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 249#(and (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), 233#(= ~i~0 0), 102#L63true, Black: 265#(and (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n2~0 ~n1~0)), Black: 260#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 158#(= ~i~0 0), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), Black: 266#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 263#(and (<= 1 ~n2~0) (= ~n3~0 0) (<= ~n2~0 ~n1~0)), 183#true, Black: 264#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 261#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), 124#L142true, Black: 278#(= ~e1~0 1), 280#true, 296#true, Black: 201#(= ~i1~0 0), 258#true, Black: 288#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 210#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), Black: 283#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 218#(and (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0)), Black: 282#(= ~n3~0 0), Black: 286#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 284#(and (= ~n3~0 0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 285#(and (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(= ~e3~0 1), Black: 287#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 117#L191-1true, 43#L103true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 299#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 298#(= ~n2~0 0), Black: 303#(and (= ~n2~0 0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 302#(and (= ~n2~0 0) (<= ~n1~0 (+ ~n3~0 1)) (<= (+ ~n2~0 1) ~n1~0)), Black: 301#(and (or (<= ~n1~0 1) (<= ~n1~0 (+ ~n3~0 1))) (= ~n2~0 0) (<= (+ ~n2~0 1) ~n1~0)), Black: 300#(and (= ~n2~0 0) (or (<= ~n1~0 ~n3~0) (= ~n1~0 0)) (<= ~n2~0 ~n1~0)), 313#true, Black: 247#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0))]) [2022-12-05 21:17:12,295 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-05 21:17:12,295 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-05 21:17:12,295 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-05 21:17:12,295 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-05 21:17:13,492 INFO L130 PetriNetUnfolder]: 7858/15034 cut-off events. [2022-12-05 21:17:13,493 INFO L131 PetriNetUnfolder]: For 49361/51570 co-relation queries the response was YES. [2022-12-05 21:17:13,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57174 conditions, 15034 events. 7858/15034 cut-off events. For 49361/51570 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 121426 event pairs, 5563 based on Foata normal form. 191/14862 useless extension candidates. Maximal degree in co-relation 55143. Up to 12087 conditions per place. [2022-12-05 21:17:13,604 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 133 selfloop transitions, 14 changer transitions 0/211 dead transitions. [2022-12-05 21:17:13,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 211 transitions, 1989 flow [2022-12-05 21:17:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:17:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:17:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-05 21:17:13,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2022-12-05 21:17:13,605 INFO L175 Difference]: Start difference. First operand has 136 places, 189 transitions, 1546 flow. Second operand 3 states and 80 transitions. [2022-12-05 21:17:13,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 211 transitions, 1989 flow [2022-12-05 21:17:13,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 211 transitions, 1909 flow, removed 40 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:13,797 INFO L231 Difference]: Finished difference. Result has 139 places, 189 transitions, 1514 flow [2022-12-05 21:17:13,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=139, PETRI_TRANSITIONS=189} [2022-12-05 21:17:13,798 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2022-12-05 21:17:13,798 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 189 transitions, 1514 flow [2022-12-05 21:17:13,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:13,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:13,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 21:17:13,799 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 1 more)] === [2022-12-05 21:17:13,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2139650765, now seen corresponding path program 11 times [2022-12-05 21:17:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024609619] [2022-12-05 21:17:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:14,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024609619] [2022-12-05 21:17:14,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024609619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:14,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:14,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963617581] [2022-12-05 21:17:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:14,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:17:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:17:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:17:14,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:14,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 189 transitions, 1514 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:14,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:14,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:14,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:16,170 INFO L130 PetriNetUnfolder]: 9479/17454 cut-off events. [2022-12-05 21:17:16,170 INFO L131 PetriNetUnfolder]: For 56051/58310 co-relation queries the response was YES. [2022-12-05 21:17:16,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67733 conditions, 17454 events. 9479/17454 cut-off events. For 56051/58310 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 135543 event pairs, 3880 based on Foata normal form. 100/17273 useless extension candidates. Maximal degree in co-relation 65922. Up to 14497 conditions per place. [2022-12-05 21:17:16,277 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 185 selfloop transitions, 37 changer transitions 0/269 dead transitions. [2022-12-05 21:17:16,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 269 transitions, 2489 flow [2022-12-05 21:17:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 21:17:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 21:17:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-05 21:17:16,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4950166112956811 [2022-12-05 21:17:16,279 INFO L175 Difference]: Start difference. First operand has 139 places, 189 transitions, 1514 flow. Second operand 7 states and 149 transitions. [2022-12-05 21:17:16,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 269 transitions, 2489 flow [2022-12-05 21:17:16,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 269 transitions, 2453 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 21:17:16,599 INFO L231 Difference]: Finished difference. Result has 148 places, 218 transitions, 1967 flow [2022-12-05 21:17:16,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1967, PETRI_PLACES=148, PETRI_TRANSITIONS=218} [2022-12-05 21:17:16,599 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 95 predicate places. [2022-12-05 21:17:16,599 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 218 transitions, 1967 flow [2022-12-05 21:17:16,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:16,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:16,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:16,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 21:17:16,600 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 1 more)] === [2022-12-05 21:17:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash -916698615, now seen corresponding path program 12 times [2022-12-05 21:17:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:16,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448964515] [2022-12-05 21:17:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:16,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448964515] [2022-12-05 21:17:16,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448964515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:16,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:16,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 21:17:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6762469] [2022-12-05 21:17:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:17:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:17:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 21:17:16,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:16,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 218 transitions, 1967 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:16,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:16,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:16,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:19,002 INFO L130 PetriNetUnfolder]: 10330/18605 cut-off events. [2022-12-05 21:17:19,003 INFO L131 PetriNetUnfolder]: For 70956/73114 co-relation queries the response was YES. [2022-12-05 21:17:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75180 conditions, 18605 events. 10330/18605 cut-off events. For 70956/73114 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 142280 event pairs, 4400 based on Foata normal form. 302/18574 useless extension candidates. Maximal degree in co-relation 73246. Up to 14983 conditions per place. [2022-12-05 21:17:19,164 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 225 selfloop transitions, 29 changer transitions 0/301 dead transitions. [2022-12-05 21:17:19,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 301 transitions, 3113 flow [2022-12-05 21:17:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:17:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:17:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-05 21:17:19,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5387596899224806 [2022-12-05 21:17:19,165 INFO L175 Difference]: Start difference. First operand has 148 places, 218 transitions, 1967 flow. Second operand 6 states and 139 transitions. [2022-12-05 21:17:19,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 301 transitions, 3113 flow [2022-12-05 21:17:19,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 301 transitions, 2921 flow, removed 96 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:19,518 INFO L231 Difference]: Finished difference. Result has 156 places, 237 transitions, 2125 flow [2022-12-05 21:17:19,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1839, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2125, PETRI_PLACES=156, PETRI_TRANSITIONS=237} [2022-12-05 21:17:19,518 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 103 predicate places. [2022-12-05 21:17:19,519 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 237 transitions, 2125 flow [2022-12-05 21:17:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:19,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:19,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 21:17:19,519 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 1 more)] === [2022-12-05 21:17:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash 445168451, now seen corresponding path program 13 times [2022-12-05 21:17:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:19,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568579867] [2022-12-05 21:17:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:19,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568579867] [2022-12-05 21:17:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568579867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:19,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 21:17:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481176612] [2022-12-05 21:17:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:17:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:17:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 21:17:19,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:19,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 237 transitions, 2125 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:19,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:19,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:19,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:22,408 INFO L130 PetriNetUnfolder]: 11678/21283 cut-off events. [2022-12-05 21:17:22,408 INFO L131 PetriNetUnfolder]: For 84478/86345 co-relation queries the response was YES. [2022-12-05 21:17:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87658 conditions, 21283 events. 11678/21283 cut-off events. For 84478/86345 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 168822 event pairs, 3770 based on Foata normal form. 302/21273 useless extension candidates. Maximal degree in co-relation 85786. Up to 15386 conditions per place. [2022-12-05 21:17:22,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 220 selfloop transitions, 48 changer transitions 2/317 dead transitions. [2022-12-05 21:17:22,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 317 transitions, 3190 flow [2022-12-05 21:17:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:17:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:17:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-12-05 21:17:22,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.562015503875969 [2022-12-05 21:17:22,564 INFO L175 Difference]: Start difference. First operand has 156 places, 237 transitions, 2125 flow. Second operand 6 states and 145 transitions. [2022-12-05 21:17:22,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 317 transitions, 3190 flow [2022-12-05 21:17:22,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 317 transitions, 3162 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:22,954 INFO L231 Difference]: Finished difference. Result has 164 places, 258 transitions, 2509 flow [2022-12-05 21:17:22,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2509, PETRI_PLACES=164, PETRI_TRANSITIONS=258} [2022-12-05 21:17:22,955 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 111 predicate places. [2022-12-05 21:17:22,955 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 258 transitions, 2509 flow [2022-12-05 21:17:22,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:22,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:22,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:22,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 21:17:22,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1910413419, now seen corresponding path program 14 times [2022-12-05 21:17:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598476700] [2022-12-05 21:17:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:23,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:23,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598476700] [2022-12-05 21:17:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598476700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:23,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:23,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 21:17:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788923296] [2022-12-05 21:17:23,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:23,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:17:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:23,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:17:23,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 21:17:23,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:23,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 258 transitions, 2509 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:23,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:23,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:23,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:26,244 INFO L130 PetriNetUnfolder]: 12077/22026 cut-off events. [2022-12-05 21:17:26,244 INFO L131 PetriNetUnfolder]: For 97141/99585 co-relation queries the response was YES. [2022-12-05 21:17:26,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93715 conditions, 22026 events. 12077/22026 cut-off events. For 97141/99585 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 175575 event pairs, 5262 based on Foata normal form. 238/21932 useless extension candidates. Maximal degree in co-relation 91695. Up to 17716 conditions per place. [2022-12-05 21:17:26,454 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 247 selfloop transitions, 32 changer transitions 1/327 dead transitions. [2022-12-05 21:17:26,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 327 transitions, 3582 flow [2022-12-05 21:17:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:17:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:17:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-12-05 21:17:26,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2022-12-05 21:17:26,455 INFO L175 Difference]: Start difference. First operand has 164 places, 258 transitions, 2509 flow. Second operand 6 states and 135 transitions. [2022-12-05 21:17:26,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 327 transitions, 3582 flow [2022-12-05 21:17:26,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 327 transitions, 3547 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-05 21:17:26,973 INFO L231 Difference]: Finished difference. Result has 171 places, 274 transitions, 2795 flow [2022-12-05 21:17:26,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2795, PETRI_PLACES=171, PETRI_TRANSITIONS=274} [2022-12-05 21:17:26,974 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2022-12-05 21:17:26,974 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 274 transitions, 2795 flow [2022-12-05 21:17:26,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:26,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:26,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:26,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 21:17:26,974 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1252015599, now seen corresponding path program 15 times [2022-12-05 21:17:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:26,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493208374] [2022-12-05 21:17:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493208374] [2022-12-05 21:17:27,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493208374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:27,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:27,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 21:17:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553281042] [2022-12-05 21:17:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:27,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:27,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:27,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 274 transitions, 2795 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:27,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:27,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:27,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:30,317 INFO L130 PetriNetUnfolder]: 13257/23586 cut-off events. [2022-12-05 21:17:30,317 INFO L131 PetriNetUnfolder]: For 114216/117057 co-relation queries the response was YES. [2022-12-05 21:17:30,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102163 conditions, 23586 events. 13257/23586 cut-off events. For 114216/117057 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 185471 event pairs, 5584 based on Foata normal form. 364/23471 useless extension candidates. Maximal degree in co-relation 100015. Up to 17315 conditions per place. [2022-12-05 21:17:30,602 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 294 selfloop transitions, 69 changer transitions 4/414 dead transitions. [2022-12-05 21:17:30,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 414 transitions, 4503 flow [2022-12-05 21:17:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:17:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:17:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2022-12-05 21:17:30,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2022-12-05 21:17:30,604 INFO L175 Difference]: Start difference. First operand has 171 places, 274 transitions, 2795 flow. Second operand 9 states and 210 transitions. [2022-12-05 21:17:30,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 414 transitions, 4503 flow [2022-12-05 21:17:31,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 414 transitions, 4470 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-05 21:17:31,184 INFO L231 Difference]: Finished difference. Result has 184 places, 315 transitions, 3456 flow [2022-12-05 21:17:31,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3456, PETRI_PLACES=184, PETRI_TRANSITIONS=315} [2022-12-05 21:17:31,185 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 131 predicate places. [2022-12-05 21:17:31,185 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 315 transitions, 3456 flow [2022-12-05 21:17:31,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:31,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:31,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:31,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 21:17:31,185 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1205320803, now seen corresponding path program 16 times [2022-12-05 21:17:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:31,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853608964] [2022-12-05 21:17:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:31,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:31,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853608964] [2022-12-05 21:17:31,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853608964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:31,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329277677] [2022-12-05 21:17:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:17:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:17:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:17:31,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 21:17:31,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 315 transitions, 3456 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:31,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:31,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 21:17:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:36,134 INFO L130 PetriNetUnfolder]: 19722/32594 cut-off events. [2022-12-05 21:17:36,134 INFO L131 PetriNetUnfolder]: For 188463/189419 co-relation queries the response was YES. [2022-12-05 21:17:36,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150714 conditions, 32594 events. 19722/32594 cut-off events. For 188463/189419 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 238723 event pairs, 7520 based on Foata normal form. 149/32489 useless extension candidates. Maximal degree in co-relation 147091. Up to 10392 conditions per place. [2022-12-05 21:17:36,579 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 517 selfloop transitions, 38 changer transitions 51/660 dead transitions. [2022-12-05 21:17:36,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 660 transitions, 7836 flow [2022-12-05 21:17:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:17:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:17:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions. [2022-12-05 21:17:36,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5010570824524313 [2022-12-05 21:17:36,581 INFO L175 Difference]: Start difference. First operand has 184 places, 315 transitions, 3456 flow. Second operand 11 states and 237 transitions. [2022-12-05 21:17:36,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 660 transitions, 7836 flow [2022-12-05 21:17:37,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 660 transitions, 7654 flow, removed 91 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:37,734 INFO L231 Difference]: Finished difference. Result has 199 places, 334 transitions, 3646 flow [2022-12-05 21:17:37,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3646, PETRI_PLACES=199, PETRI_TRANSITIONS=334} [2022-12-05 21:17:37,735 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 146 predicate places. [2022-12-05 21:17:37,735 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 334 transitions, 3646 flow [2022-12-05 21:17:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:37,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:37,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:37,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 21:17:37,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1129972151, now seen corresponding path program 17 times [2022-12-05 21:17:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105369514] [2022-12-05 21:17:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:38,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105369514] [2022-12-05 21:17:38,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105369514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:38,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645131401] [2022-12-05 21:17:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:38,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:17:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:17:38,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:17:38,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:38,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 334 transitions, 3646 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:38,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:38,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:38,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:41,960 INFO L130 PetriNetUnfolder]: 15052/27585 cut-off events. [2022-12-05 21:17:41,960 INFO L131 PetriNetUnfolder]: For 163629/167210 co-relation queries the response was YES. [2022-12-05 21:17:42,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127632 conditions, 27585 events. 15052/27585 cut-off events. For 163629/167210 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 229473 event pairs, 5561 based on Foata normal form. 413/27686 useless extension candidates. Maximal degree in co-relation 127312. Up to 20188 conditions per place. [2022-12-05 21:17:42,295 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 283 selfloop transitions, 56 changer transitions 5/411 dead transitions. [2022-12-05 21:17:42,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 411 transitions, 4858 flow [2022-12-05 21:17:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 21:17:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 21:17:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2022-12-05 21:17:42,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5282392026578073 [2022-12-05 21:17:42,297 INFO L175 Difference]: Start difference. First operand has 199 places, 334 transitions, 3646 flow. Second operand 7 states and 159 transitions. [2022-12-05 21:17:42,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 411 transitions, 4858 flow [2022-12-05 21:17:43,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 411 transitions, 4813 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-05 21:17:43,264 INFO L231 Difference]: Finished difference. Result has 203 places, 339 transitions, 3838 flow [2022-12-05 21:17:43,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3838, PETRI_PLACES=203, PETRI_TRANSITIONS=339} [2022-12-05 21:17:43,265 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 150 predicate places. [2022-12-05 21:17:43,265 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 339 transitions, 3838 flow [2022-12-05 21:17:43,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:43,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:43,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:43,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 21:17:43,265 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -212191459, now seen corresponding path program 18 times [2022-12-05 21:17:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004026532] [2022-12-05 21:17:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:43,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004026532] [2022-12-05 21:17:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004026532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 21:17:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785772034] [2022-12-05 21:17:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:43,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 21:17:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 21:17:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-05 21:17:43,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:43,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 339 transitions, 3838 flow. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:43,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:43,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:17:50,363 INFO L130 PetriNetUnfolder]: 23630/43125 cut-off events. [2022-12-05 21:17:50,363 INFO L131 PetriNetUnfolder]: For 300719/307684 co-relation queries the response was YES. [2022-12-05 21:17:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204084 conditions, 43125 events. 23630/43125 cut-off events. For 300719/307684 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 387546 event pairs, 6617 based on Foata normal form. 1596/44002 useless extension candidates. Maximal degree in co-relation 197770. Up to 16448 conditions per place. [2022-12-05 21:17:51,000 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 409 selfloop transitions, 205 changer transitions 40/721 dead transitions. [2022-12-05 21:17:51,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 721 transitions, 8485 flow [2022-12-05 21:17:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 21:17:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 21:17:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 461 transitions. [2022-12-05 21:17:51,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.536046511627907 [2022-12-05 21:17:51,002 INFO L175 Difference]: Start difference. First operand has 203 places, 339 transitions, 3838 flow. Second operand 20 states and 461 transitions. [2022-12-05 21:17:51,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 721 transitions, 8485 flow [2022-12-05 21:17:53,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 721 transitions, 8455 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-12-05 21:17:53,456 INFO L231 Difference]: Finished difference. Result has 240 places, 458 transitions, 6216 flow [2022-12-05 21:17:53,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3812, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6216, PETRI_PLACES=240, PETRI_TRANSITIONS=458} [2022-12-05 21:17:53,457 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 187 predicate places. [2022-12-05 21:17:53,457 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 458 transitions, 6216 flow [2022-12-05 21:17:53,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:53,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:17:53,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:17:53,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 21:17:53,457 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:17:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:17:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 563574117, now seen corresponding path program 19 times [2022-12-05 21:17:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:17:53,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513685746] [2022-12-05 21:17:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:17:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:17:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:17:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:17:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:17:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513685746] [2022-12-05 21:17:53,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513685746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:17:53,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:17:53,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:17:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314834300] [2022-12-05 21:17:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:17:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:17:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:17:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:17:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:17:53,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:17:53,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 458 transitions, 6216 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:17:53,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:17:53,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:17:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:18:01,803 INFO L130 PetriNetUnfolder]: 23314/42903 cut-off events. [2022-12-05 21:18:01,803 INFO L131 PetriNetUnfolder]: For 472291/482068 co-relation queries the response was YES. [2022-12-05 21:18:02,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234869 conditions, 42903 events. 23314/42903 cut-off events. For 472291/482068 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 388255 event pairs, 10544 based on Foata normal form. 748/42917 useless extension candidates. Maximal degree in co-relation 227628. Up to 33281 conditions per place. [2022-12-05 21:18:02,770 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 383 selfloop transitions, 68 changer transitions 6/524 dead transitions. [2022-12-05 21:18:02,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 524 transitions, 7677 flow [2022-12-05 21:18:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 21:18:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 21:18:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2022-12-05 21:18:02,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5087209302325582 [2022-12-05 21:18:02,771 INFO L175 Difference]: Start difference. First operand has 240 places, 458 transitions, 6216 flow. Second operand 8 states and 175 transitions. [2022-12-05 21:18:02,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 524 transitions, 7677 flow [2022-12-05 21:18:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 524 transitions, 7168 flow, removed 251 selfloop flow, removed 3 redundant places. [2022-12-05 21:18:07,196 INFO L231 Difference]: Finished difference. Result has 244 places, 452 transitions, 5930 flow [2022-12-05 21:18:07,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5432, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5930, PETRI_PLACES=244, PETRI_TRANSITIONS=452} [2022-12-05 21:18:07,197 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 191 predicate places. [2022-12-05 21:18:07,197 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 452 transitions, 5930 flow [2022-12-05 21:18:07,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:07,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:18:07,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:18:07,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 21:18:07,197 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:18:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:18:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1779906175, now seen corresponding path program 20 times [2022-12-05 21:18:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:18:07,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072507367] [2022-12-05 21:18:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:18:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:18:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:18:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:18:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:18:07,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072507367] [2022-12-05 21:18:07,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072507367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:18:07,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:18:07,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:18:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857110361] [2022-12-05 21:18:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:18:07,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:18:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:18:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:18:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:18:07,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:18:07,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 452 transitions, 5930 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:07,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:18:07,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:18:07,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:18:15,947 INFO L130 PetriNetUnfolder]: 25185/45866 cut-off events. [2022-12-05 21:18:15,947 INFO L131 PetriNetUnfolder]: For 512031/521047 co-relation queries the response was YES. [2022-12-05 21:18:16,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249257 conditions, 45866 events. 25185/45866 cut-off events. For 512031/521047 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 414927 event pairs, 10701 based on Foata normal form. 1048/45853 useless extension candidates. Maximal degree in co-relation 242186. Up to 32727 conditions per place. [2022-12-05 21:18:16,850 INFO L137 encePairwiseOnDemand]: 32/43 looper letters, 426 selfloop transitions, 72 changer transitions 2/567 dead transitions. [2022-12-05 21:18:16,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 567 transitions, 8041 flow [2022-12-05 21:18:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 21:18:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 21:18:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-12-05 21:18:16,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5552325581395349 [2022-12-05 21:18:16,852 INFO L175 Difference]: Start difference. First operand has 244 places, 452 transitions, 5930 flow. Second operand 8 states and 191 transitions. [2022-12-05 21:18:16,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 567 transitions, 8041 flow [2022-12-05 21:18:21,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 567 transitions, 7847 flow, removed 73 selfloop flow, removed 3 redundant places. [2022-12-05 21:18:21,074 INFO L231 Difference]: Finished difference. Result has 252 places, 473 transitions, 6325 flow [2022-12-05 21:18:21,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5740, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6325, PETRI_PLACES=252, PETRI_TRANSITIONS=473} [2022-12-05 21:18:21,074 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 199 predicate places. [2022-12-05 21:18:21,074 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 473 transitions, 6325 flow [2022-12-05 21:18:21,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:21,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:18:21,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:18:21,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 21:18:21,075 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:18:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:18:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 690339365, now seen corresponding path program 21 times [2022-12-05 21:18:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:18:21,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049412712] [2022-12-05 21:18:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:18:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:18:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:18:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:18:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:18:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049412712] [2022-12-05 21:18:21,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049412712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:18:21,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:18:21,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 21:18:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220031787] [2022-12-05 21:18:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:18:21,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:18:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:18:21,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:18:21,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 21:18:21,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2022-12-05 21:18:21,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 473 transitions, 6325 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:21,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:18:21,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2022-12-05 21:18:21,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:18:30,421 INFO L130 PetriNetUnfolder]: 26026/47985 cut-off events. [2022-12-05 21:18:30,422 INFO L131 PetriNetUnfolder]: For 527140/534711 co-relation queries the response was YES. [2022-12-05 21:18:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260125 conditions, 47985 events. 26026/47985 cut-off events. For 527140/534711 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 443746 event pairs, 10256 based on Foata normal form. 1170/48521 useless extension candidates. Maximal degree in co-relation 253757. Up to 34748 conditions per place. [2022-12-05 21:18:31,441 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 439 selfloop transitions, 93 changer transitions 3/602 dead transitions. [2022-12-05 21:18:31,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 602 transitions, 8885 flow [2022-12-05 21:18:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:18:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:18:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-12-05 21:18:31,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2022-12-05 21:18:31,442 INFO L175 Difference]: Start difference. First operand has 252 places, 473 transitions, 6325 flow. Second operand 6 states and 151 transitions. [2022-12-05 21:18:31,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 602 transitions, 8885 flow [2022-12-05 21:18:36,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 602 transitions, 8666 flow, removed 96 selfloop flow, removed 2 redundant places. [2022-12-05 21:18:36,712 INFO L231 Difference]: Finished difference. Result has 259 places, 498 transitions, 6916 flow [2022-12-05 21:18:36,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6148, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6916, PETRI_PLACES=259, PETRI_TRANSITIONS=498} [2022-12-05 21:18:36,713 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 206 predicate places. [2022-12-05 21:18:36,713 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 498 transitions, 6916 flow [2022-12-05 21:18:36,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:36,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:18:36,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:18:36,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 21:18:36,714 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:18:36,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:18:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash -477922355, now seen corresponding path program 22 times [2022-12-05 21:18:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:18:36,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609058966] [2022-12-05 21:18:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:18:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:18:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:18:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:18:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:18:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609058966] [2022-12-05 21:18:36,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609058966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:18:36,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:18:36,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 21:18:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376631673] [2022-12-05 21:18:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:18:36,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 21:18:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:18:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 21:18:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:18:36,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 21:18:36,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 498 transitions, 6916 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:18:36,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:18:36,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 21:18:36,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand