/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:08:57,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:08:57,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:08:57,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:08:57,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:08:57,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:08:57,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:08:57,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:08:57,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:08:57,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:08:57,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:08:57,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:08:57,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:08:57,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:08:57,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:08:57,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:08:57,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:08:57,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:08:57,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:08:57,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:08:57,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:08:57,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:08:57,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:08:57,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:08:57,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:08:57,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:08:57,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:08:57,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:08:57,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:08:57,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:08:57,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:08:57,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:08:57,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:08:57,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:08:57,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:08:57,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:08:57,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:08:57,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:08:57,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:08:57,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:08:57,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:08:57,048 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:08:57,063 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:08:57,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:08:57,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:08:57,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:08:57,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:08:57,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:08:57,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:57,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:08:57,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:08:57,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:08:57,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:08:57,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:08:57,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:08:57,286 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:08:57,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-06 04:08:58,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:08:58,563 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:08:58,563 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-06 04:08:58,582 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228d2d232/162448676dde4a01a0abcc11dfc7f12f/FLAGe07a3310e [2022-12-06 04:08:58,601 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228d2d232/162448676dde4a01a0abcc11dfc7f12f [2022-12-06 04:08:58,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:08:58,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:08:58,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:58,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:08:58,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:08:58,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:58" (1/1) ... [2022-12-06 04:08:58,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc54a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:58, skipping insertion in model container [2022-12-06 04:08:58,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:58" (1/1) ... [2022-12-06 04:08:58,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:08:58,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:08:58,786 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i[945,958] [2022-12-06 04:08:58,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:58,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:58,963 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:08:58,972 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i[945,958] [2022-12-06 04:08:59,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:59,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:59,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:59,072 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:08:59,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59 WrapperNode [2022-12-06 04:08:59,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:59,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:59,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:08:59,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:08:59,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,106 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 04:08:59,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:59,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:08:59,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:08:59,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:08:59,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,133 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:08:59,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:08:59,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:08:59,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:08:59,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (1/1) ... [2022-12-06 04:08:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:08:59,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:08:59,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:08:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:08:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:08:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:08:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:08:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:08:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:08:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:08:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:08:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:08:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:08:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:08:59,254 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:08:59,376 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:08:59,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:08:59,665 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:08:59,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:08:59,778 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:08:59,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:59 BoogieIcfgContainer [2022-12-06 04:08:59,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:08:59,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:08:59,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:08:59,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:08:59,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:08:58" (1/3) ... [2022-12-06 04:08:59,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b5d708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:59, skipping insertion in model container [2022-12-06 04:08:59,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:59" (2/3) ... [2022-12-06 04:08:59,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b5d708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:59, skipping insertion in model container [2022-12-06 04:08:59,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:59" (3/3) ... [2022-12-06 04:08:59,788 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2022-12-06 04:08:59,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:08:59,802 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:08:59,803 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:08:59,865 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:08:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:08:59,957 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:08:59,957 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:59,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:08:59,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:08:59,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-06 04:08:59,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:59,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:08:59,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-06 04:09:00,020 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:09:00,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:00,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:09:00,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:09:00,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-06 04:09:04,489 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:09:04,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:04,508 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70cb2999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:04,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:09:04,510 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:09:04,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:04,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:04,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:09:04,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 551373, now seen corresponding path program 1 times [2022-12-06 04:09:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456431878] [2022-12-06 04:09:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:04,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456431878] [2022-12-06 04:09:04,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456431878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:04,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:04,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339898966] [2022-12-06 04:09:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:04,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:04,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:09:04,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:04,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:04,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:09:04,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:05,777 INFO L130 PetriNetUnfolder]: 6050/8314 cut-off events. [2022-12-06 04:09:05,778 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 04:09:05,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16713 conditions, 8314 events. 6050/8314 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41432 event pairs, 3098 based on Foata normal form. 0/7558 useless extension candidates. Maximal degree in co-relation 16701. Up to 6574 conditions per place. [2022-12-06 04:09:05,876 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 04:09:05,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 04:09:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 04:09:05,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 04:09:05,885 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 04:09:05,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 04:09:05,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:05,889 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:05,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:09:05,893 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 04:09:05,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:05,893 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:05,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:05,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:05,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:05,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:05,900 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:09:05,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:05,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:05,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:05,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 04:09:05,975 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:05,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 04:09:05,977 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:05,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:05,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:05,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:05,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:05,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2091767448, now seen corresponding path program 1 times [2022-12-06 04:09:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:05,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386854289] [2022-12-06 04:09:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:06,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386854289] [2022-12-06 04:09:06,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386854289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:06,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:06,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643361864] [2022-12-06 04:09:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:06,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:06,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:09:06,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:06,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:06,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:09:06,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:06,711 INFO L130 PetriNetUnfolder]: 4279/5885 cut-off events. [2022-12-06 04:09:06,711 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-12-06 04:09:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12309 conditions, 5885 events. 4279/5885 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 28256 event pairs, 1463 based on Foata normal form. 128/5989 useless extension candidates. Maximal degree in co-relation 12299. Up to 4033 conditions per place. [2022-12-06 04:09:06,736 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-06 04:09:06,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 164 flow [2022-12-06 04:09:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:09:06,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:09:06,738 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:09:06,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 164 flow [2022-12-06 04:09:06,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:06,740 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:06,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 04:09:06,740 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2022-12-06 04:09:06,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:06,741 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:06,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:06,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:06,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:06,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:06,746 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:09:06,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:06,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:09:06,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:06,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 04:09:06,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:06,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 04:09:06,811 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 04:09:06,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:06,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:06,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:06,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 421381839, now seen corresponding path program 1 times [2022-12-06 04:09:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012333688] [2022-12-06 04:09:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:06,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012333688] [2022-12-06 04:09:06,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012333688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:06,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:06,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950188009] [2022-12-06 04:09:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:06,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:06,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:09:06,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:06,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:06,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:09:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:07,302 INFO L130 PetriNetUnfolder]: 2531/3642 cut-off events. [2022-12-06 04:09:07,302 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2022-12-06 04:09:07,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7887 conditions, 3642 events. 2531/3642 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17738 event pairs, 608 based on Foata normal form. 108/3735 useless extension candidates. Maximal degree in co-relation 7876. Up to 3107 conditions per place. [2022-12-06 04:09:07,316 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 38 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2022-12-06 04:09:07,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 203 flow [2022-12-06 04:09:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:09:07,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-06 04:09:07,317 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:09:07,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 203 flow [2022-12-06 04:09:07,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:07,319 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-06 04:09:07,320 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2022-12-06 04:09:07,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:07,320 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:07,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:07,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,329 INFO L130 PetriNetUnfolder]: 45/123 cut-off events. [2022-12-06 04:09:07,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:07,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 123 events. 45/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 23 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 221. Up to 76 conditions per place. [2022-12-06 04:09:07,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 04:09:07,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:07,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:09:07,334 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 99 flow [2022-12-06 04:09:07,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:07,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:07,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:07,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:07,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash 830174434, now seen corresponding path program 1 times [2022-12-06 04:09:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:07,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329248] [2022-12-06 04:09:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:07,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329248] [2022-12-06 04:09:07,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:07,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:07,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52070026] [2022-12-06 04:09:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:07,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:07,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:09:07,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:07,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:07,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:09:07,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:07,719 INFO L130 PetriNetUnfolder]: 1397/2130 cut-off events. [2022-12-06 04:09:07,719 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-12-06 04:09:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 2130 events. 1397/2130 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10206 event pairs, 371 based on Foata normal form. 135/2250 useless extension candidates. Maximal degree in co-relation 5376. Up to 965 conditions per place. [2022-12-06 04:09:07,733 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 51 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2022-12-06 04:09:07,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 303 flow [2022-12-06 04:09:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 04:09:07,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-06 04:09:07,736 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 99 flow. Second operand 4 states and 73 transitions. [2022-12-06 04:09:07,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 303 flow [2022-12-06 04:09:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:07,738 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-06 04:09:07,739 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2022-12-06 04:09:07,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:07,740 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:07,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:07,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,750 INFO L130 PetriNetUnfolder]: 33/101 cut-off events. [2022-12-06 04:09:07,750 INFO L131 PetriNetUnfolder]: For 18/34 co-relation queries the response was YES. [2022-12-06 04:09:07,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 101 events. 33/101 cut-off events. For 18/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 321 event pairs, 7 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 247. Up to 60 conditions per place. [2022-12-06 04:09:07,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-06 04:09:07,803 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:07,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 04:09:07,809 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 146 flow [2022-12-06 04:09:07,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:07,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:07,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:07,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:07,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 332537280, now seen corresponding path program 1 times [2022-12-06 04:09:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:07,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237820080] [2022-12-06 04:09:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:08,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237820080] [2022-12-06 04:09:08,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237820080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:08,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:08,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:08,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433678801] [2022-12-06 04:09:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:08,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:08,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:09:08,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:08,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:08,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:09:08,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:08,706 INFO L130 PetriNetUnfolder]: 1691/2602 cut-off events. [2022-12-06 04:09:08,706 INFO L131 PetriNetUnfolder]: For 1678/1678 co-relation queries the response was YES. [2022-12-06 04:09:08,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 2602 events. 1691/2602 cut-off events. For 1678/1678 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12815 event pairs, 327 based on Foata normal form. 39/2638 useless extension candidates. Maximal degree in co-relation 7416. Up to 1888 conditions per place. [2022-12-06 04:09:08,717 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 57 selfloop transitions, 11 changer transitions 26/97 dead transitions. [2022-12-06 04:09:08,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 547 flow [2022-12-06 04:09:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-12-06 04:09:08,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5291005291005291 [2022-12-06 04:09:08,719 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 146 flow. Second operand 7 states and 100 transitions. [2022-12-06 04:09:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 547 flow [2022-12-06 04:09:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 97 transitions, 511 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:08,723 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 194 flow [2022-12-06 04:09:08,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-06 04:09:08,724 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-06 04:09:08,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:08,724 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 194 flow [2022-12-06 04:09:08,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:08,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:08,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 194 flow [2022-12-06 04:09:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 194 flow [2022-12-06 04:09:08,744 INFO L130 PetriNetUnfolder]: 87/268 cut-off events. [2022-12-06 04:09:08,744 INFO L131 PetriNetUnfolder]: For 98/150 co-relation queries the response was YES. [2022-12-06 04:09:08,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 268 events. 87/268 cut-off events. For 98/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1445 event pairs, 14 based on Foata normal form. 11/266 useless extension candidates. Maximal degree in co-relation 644. Up to 132 conditions per place. [2022-12-06 04:09:08,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 194 flow [2022-12-06 04:09:08,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-06 04:09:08,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:08,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:09:08,749 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 194 flow [2022-12-06 04:09:08,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:08,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:08,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:08,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:08,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1409097624, now seen corresponding path program 2 times [2022-12-06 04:09:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:08,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375734454] [2022-12-06 04:09:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375734454] [2022-12-06 04:09:08,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375734454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:08,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:08,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260209643] [2022-12-06 04:09:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:08,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:09:08,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:08,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:08,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:09:08,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:09,163 INFO L130 PetriNetUnfolder]: 1029/1582 cut-off events. [2022-12-06 04:09:09,163 INFO L131 PetriNetUnfolder]: For 1229/1229 co-relation queries the response was YES. [2022-12-06 04:09:09,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 1582 events. 1029/1582 cut-off events. For 1229/1229 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7320 event pairs, 211 based on Foata normal form. 63/1630 useless extension candidates. Maximal degree in co-relation 4821. Up to 626 conditions per place. [2022-12-06 04:09:09,175 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 74 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2022-12-06 04:09:09,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 529 flow [2022-12-06 04:09:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 04:09:09,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-06 04:09:09,177 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 194 flow. Second operand 5 states and 91 transitions. [2022-12-06 04:09:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 529 flow [2022-12-06 04:09:09,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 519 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:09,182 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-06 04:09:09,183 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-06 04:09:09,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:09,183 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:09,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:09,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,203 INFO L130 PetriNetUnfolder]: 63/188 cut-off events. [2022-12-06 04:09:09,204 INFO L131 PetriNetUnfolder]: For 225/292 co-relation queries the response was YES. [2022-12-06 04:09:09,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 188 events. 63/188 cut-off events. For 225/292 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 787 event pairs, 4 based on Foata normal form. 15/193 useless extension candidates. Maximal degree in co-relation 552. Up to 86 conditions per place. [2022-12-06 04:09:09,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-06 04:09:09,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:09,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 04:09:09,235 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 258 flow [2022-12-06 04:09:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:09,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:09,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:09,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:09,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 116972613, now seen corresponding path program 1 times [2022-12-06 04:09:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:09,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113293387] [2022-12-06 04:09:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113293387] [2022-12-06 04:09:10,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113293387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:10,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:10,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296466625] [2022-12-06 04:09:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:10,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:10,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:10,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:10,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:09:10,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:10,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:10,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:09:10,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:10,581 INFO L130 PetriNetUnfolder]: 1514/2439 cut-off events. [2022-12-06 04:09:10,581 INFO L131 PetriNetUnfolder]: For 3599/3612 co-relation queries the response was YES. [2022-12-06 04:09:10,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8254 conditions, 2439 events. 1514/2439 cut-off events. For 3599/3612 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12828 event pairs, 295 based on Foata normal form. 20/2453 useless extension candidates. Maximal degree in co-relation 8235. Up to 916 conditions per place. [2022-12-06 04:09:10,599 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 92 selfloop transitions, 11 changer transitions 47/153 dead transitions. [2022-12-06 04:09:10,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 153 transitions, 1172 flow [2022-12-06 04:09:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-06 04:09:10,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:09:10,601 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 258 flow. Second operand 7 states and 108 transitions. [2022-12-06 04:09:10,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 153 transitions, 1172 flow [2022-12-06 04:09:10,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 153 transitions, 1018 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:10,625 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 284 flow [2022-12-06 04:09:10,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2022-12-06 04:09:10,626 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-06 04:09:10,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:10,626 INFO L89 Accepts]: Start accepts. Operand has 58 places, 54 transitions, 284 flow [2022-12-06 04:09:10,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:10,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:10,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 284 flow [2022-12-06 04:09:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 284 flow [2022-12-06 04:09:10,653 INFO L130 PetriNetUnfolder]: 97/262 cut-off events. [2022-12-06 04:09:10,653 INFO L131 PetriNetUnfolder]: For 282/340 co-relation queries the response was YES. [2022-12-06 04:09:10,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 262 events. 97/262 cut-off events. For 282/340 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1246 event pairs, 4 based on Foata normal form. 19/267 useless extension candidates. Maximal degree in co-relation 735. Up to 93 conditions per place. [2022-12-06 04:09:10,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 284 flow [2022-12-06 04:09:10,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-06 04:09:10,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:10,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 04:09:10,792 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 290 flow [2022-12-06 04:09:10,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:10,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:10,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:10,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:10,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -792849145, now seen corresponding path program 2 times [2022-12-06 04:09:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:10,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082354712] [2022-12-06 04:09:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082354712] [2022-12-06 04:09:11,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082354712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:11,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:11,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965580515] [2022-12-06 04:09:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:11,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:11,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:09:11,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:11,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:11,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:09:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:11,903 INFO L130 PetriNetUnfolder]: 2614/4150 cut-off events. [2022-12-06 04:09:11,904 INFO L131 PetriNetUnfolder]: For 5457/5464 co-relation queries the response was YES. [2022-12-06 04:09:11,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14061 conditions, 4150 events. 2614/4150 cut-off events. For 5457/5464 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23809 event pairs, 290 based on Foata normal form. 20/4169 useless extension candidates. Maximal degree in co-relation 14039. Up to 1978 conditions per place. [2022-12-06 04:09:11,927 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 102 selfloop transitions, 15 changer transitions 52/171 dead transitions. [2022-12-06 04:09:11,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 171 transitions, 1209 flow [2022-12-06 04:09:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:09:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:09:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 04:09:11,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5491071428571429 [2022-12-06 04:09:11,929 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 290 flow. Second operand 8 states and 123 transitions. [2022-12-06 04:09:11,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 171 transitions, 1209 flow [2022-12-06 04:09:11,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 171 transitions, 1198 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:11,996 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 405 flow [2022-12-06 04:09:11,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-12-06 04:09:11,997 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-06 04:09:11,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:11,997 INFO L89 Accepts]: Start accepts. Operand has 65 places, 63 transitions, 405 flow [2022-12-06 04:09:11,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:11,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:11,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 63 transitions, 405 flow [2022-12-06 04:09:11,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 405 flow [2022-12-06 04:09:12,042 INFO L130 PetriNetUnfolder]: 208/527 cut-off events. [2022-12-06 04:09:12,043 INFO L131 PetriNetUnfolder]: For 782/975 co-relation queries the response was YES. [2022-12-06 04:09:12,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 527 events. 208/527 cut-off events. For 782/975 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3039 event pairs, 12 based on Foata normal form. 45/544 useless extension candidates. Maximal degree in co-relation 1591. Up to 190 conditions per place. [2022-12-06 04:09:12,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 63 transitions, 405 flow [2022-12-06 04:09:12,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 04:09:12,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_152 256) 0)) (.cse1 (and .cse4 .cse11)) (.cse2 (and .cse4 (= (mod v_~a$w_buff1_used~0_135 256) 0)))) (let ((.cse8 (or .cse12 .cse1 .cse2)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_53 v_~a$w_buff1~0_54))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= 0 (mod v_~a$w_buff0_used~0_151 256)))) (and (= v_~a$w_buff1_used~0_134 (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a$flush_delayed~0_17 0) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_12 .cse7)) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= v_~weak$$choice0~0_11 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse7 v_~__unbuffered_p3_EBX~0_12) (= v_~a~0_85 v_~a$mem_tmp~0_12) (= v_~a$w_buff0_used~0_151 (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse8 v_~a$w_buff0_used~0_152 (ite .cse9 0 v_~a$w_buff0_used~0_152)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [382] L765-->L768: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:09:12,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] and [382] L765-->L768: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:09:12,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] and [382] L765-->L768: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:09:12,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_152 256) 0)) (.cse1 (and .cse4 .cse11)) (.cse2 (and .cse4 (= (mod v_~a$w_buff1_used~0_135 256) 0)))) (let ((.cse8 (or .cse12 .cse1 .cse2)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_53 v_~a$w_buff1~0_54))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= 0 (mod v_~a$w_buff0_used~0_151 256)))) (and (= v_~a$w_buff1_used~0_134 (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a$flush_delayed~0_17 0) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_12 .cse7)) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= v_~weak$$choice0~0_11 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse7 v_~__unbuffered_p3_EBX~0_12) (= v_~a~0_85 v_~a$mem_tmp~0_12) (= v_~a$w_buff0_used~0_151 (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse8 v_~a$w_buff0_used~0_152 (ite .cse9 0 v_~a$w_buff0_used~0_152)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [382] L765-->L768: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:09:12,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] $Ultimate##0-->L785: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [504] $Ultimate##0-->L765: Formula: (and (= v_~a$w_buff0~0_128 1) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~a$w_buff0_used~0_259 1) (= v_~a$r_buff0_thd3~0_43 v_~a$r_buff1_thd3~0_47) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff1_used~0_229 256) 0)) (not (= (mod v_~a$w_buff0_used~0_259 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~a$w_buff0_used~0_260 v_~a$w_buff1_used~0_229) (= v_~a$r_buff0_thd0~0_51 v_~a$r_buff1_thd0~0_53) (= v_~a$r_buff0_thd2~0_59 v_~a$r_buff1_thd2~0_66) (= v_~a$r_buff0_thd4~0_109 v_~a$r_buff1_thd4~0_107) (= v_~a$r_buff0_thd1~0_66 1) (= v_~a$w_buff0~0_129 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd1~0_67 v_~a$r_buff1_thd1~0_53)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_129, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_59, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_43, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_260, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_67, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_51, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_109} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_107, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_53, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_47, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_66, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_59, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_43, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_259, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_66, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_51, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_109, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_128, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_53, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_229, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-06 04:09:12,639 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:12,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 643 [2022-12-06 04:09:12,640 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 423 flow [2022-12-06 04:09:12,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:12,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:12,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:12,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:12,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1720085339, now seen corresponding path program 1 times [2022-12-06 04:09:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051940014] [2022-12-06 04:09:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:12,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051940014] [2022-12-06 04:09:12,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051940014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:12,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:12,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866572478] [2022-12-06 04:09:12,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:12,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:12,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 04:09:12,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 423 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:12,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:12,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 04:09:12,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:13,844 INFO L130 PetriNetUnfolder]: 5255/8035 cut-off events. [2022-12-06 04:09:13,845 INFO L131 PetriNetUnfolder]: For 16760/16760 co-relation queries the response was YES. [2022-12-06 04:09:13,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29473 conditions, 8035 events. 5255/8035 cut-off events. For 16760/16760 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 44992 event pairs, 740 based on Foata normal form. 15/8050 useless extension candidates. Maximal degree in co-relation 29447. Up to 3255 conditions per place. [2022-12-06 04:09:13,889 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 101 selfloop transitions, 7 changer transitions 60/168 dead transitions. [2022-12-06 04:09:13,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 168 transitions, 1468 flow [2022-12-06 04:09:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 04:09:13,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2022-12-06 04:09:13,891 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 423 flow. Second operand 5 states and 86 transitions. [2022-12-06 04:09:13,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 168 transitions, 1468 flow [2022-12-06 04:09:13,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 168 transitions, 1406 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:14,000 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 383 flow [2022-12-06 04:09:14,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2022-12-06 04:09:14,000 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-06 04:09:14,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:14,001 INFO L89 Accepts]: Start accepts. Operand has 69 places, 63 transitions, 383 flow [2022-12-06 04:09:14,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:14,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:14,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 63 transitions, 383 flow [2022-12-06 04:09:14,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 63 transitions, 383 flow [2022-12-06 04:09:14,120 INFO L130 PetriNetUnfolder]: 479/1201 cut-off events. [2022-12-06 04:09:14,120 INFO L131 PetriNetUnfolder]: For 1784/2137 co-relation queries the response was YES. [2022-12-06 04:09:14,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 1201 events. 479/1201 cut-off events. For 1784/2137 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8883 event pairs, 20 based on Foata normal form. 112/1238 useless extension candidates. Maximal degree in co-relation 3663. Up to 436 conditions per place. [2022-12-06 04:09:14,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 63 transitions, 383 flow [2022-12-06 04:09:14,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-06 04:09:14,147 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:14,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-06 04:09:14,148 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 383 flow [2022-12-06 04:09:14,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:14,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:14,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:14,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:14,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1954976933, now seen corresponding path program 2 times [2022-12-06 04:09:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944999272] [2022-12-06 04:09:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944999272] [2022-12-06 04:09:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944999272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:14,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:14,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464718775] [2022-12-06 04:09:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:14,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:09:14,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:14,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:14,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:09:14,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:15,761 INFO L130 PetriNetUnfolder]: 5297/8747 cut-off events. [2022-12-06 04:09:15,761 INFO L131 PetriNetUnfolder]: For 18568/18815 co-relation queries the response was YES. [2022-12-06 04:09:15,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33276 conditions, 8747 events. 5297/8747 cut-off events. For 18568/18815 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 59994 event pairs, 937 based on Foata normal form. 145/8854 useless extension candidates. Maximal degree in co-relation 33247. Up to 3560 conditions per place. [2022-12-06 04:09:15,795 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 129 selfloop transitions, 11 changer transitions 20/168 dead transitions. [2022-12-06 04:09:15,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 168 transitions, 1264 flow [2022-12-06 04:09:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 04:09:15,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-06 04:09:15,797 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 383 flow. Second operand 6 states and 110 transitions. [2022-12-06 04:09:15,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 168 transitions, 1264 flow [2022-12-06 04:09:15,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 168 transitions, 1262 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:09:15,921 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:15,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2022-12-06 04:09:15,922 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2022-12-06 04:09:15,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:15,922 INFO L89 Accepts]: Start accepts. Operand has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:15,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:15,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:15,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:15,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:16,050 INFO L130 PetriNetUnfolder]: 825/1961 cut-off events. [2022-12-06 04:09:16,051 INFO L131 PetriNetUnfolder]: For 3732/4364 co-relation queries the response was YES. [2022-12-06 04:09:16,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6280 conditions, 1961 events. 825/1961 cut-off events. For 3732/4364 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 16078 event pairs, 42 based on Foata normal form. 186/2017 useless extension candidates. Maximal degree in co-relation 6249. Up to 818 conditions per place. [2022-12-06 04:09:16,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:16,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 940 [2022-12-06 04:09:16,080 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:16,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:09:16,081 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 474 flow [2022-12-06 04:09:16,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:16,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:16,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:16,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:16,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 651436445, now seen corresponding path program 3 times [2022-12-06 04:09:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:16,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601098217] [2022-12-06 04:09:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:16,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601098217] [2022-12-06 04:09:16,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601098217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:16,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:16,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493302363] [2022-12-06 04:09:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:16,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:16,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:16,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:09:16,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:16,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:16,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:09:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:17,021 INFO L130 PetriNetUnfolder]: 4904/7863 cut-off events. [2022-12-06 04:09:17,022 INFO L131 PetriNetUnfolder]: For 25489/25691 co-relation queries the response was YES. [2022-12-06 04:09:17,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31836 conditions, 7863 events. 4904/7863 cut-off events. For 25489/25691 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 53100 event pairs, 590 based on Foata normal form. 249/8042 useless extension candidates. Maximal degree in co-relation 31802. Up to 3084 conditions per place. [2022-12-06 04:09:17,054 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 78 selfloop transitions, 17 changer transitions 24/124 dead transitions. [2022-12-06 04:09:17,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 1085 flow [2022-12-06 04:09:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 04:09:17,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2022-12-06 04:09:17,055 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 474 flow. Second operand 6 states and 95 transitions. [2022-12-06 04:09:17,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 1085 flow [2022-12-06 04:09:17,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 1038 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:17,392 INFO L231 Difference]: Finished difference. Result has 79 places, 54 transitions, 390 flow [2022-12-06 04:09:17,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=54} [2022-12-06 04:09:17,393 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-06 04:09:17,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:17,393 INFO L89 Accepts]: Start accepts. Operand has 79 places, 54 transitions, 390 flow [2022-12-06 04:09:17,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:17,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:17,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 54 transitions, 390 flow [2022-12-06 04:09:17,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 54 transitions, 390 flow [2022-12-06 04:09:17,420 INFO L130 PetriNetUnfolder]: 154/387 cut-off events. [2022-12-06 04:09:17,420 INFO L131 PetriNetUnfolder]: For 851/915 co-relation queries the response was YES. [2022-12-06 04:09:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 387 events. 154/387 cut-off events. For 851/915 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2160 event pairs, 8 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1446. Up to 139 conditions per place. [2022-12-06 04:09:17,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 54 transitions, 390 flow [2022-12-06 04:09:17,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 04:09:18,527 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:09:18,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1135 [2022-12-06 04:09:18,528 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 400 flow [2022-12-06 04:09:18,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:18,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:18,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:18,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:18,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 494809489, now seen corresponding path program 1 times [2022-12-06 04:09:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:18,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75324778] [2022-12-06 04:09:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:19,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75324778] [2022-12-06 04:09:19,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75324778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:19,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:19,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:09:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406112471] [2022-12-06 04:09:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:19,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:09:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:19,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:09:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:09:19,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:09:19,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 400 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:19,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:19,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:09:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:19,507 INFO L130 PetriNetUnfolder]: 1489/2443 cut-off events. [2022-12-06 04:09:19,507 INFO L131 PetriNetUnfolder]: For 9356/9375 co-relation queries the response was YES. [2022-12-06 04:09:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10953 conditions, 2443 events. 1489/2443 cut-off events. For 9356/9375 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12765 event pairs, 466 based on Foata normal form. 10/2442 useless extension candidates. Maximal degree in co-relation 10919. Up to 1924 conditions per place. [2022-12-06 04:09:19,517 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 72 selfloop transitions, 16 changer transitions 26/118 dead transitions. [2022-12-06 04:09:19,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 1115 flow [2022-12-06 04:09:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 04:09:19,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2022-12-06 04:09:19,519 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 400 flow. Second operand 6 states and 79 transitions. [2022-12-06 04:09:19,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 1115 flow [2022-12-06 04:09:19,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 947 flow, removed 46 selfloop flow, removed 7 redundant places. [2022-12-06 04:09:19,549 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 517 flow [2022-12-06 04:09:19,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=517, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2022-12-06 04:09:19,550 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2022-12-06 04:09:19,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:19,550 INFO L89 Accepts]: Start accepts. Operand has 72 places, 61 transitions, 517 flow [2022-12-06 04:09:19,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:19,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:19,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 61 transitions, 517 flow [2022-12-06 04:09:19,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 517 flow [2022-12-06 04:09:19,587 INFO L130 PetriNetUnfolder]: 241/540 cut-off events. [2022-12-06 04:09:19,587 INFO L131 PetriNetUnfolder]: For 1784/1861 co-relation queries the response was YES. [2022-12-06 04:09:19,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 540 events. 241/540 cut-off events. For 1784/1861 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3205 event pairs, 21 based on Foata normal form. 31/537 useless extension candidates. Maximal degree in co-relation 1934. Up to 172 conditions per place. [2022-12-06 04:09:19,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 61 transitions, 517 flow [2022-12-06 04:09:19,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 04:09:19,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:19,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 04:09:19,593 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 517 flow [2022-12-06 04:09:19,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:19,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:19,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:19,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash 989484764, now seen corresponding path program 1 times [2022-12-06 04:09:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:19,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657885928] [2022-12-06 04:09:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657885928] [2022-12-06 04:09:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657885928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:19,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:19,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183489154] [2022-12-06 04:09:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:19,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:09:19,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 517 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:19,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:19,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:09:19,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:20,050 INFO L130 PetriNetUnfolder]: 1850/3060 cut-off events. [2022-12-06 04:09:20,051 INFO L131 PetriNetUnfolder]: For 13444/13451 co-relation queries the response was YES. [2022-12-06 04:09:20,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13877 conditions, 3060 events. 1850/3060 cut-off events. For 13444/13451 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17817 event pairs, 335 based on Foata normal form. 5/3059 useless extension candidates. Maximal degree in co-relation 13842. Up to 1751 conditions per place. [2022-12-06 04:09:20,063 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 46 selfloop transitions, 1 changer transitions 74/123 dead transitions. [2022-12-06 04:09:20,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 1279 flow [2022-12-06 04:09:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:09:20,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 04:09:20,064 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 517 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:09:20,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 1279 flow [2022-12-06 04:09:20,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 1180 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:20,100 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 331 flow [2022-12-06 04:09:20,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2022-12-06 04:09:20,101 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2022-12-06 04:09:20,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:20,101 INFO L89 Accepts]: Start accepts. Operand has 73 places, 45 transitions, 331 flow [2022-12-06 04:09:20,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:20,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:20,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 45 transitions, 331 flow [2022-12-06 04:09:20,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 45 transitions, 331 flow [2022-12-06 04:09:20,120 INFO L130 PetriNetUnfolder]: 125/300 cut-off events. [2022-12-06 04:09:20,121 INFO L131 PetriNetUnfolder]: For 729/758 co-relation queries the response was YES. [2022-12-06 04:09:20,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 300 events. 125/300 cut-off events. For 729/758 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1611 event pairs, 12 based on Foata normal form. 11/292 useless extension candidates. Maximal degree in co-relation 995. Up to 99 conditions per place. [2022-12-06 04:09:20,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 45 transitions, 331 flow [2022-12-06 04:09:20,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 04:09:20,412 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:09:20,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 04:09:20,413 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 337 flow [2022-12-06 04:09:20,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:20,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:20,413 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] [2022-12-06 04:09:20,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:09:20,413 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1334970903, now seen corresponding path program 1 times [2022-12-06 04:09:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:20,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123627683] [2022-12-06 04:09:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:20,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123627683] [2022-12-06 04:09:20,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123627683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:20,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:20,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:09:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885256266] [2022-12-06 04:09:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:20,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:09:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:09:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:09:20,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:09:20,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 337 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:20,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:20,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:09:20,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:21,138 INFO L130 PetriNetUnfolder]: 606/1058 cut-off events. [2022-12-06 04:09:21,138 INFO L131 PetriNetUnfolder]: For 3810/3810 co-relation queries the response was YES. [2022-12-06 04:09:21,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 1058 events. 606/1058 cut-off events. For 3810/3810 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5248 event pairs, 48 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 4692. Up to 339 conditions per place. [2022-12-06 04:09:21,143 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 75 selfloop transitions, 8 changer transitions 37/120 dead transitions. [2022-12-06 04:09:21,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 1037 flow [2022-12-06 04:09:21,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 04:09:21,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-06 04:09:21,145 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 337 flow. Second operand 7 states and 62 transitions. [2022-12-06 04:09:21,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 1037 flow [2022-12-06 04:09:21,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 975 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-12-06 04:09:21,158 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 359 flow [2022-12-06 04:09:21,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2022-12-06 04:09:21,159 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2022-12-06 04:09:21,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:21,159 INFO L89 Accepts]: Start accepts. Operand has 66 places, 46 transitions, 359 flow [2022-12-06 04:09:21,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:21,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:21,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 46 transitions, 359 flow [2022-12-06 04:09:21,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 359 flow [2022-12-06 04:09:21,180 INFO L130 PetriNetUnfolder]: 135/311 cut-off events. [2022-12-06 04:09:21,180 INFO L131 PetriNetUnfolder]: For 1017/1054 co-relation queries the response was YES. [2022-12-06 04:09:21,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 311 events. 135/311 cut-off events. For 1017/1054 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1634 event pairs, 9 based on Foata normal form. 15/311 useless extension candidates. Maximal degree in co-relation 1075. Up to 104 conditions per place. [2022-12-06 04:09:21,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 46 transitions, 359 flow [2022-12-06 04:09:21,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 04:09:21,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L875-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= 0 (mod v_~a$w_buff0_used~0_580 256)))) (.cse3 (not (= (mod v_~a$r_buff1_thd0~0_177 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_168 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_581 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_506 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= v_~a$r_buff0_thd0~0_167 (ite .cse0 0 v_~a$r_buff0_thd0~0_168)) (= v_~main$tmp_guard1~0_78 (ite (= 0 (ite (not (and (= v_~__unbuffered_p3_EBX~0_110 0) (= v_~__unbuffered_p3_EAX~0_83 1) (= v_~__unbuffered_p1_EAX~0_87 0) (= v_~__unbuffered_p0_EAX~0_89 0) (= v_~__unbuffered_p2_EAX~0_82 0))) 1 0)) 0 1)) (= (ite .cse1 0 v_~a$w_buff0_used~0_581) v_~a$w_buff0_used~0_580) (= v_~a~0_410 (ite .cse1 v_~a$w_buff0~0_342 (ite .cse2 v_~a$w_buff1~0_296 v_~a~0_411))) (= (ite (or .cse2 .cse0) 0 v_~a$w_buff1_used~0_506) v_~a$w_buff1_used~0_505) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (mod v_~main$tmp_guard0~0_78 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_78) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~a$r_buff1_thd0~0_176 (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_505 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd0~0_167 256) 0)))) 0 v_~a$r_buff1_thd0~0_177))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_581, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_110, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_168, ~a~0=v_~a~0_411, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_296, ~a$w_buff0~0=v_~a$w_buff0~0_342, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_177, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_63|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_580, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_110, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_167, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_410, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_296, ~a$w_buff0~0=v_~a$w_buff0~0_342, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_176, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [547] $Ultimate##0-->L768: Formula: (and (= v_~a$w_buff0~0_350 v_~a$w_buff1~0_303) (= v_~a$r_buff0_thd2~0_164 v_~a$r_buff1_thd2~0_176) (= |v_P0Thread1of1ForFork0_~arg#1.base_69| |v_P0Thread1of1ForFork0_#in~arg#1.base_69|) (= v_~a$r_buff0_thd3~0_155 v_~a$r_buff1_thd3~0_168) (= v_~a$r_buff0_thd1~0_211 v_~a$r_buff1_thd1~0_139) (= v_~a$r_buff0_thd4~0_274 v_~a$r_buff1_thd4~0_277) (= v_~x~0_54 v_~__unbuffered_p0_EAX~0_93) (= v_~a$w_buff0_used~0_597 v_~a$w_buff1_used~0_521) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| 0)) (= v_~a$w_buff0~0_349 1) (= v_~a$r_buff0_thd1~0_210 1) (= v_~a$r_buff0_thd0~0_175 v_~a$r_buff1_thd0~0_184) (= v_~a$w_buff0_used~0_596 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_596 256) 0)) (not (= (mod v_~a$w_buff1_used~0_521 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_69| |v_P0Thread1of1ForFork0_~arg#1.offset_69|)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_69|, ~a$w_buff0~0=v_~a$w_buff0~0_350, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_164, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_155, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_597, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_69|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_211, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_175, ~x~0=v_~x~0_54, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_274} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_69|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_277, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_139, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_176, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_164, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_69|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_155, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_596, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_69|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_210, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_175, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_69|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_274, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_303, ~a$w_buff0~0=v_~a$w_buff0~0_349, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_184, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_521, ~x~0=v_~x~0_54, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-06 04:09:21,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:21,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 04:09:21,477 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 387 flow [2022-12-06 04:09:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:21,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:21,477 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] [2022-12-06 04:09:21,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:09:21,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2083996142, now seen corresponding path program 1 times [2022-12-06 04:09:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:21,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183116107] [2022-12-06 04:09:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:21,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:09:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:21,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:09:21,612 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:09:21,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:09:21,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:09:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:09:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:09:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:09:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:09:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:09:21,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:09:21,616 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:21,622 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:09:21,622 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:09:21,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:09:21 BasicIcfg [2022-12-06 04:09:21,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:09:21,676 INFO L158 Benchmark]: Toolchain (without parser) took 23071.52ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 176.4MB in the beginning and 745.1MB in the end (delta: -568.7MB). Peak memory consumption was 403.9MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,676 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory was 178.6MB in the beginning and 178.5MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:21,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.19ms. Allocated memory is still 201.3MB. Free memory was 175.9MB in the beginning and 148.1MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.75ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 145.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,677 INFO L158 Benchmark]: Boogie Preprocessor took 29.26ms. Allocated memory is still 201.3MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,677 INFO L158 Benchmark]: RCFGBuilder took 645.46ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 105.1MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,677 INFO L158 Benchmark]: TraceAbstraction took 21892.04ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 104.1MB in the beginning and 745.1MB in the end (delta: -641.0MB). Peak memory consumption was 331.5MB. Max. memory is 8.0GB. [2022-12-06 04:09:21,678 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory was 178.6MB in the beginning and 178.5MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.19ms. Allocated memory is still 201.3MB. Free memory was 175.9MB in the beginning and 148.1MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.75ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 145.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.26ms. Allocated memory is still 201.3MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 645.46ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 105.1MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 21892.04ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 104.1MB in the beginning and 745.1MB in the end (delta: -641.0MB). Peak memory consumption was 331.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 139 PlacesBefore, 48 PlacesAfterwards, 128 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2236, independent: 2161, independent conditional: 2161, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2236, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2236, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2236, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1831, independent: 1787, independent conditional: 0, independent unconditional: 1787, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1831, independent: 1775, independent conditional: 0, independent unconditional: 1775, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2236, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1831, unknown conditional: 0, unknown unconditional: 1831] , Statistics on independence cache: Total cache size (in pairs): 2777, Positive cache size: 2733, Positive conditional cache size: 0, Positive unconditional cache size: 2733, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 166, independent: 141, independent conditional: 19, independent unconditional: 122, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 166, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 67, dependent conditional: 38, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 166, unknown conditional: 29, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 141, Positive conditional cache size: 19, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 307, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 307, independent: 254, independent conditional: 14, independent unconditional: 240, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 307, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 229, independent conditional: 0, independent unconditional: 229, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 176, Positive conditional cache size: 20, Positive unconditional cache size: 156, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 73, independent conditional: 6, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 73, independent conditional: 6, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 73, independent conditional: 6, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 73, independent conditional: 6, independent unconditional: 67, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 176, Positive conditional cache size: 20, Positive unconditional cache size: 156, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 70, independent conditional: 2, independent unconditional: 68, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 70, independent conditional: 2, independent unconditional: 68, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 70, independent conditional: 2, independent unconditional: 68, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 185, Positive conditional cache size: 20, Positive unconditional cache size: 165, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 172, independent conditional: 172, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 195, independent: 172, independent conditional: 75, independent unconditional: 97, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 172, independent conditional: 75, independent unconditional: 97, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, independent: 172, independent conditional: 75, independent unconditional: 97, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 166, independent conditional: 70, independent unconditional: 96, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 191, Positive conditional cache size: 25, Positive unconditional cache size: 166, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 135, independent conditional: 60, independent unconditional: 75, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 135, independent conditional: 60, independent unconditional: 75, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 135, independent conditional: 60, independent unconditional: 75, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 135, independent conditional: 60, independent unconditional: 75, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 191, Positive conditional cache size: 25, Positive unconditional cache size: 166, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 447, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 447, independent: 395, independent conditional: 203, independent unconditional: 192, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 447, independent: 395, independent conditional: 201, independent unconditional: 194, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 447, independent: 395, independent conditional: 201, independent unconditional: 194, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, independent: 386, independent conditional: 200, independent unconditional: 186, dependent: 51, dependent conditional: 7, dependent unconditional: 44, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 205, Positive conditional cache size: 26, Positive unconditional cache size: 179, Negative cache size: 48, Negative conditional cache size: 11, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 64 PlacesBefore, 64 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 826, independent: 773, independent conditional: 773, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 826, independent: 773, independent conditional: 558, independent unconditional: 215, dependent: 53, dependent conditional: 8, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 826, independent: 773, independent conditional: 522, independent unconditional: 251, dependent: 53, dependent conditional: 8, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 826, independent: 773, independent conditional: 522, independent unconditional: 251, dependent: 53, dependent conditional: 8, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 29, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 826, independent: 743, independent conditional: 493, independent unconditional: 250, dependent: 53, dependent conditional: 8, dependent unconditional: 45, unknown: 30, unknown conditional: 29, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 256, Positive conditional cache size: 55, Positive unconditional cache size: 201, Negative cache size: 48, Negative conditional cache size: 11, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 42, independent conditional: 14, independent unconditional: 28, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 42, independent conditional: 14, independent unconditional: 28, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 42, independent conditional: 14, independent unconditional: 28, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 256, Positive conditional cache size: 55, Positive unconditional cache size: 201, Negative cache size: 48, Negative conditional cache size: 11, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 20, independent unconditional: 15, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 10, dependent conditional: 7, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 256, Positive conditional cache size: 55, Positive unconditional cache size: 201, Negative cache size: 49, Negative conditional cache size: 12, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 74 PlacesBefore, 70 PlacesAfterwards, 54 TransitionsBefore, 50 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 205, independent conditional: 142, independent unconditional: 63, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 205, independent conditional: 136, independent unconditional: 69, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 205, independent conditional: 136, independent unconditional: 69, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 8, independent unconditional: 15, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 11, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, independent: 182, independent conditional: 128, independent unconditional: 54, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 26, unknown conditional: 9, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 312, Positive conditional cache size: 65, Positive unconditional cache size: 247, Negative cache size: 52, Negative conditional cache size: 13, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 312, Positive conditional cache size: 65, Positive unconditional cache size: 247, Negative cache size: 52, Negative conditional cache size: 13, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 69 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 55, independent conditional: 45, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 55, independent conditional: 44, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 55, independent conditional: 44, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 45, independent conditional: 35, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 11, unknown conditional: 9, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 369, Positive conditional cache size: 75, Positive unconditional cache size: 294, Negative cache size: 53, Negative conditional cache size: 13, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 65 PlacesAfterwards, 46 TransitionsBefore, 47 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 376, Positive conditional cache size: 81, Positive unconditional cache size: 295, Negative cache size: 53, Negative conditional cache size: 13, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-2, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-1, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=1, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = z [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 [L827] 4 __unbuffered_p3_EAX = z [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L855] 4 return 0; [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2190 IncrementalHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 9 mSDtfsCounter, 2190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:09:21,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...