/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:30:17,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:30:17,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:30:17,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:30:17,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:30:17,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:30:17,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:30:17,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:30:17,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:30:17,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:30:17,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:30:17,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:30:17,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:30:17,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:30:17,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:30:17,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:30:17,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:30:17,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:30:17,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:30:17,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:30:17,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:30:17,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:30:17,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:30:17,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:30:17,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:30:17,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:30:17,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:30:17,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:30:17,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:30:17,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:30:17,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:30:17,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:30:17,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:30:17,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:30:17,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:30:17,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:30:17,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:30:17,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:30:17,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:30:17,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:30:17,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:30:17,976 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:30:18,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:30:18,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:30:18,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:30:18,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:30:18,002 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:30:18,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:30:18,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:30:18,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:30:18,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:30:18,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:30:18,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:30:18,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:30:18,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:30:18,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:30:18,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:18,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:30:18,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:30:18,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:30:18,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:30:18,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:30:18,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:30:18,006 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 06:30:18,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:30:18,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:30:18,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:30:18,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:30:18,296 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:30:18,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2022-12-06 06:30:19,334 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:30:19,587 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:30:19,588 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2022-12-06 06:30:19,600 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1115c33/d0aaed5afcc34a83acf35781484a1450/FLAGea030470c [2022-12-06 06:30:19,612 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1115c33/d0aaed5afcc34a83acf35781484a1450 [2022-12-06 06:30:19,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:30:19,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:30:19,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:19,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:30:19,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:30:19,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:19" (1/1) ... [2022-12-06 06:30:19,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428f66e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:19, skipping insertion in model container [2022-12-06 06:30:19,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:19" (1/1) ... [2022-12-06 06:30:19,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:30:19,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:30:19,792 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/mix055.opt.i[944,957] [2022-12-06 06:30:19,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:19,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:19,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:19,983 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:30:19,992 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/mix055.opt.i[944,957] [2022-12-06 06:30:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:20,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:20,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:20,089 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:30:20,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20 WrapperNode [2022-12-06 06:30:20,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:20,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:20,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:30:20,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:30:20,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,126 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-06 06:30:20,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:20,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:30:20,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:30:20,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:30:20,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:30:20,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:30:20,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:30:20,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:30:20,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (1/1) ... [2022-12-06 06:30:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:30:20,217 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 06:30:20,250 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 06:30:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:30:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:30:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:30:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:30:20,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:30:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:30:20,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:30:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:30:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:30:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:30:20,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:30:20,264 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 06:30:20,375 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:30:20,376 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:30:20,613 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:30:20,764 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:30:20,764 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:30:20,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:20 BoogieIcfgContainer [2022-12-06 06:30:20,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:30:20,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:30:20,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:30:20,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:30:20,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:19" (1/3) ... [2022-12-06 06:30:20,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e156577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:20, skipping insertion in model container [2022-12-06 06:30:20,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:20" (2/3) ... [2022-12-06 06:30:20,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e156577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:20, skipping insertion in model container [2022-12-06 06:30:20,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:20" (3/3) ... [2022-12-06 06:30:20,774 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2022-12-06 06:30:20,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:30:20,787 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:30:20,787 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:30:20,847 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:30:20,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2022-12-06 06:30:20,974 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 06:30:20,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:20,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 06:30:20,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2022-12-06 06:30:20,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2022-12-06 06:30:20,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:21,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2022-12-06 06:30:21,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2022-12-06 06:30:21,050 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 06:30:21,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 06:30:21,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2022-12-06 06:30:21,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 2736 [2022-12-06 06:30:26,122 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 06:30:26,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:30:26,136 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;@76548b8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:30:26,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:30:26,139 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:30:26,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:26,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:26,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:26,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 120203273, now seen corresponding path program 1 times [2022-12-06 06:30:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:26,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760226501] [2022-12-06 06:30:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:26,489 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 06:30:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:26,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760226501] [2022-12-06 06:30:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760226501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:26,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:26,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595803066] [2022-12-06 06:30:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:26,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:26,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:30:26,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 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 06:30:26,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:26,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:30:26,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:26,970 INFO L130 PetriNetUnfolder]: 2483/3682 cut-off events. [2022-12-06 06:30:26,971 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 06:30:26,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7230 conditions, 3682 events. 2483/3682 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20160 event pairs, 593 based on Foata normal form. 0/3381 useless extension candidates. Maximal degree in co-relation 7218. Up to 2539 conditions per place. [2022-12-06 06:30:26,992 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 29 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 06:30:26,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-12-06 06:30:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:30:27,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 06:30:27,003 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:30:27,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-12-06 06:30:27,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:27,008 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 06:30:27,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 06:30:27,012 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 06:30:27,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:27,012 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 06:30:27,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:27,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:27,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 06:30:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 06:30:27,026 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:30:27,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:27,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:30:27,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 06:30:27,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 06:30:27,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:27,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:30:27,080 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 06:30:27,080 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 06:30:27,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:27,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:27,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:30:27,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -448673646, now seen corresponding path program 1 times [2022-12-06 06:30:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:27,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169646549] [2022-12-06 06:30:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:27,283 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 06:30:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:27,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169646549] [2022-12-06 06:30:27,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169646549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:27,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:27,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931569039] [2022-12-06 06:30:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:27,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:27,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:27,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 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 06:30:27,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:27,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:27,590 INFO L130 PetriNetUnfolder]: 2185/3292 cut-off events. [2022-12-06 06:30:27,590 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 06:30:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 3292 events. 2185/3292 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17880 event pairs, 445 based on Foata normal form. 32/3311 useless extension candidates. Maximal degree in co-relation 6650. Up to 2745 conditions per place. [2022-12-06 06:30:27,608 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 06:30:27,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 182 flow [2022-12-06 06:30:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:30:27,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-06 06:30:27,610 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:30:27,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 182 flow [2022-12-06 06:30:27,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:27,612 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-06 06:30:27,612 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-12-06 06:30:27,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:27,613 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:27,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:27,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,619 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-06 06:30:27,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:27,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2022-12-06 06:30:27,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 06:30:27,629 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:27,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:30:27,631 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2022-12-06 06:30:27,632 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 06:30:27,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:27,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:30:27,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1023982562, now seen corresponding path program 1 times [2022-12-06 06:30:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:27,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646265189] [2022-12-06 06:30:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:27,953 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 06:30:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646265189] [2022-12-06 06:30:27,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646265189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:27,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:27,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111964332] [2022-12-06 06:30:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:27,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:27,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:27,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:27,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 06:30:27,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:27,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:27,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:28,253 INFO L130 PetriNetUnfolder]: 2321/3444 cut-off events. [2022-12-06 06:30:28,253 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2022-12-06 06:30:28,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7473 conditions, 3444 events. 2321/3444 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18100 event pairs, 648 based on Foata normal form. 50/3489 useless extension candidates. Maximal degree in co-relation 7462. Up to 2387 conditions per place. [2022-12-06 06:30:28,268 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-06 06:30:28,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 172 flow [2022-12-06 06:30:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 06:30:28,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 06:30:28,269 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 42 transitions. [2022-12-06 06:30:28,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 172 flow [2022-12-06 06:30:28,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:28,270 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 06:30:28,271 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-06 06:30:28,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:28,271 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:28,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:28,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,276 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-06 06:30:28,276 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:30:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2022-12-06 06:30:28,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 06:30:28,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:28,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:30:28,286 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 82 flow [2022-12-06 06:30:28,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 06:30:28,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:28,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:28,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:30:28,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1402432485, now seen corresponding path program 1 times [2022-12-06 06:30:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:28,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936077101] [2022-12-06 06:30:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:28,648 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 06:30:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:28,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936077101] [2022-12-06 06:30:28,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936077101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:28,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:28,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184022556] [2022-12-06 06:30:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:28,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:28,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:28,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:28,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:28,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:28,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:28,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:28,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:28,924 INFO L130 PetriNetUnfolder]: 2255/3358 cut-off events. [2022-12-06 06:30:28,925 INFO L131 PetriNetUnfolder]: For 777/777 co-relation queries the response was YES. [2022-12-06 06:30:28,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 3358 events. 2255/3358 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17453 event pairs, 544 based on Foata normal form. 20/3373 useless extension candidates. Maximal degree in co-relation 7581. Up to 2585 conditions per place. [2022-12-06 06:30:28,941 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-12-06 06:30:28,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 229 flow [2022-12-06 06:30:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:30:28,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:30:28,944 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 82 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:30:28,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 229 flow [2022-12-06 06:30:28,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:28,946 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 06:30:28,948 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 06:30:28,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:28,948 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:28,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:28,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,956 INFO L130 PetriNetUnfolder]: 11/57 cut-off events. [2022-12-06 06:30:28,956 INFO L131 PetriNetUnfolder]: For 27/30 co-relation queries the response was YES. [2022-12-06 06:30:28,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 57 events. 11/57 cut-off events. For 27/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 156 event pairs, 5 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 113. Up to 20 conditions per place. [2022-12-06 06:30:28,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 06:30:28,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:28,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 06:30:28,975 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2022-12-06 06:30:28,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:28,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:28,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:28,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:30:28,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1349035169, now seen corresponding path program 1 times [2022-12-06 06:30:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068998216] [2022-12-06 06:30:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:29,656 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 06:30:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:29,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068998216] [2022-12-06 06:30:29,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068998216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:29,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:29,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574912459] [2022-12-06 06:30:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:29,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:29,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:30:29,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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 06:30:29,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:29,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:30:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:30,351 INFO L130 PetriNetUnfolder]: 6237/8658 cut-off events. [2022-12-06 06:30:30,352 INFO L131 PetriNetUnfolder]: For 3326/3326 co-relation queries the response was YES. [2022-12-06 06:30:30,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21345 conditions, 8658 events. 6237/8658 cut-off events. For 3326/3326 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 40876 event pairs, 469 based on Foata normal form. 134/8792 useless extension candidates. Maximal degree in co-relation 21330. Up to 5147 conditions per place. [2022-12-06 06:30:30,470 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 74 selfloop transitions, 35 changer transitions 0/109 dead transitions. [2022-12-06 06:30:30,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 109 transitions, 556 flow [2022-12-06 06:30:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:30:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:30:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 06:30:30,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2022-12-06 06:30:30,475 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 7 states and 94 transitions. [2022-12-06 06:30:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 109 transitions, 556 flow [2022-12-06 06:30:30,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 109 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:30,483 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=405, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2022-12-06 06:30:30,484 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 06:30:30,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:30,484 INFO L89 Accepts]: Start accepts. Operand has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:30,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:30,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,543 INFO L130 PetriNetUnfolder]: 397/812 cut-off events. [2022-12-06 06:30:30,543 INFO L131 PetriNetUnfolder]: For 1107/1149 co-relation queries the response was YES. [2022-12-06 06:30:30,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 812 events. 397/812 cut-off events. For 1107/1149 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4912 event pairs, 41 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 2541. Up to 381 conditions per place. [2022-12-06 06:30:30,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-06 06:30:30,560 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:30,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:30:30,562 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 405 flow [2022-12-06 06:30:30,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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 06:30:30,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:30,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:30:30,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 46791957, now seen corresponding path program 2 times [2022-12-06 06:30:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373456561] [2022-12-06 06:30:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:30,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373456561] [2022-12-06 06:30:30,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373456561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:30,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:30,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505439373] [2022-12-06 06:30:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:30,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:30,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:30,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:30,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:30,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 06:30:30,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:30,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:30,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:31,640 INFO L130 PetriNetUnfolder]: 5307/7637 cut-off events. [2022-12-06 06:30:31,640 INFO L131 PetriNetUnfolder]: For 11967/12183 co-relation queries the response was YES. [2022-12-06 06:30:31,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24906 conditions, 7637 events. 5307/7637 cut-off events. For 11967/12183 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 40762 event pairs, 975 based on Foata normal form. 79/7520 useless extension candidates. Maximal degree in co-relation 24883. Up to 4922 conditions per place. [2022-12-06 06:30:31,693 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 63 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2022-12-06 06:30:31,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 709 flow [2022-12-06 06:30:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 06:30:31,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.528 [2022-12-06 06:30:31,695 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 405 flow. Second operand 5 states and 66 transitions. [2022-12-06 06:30:31,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 709 flow [2022-12-06 06:30:31,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 705 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:31,739 INFO L231 Difference]: Finished difference. Result has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=59, PETRI_TRANSITIONS=68} [2022-12-06 06:30:31,741 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-06 06:30:31,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:31,741 INFO L89 Accepts]: Start accepts. Operand has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:31,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:31,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,832 INFO L130 PetriNetUnfolder]: 465/901 cut-off events. [2022-12-06 06:30:31,832 INFO L131 PetriNetUnfolder]: For 1607/1662 co-relation queries the response was YES. [2022-12-06 06:30:31,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 901 events. 465/901 cut-off events. For 1607/1662 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5273 event pairs, 61 based on Foata normal form. 3/853 useless extension candidates. Maximal degree in co-relation 3115. Up to 425 conditions per place. [2022-12-06 06:30:31,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-06 06:30:31,856 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:31,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 06:30:31,857 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 68 transitions, 475 flow [2022-12-06 06:30:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 06:30:31,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:31,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:30:31,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1351485719, now seen corresponding path program 3 times [2022-12-06 06:30:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519330610] [2022-12-06 06:30:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:32,162 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 06:30:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:32,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519330610] [2022-12-06 06:30:32,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519330610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:32,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:32,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327527219] [2022-12-06 06:30:32,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:32,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:32,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 68 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 06:30:32,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:32,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:32,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:32,829 INFO L130 PetriNetUnfolder]: 5699/8220 cut-off events. [2022-12-06 06:30:32,829 INFO L131 PetriNetUnfolder]: For 17998/18234 co-relation queries the response was YES. [2022-12-06 06:30:32,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28549 conditions, 8220 events. 5699/8220 cut-off events. For 17998/18234 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 45177 event pairs, 945 based on Foata normal form. 143/8113 useless extension candidates. Maximal degree in co-relation 28523. Up to 4064 conditions per place. [2022-12-06 06:30:32,892 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 62 selfloop transitions, 23 changer transitions 0/99 dead transitions. [2022-12-06 06:30:32,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 793 flow [2022-12-06 06:30:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 06:30:32,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.552 [2022-12-06 06:30:32,895 INFO L175 Difference]: Start difference. First operand has 59 places, 68 transitions, 475 flow. Second operand 5 states and 69 transitions. [2022-12-06 06:30:32,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 793 flow [2022-12-06 06:30:32,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 761 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:32,948 INFO L231 Difference]: Finished difference. Result has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:32,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=61, PETRI_TRANSITIONS=72} [2022-12-06 06:30:32,949 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-06 06:30:32,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:32,949 INFO L89 Accepts]: Start accepts. Operand has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:32,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:32,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:32,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:32,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:33,030 INFO L130 PetriNetUnfolder]: 468/946 cut-off events. [2022-12-06 06:30:33,030 INFO L131 PetriNetUnfolder]: For 2093/2155 co-relation queries the response was YES. [2022-12-06 06:30:33,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3506 conditions, 946 events. 468/946 cut-off events. For 2093/2155 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5892 event pairs, 48 based on Foata normal form. 7/899 useless extension candidates. Maximal degree in co-relation 3482. Up to 441 conditions per place. [2022-12-06 06:30:33,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:33,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-06 06:30:33,051 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:33,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 06:30:33,051 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 547 flow [2022-12-06 06:30:33,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 06:30:33,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:33,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:30:33,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -882192124, now seen corresponding path program 1 times [2022-12-06 06:30:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:33,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299680940] [2022-12-06 06:30:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:33,167 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 06:30:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299680940] [2022-12-06 06:30:33,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299680940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:33,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:33,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243336234] [2022-12-06 06:30:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:33,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:33,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:33,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 06:30:33,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:33,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 06:30:33,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:33,563 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L812-->L819: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$w_buff0_used~0_103 (ite .cse2 0 v_~z$w_buff0_used~0_104)) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_40 (ite .cse0 v_~z$w_buff1~0_35 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= v_~z$r_buff0_thd4~0_28 (ite .cse1 0 v_~z$r_buff0_thd4~0_29))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][86], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, P3Thread1of1ForFork2InUse, 99#L767true, P1Thread1of1ForFork3InUse, 122#L854true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 4#L819true, 101#P0EXITtrue, 185#true, 194#true, Black: 147#(= ~x~0 0), Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 92#L782true, 163#true]) [2022-12-06 06:30:33,563 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 06:30:33,563 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:30:33,563 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:30:33,563 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:30:33,632 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L812-->L819: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$w_buff0_used~0_103 (ite .cse2 0 v_~z$w_buff0_used~0_104)) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_40 (ite .cse0 v_~z$w_buff1~0_35 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= v_~z$r_buff0_thd4~0_28 (ite .cse1 0 v_~z$r_buff0_thd4~0_29))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][100], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 24#L789true, Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 122#L854true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 4#L819true, 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 163#true]) [2022-12-06 06:30:33,632 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,632 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,632 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,632 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,636 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([467] L854-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_120 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd0~0_120 256) 0))) (let ((.cse7 (not .cse3)) (.cse12 (= (mod v_~z$w_buff0_used~0_210 256) 0)) (.cse11 (and (= (mod v_~z$w_buff1_used~0_191 256) 0) .cse3)) (.cse6 (and .cse3 .cse10))) (let ((.cse1 (or .cse12 .cse11 .cse6)) (.cse2 (and (not .cse12) .cse7))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_190 256) 0)) (.cse8 (ite .cse1 v_~z~0_128 (ite .cse2 v_~z$w_buff0~0_123 v_~z$w_buff1~0_106))) (.cse0 (not (= (mod v_~weak$$choice2~0_48 256) 0))) (.cse5 (= (mod v_~z$w_buff0_used~0_209 256) 0))) (and (= v_~weak$$choice2~0_48 |v_ULTIMATE.start_main_#t~nondet12#1_41|) (= v_~z$w_buff0_used~0_209 (ite .cse0 v_~z$w_buff0_used~0_210 (ite .cse1 v_~z$w_buff0_used~0_210 (ite .cse2 0 v_~z$w_buff0_used~0_210)))) (= v_~z$flush_delayed~0_35 0) (= v_~z$r_buff0_thd0~0_119 (ite .cse0 v_~z$r_buff0_thd0~0_120 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd0~0_120 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd0~0_120)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~weak$$choice0~0_29 |v_ULTIMATE.start_main_#t~nondet11#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= v_~main$tmp_guard1~0_38 (ite (= (ite (not (and (= 2 .cse8) (= v_~__unbuffered_p1_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_28 0) (= v_~x~0_39 2))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_119 (ite .cse0 v_~z$r_buff1_thd0~0_120 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_119 256) 0))) (or (and .cse9 .cse4) (and .cse10 .cse9) .cse5)) v_~z$r_buff1_thd0~0_120 0))) (= v_~z~0_127 (ite .cse0 v_~z$mem_tmp~0_24 .cse8)) (= (mod v_~main$tmp_guard1~0_38 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= v_~z$w_buff1_used~0_190 (ite .cse0 v_~z$w_buff1_used~0_191 (ite (or .cse11 .cse5 .cse6) v_~z$w_buff1_used~0_191 0))) (= v_~z$mem_tmp~0_24 v_~z~0_128) (= v_~z$w_buff0~0_123 v_~z$w_buff0~0_122) (= v_~z$w_buff1~0_106 v_~z$w_buff1~0_105)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_210, ~z$w_buff0~0=v_~z$w_buff0~0_123, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_191, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_106, ~z~0=v_~z~0_128, ~x~0=v_~x~0_39, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_209, ~z$w_buff0~0=v_~z$w_buff0~0_122, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_190, ~z$w_buff1~0=v_~z$w_buff1~0_105, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~weak$$choice0~0=v_~weak$$choice0~0_29, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_119, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_48, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][108], [Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 24#L789true, Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 80#L812true, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 163#true]) [2022-12-06 06:30:33,637 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,637 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,637 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,637 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:30:33,662 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L812-->L819: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$w_buff0_used~0_103 (ite .cse2 0 v_~z$w_buff0_used~0_104)) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_40 (ite .cse0 v_~z$w_buff1~0_35 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= v_~z$r_buff0_thd4~0_28 (ite .cse1 0 v_~z$r_buff0_thd4~0_29))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][100], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 122#L854true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 4#L819true, 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, 163#true]) [2022-12-06 06:30:33,662 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,662 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,662 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,662 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,731 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([373] L812-->L819: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$w_buff0_used~0_103 (ite .cse2 0 v_~z$w_buff0_used~0_104)) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_40 (ite .cse0 v_~z$w_buff1~0_35 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= v_~z$r_buff0_thd4~0_28 (ite .cse1 0 v_~z$r_buff0_thd4~0_29))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][100], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 122#L854true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 4#L819true, 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, 163#true]) [2022-12-06 06:30:33,731 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([467] L854-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_120 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd0~0_120 256) 0))) (let ((.cse7 (not .cse3)) (.cse12 (= (mod v_~z$w_buff0_used~0_210 256) 0)) (.cse11 (and (= (mod v_~z$w_buff1_used~0_191 256) 0) .cse3)) (.cse6 (and .cse3 .cse10))) (let ((.cse1 (or .cse12 .cse11 .cse6)) (.cse2 (and (not .cse12) .cse7))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_190 256) 0)) (.cse8 (ite .cse1 v_~z~0_128 (ite .cse2 v_~z$w_buff0~0_123 v_~z$w_buff1~0_106))) (.cse0 (not (= (mod v_~weak$$choice2~0_48 256) 0))) (.cse5 (= (mod v_~z$w_buff0_used~0_209 256) 0))) (and (= v_~weak$$choice2~0_48 |v_ULTIMATE.start_main_#t~nondet12#1_41|) (= v_~z$w_buff0_used~0_209 (ite .cse0 v_~z$w_buff0_used~0_210 (ite .cse1 v_~z$w_buff0_used~0_210 (ite .cse2 0 v_~z$w_buff0_used~0_210)))) (= v_~z$flush_delayed~0_35 0) (= v_~z$r_buff0_thd0~0_119 (ite .cse0 v_~z$r_buff0_thd0~0_120 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd0~0_120 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd0~0_120)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~weak$$choice0~0_29 |v_ULTIMATE.start_main_#t~nondet11#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= v_~main$tmp_guard1~0_38 (ite (= (ite (not (and (= 2 .cse8) (= v_~__unbuffered_p1_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_28 0) (= v_~x~0_39 2))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_119 (ite .cse0 v_~z$r_buff1_thd0~0_120 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_119 256) 0))) (or (and .cse9 .cse4) (and .cse10 .cse9) .cse5)) v_~z$r_buff1_thd0~0_120 0))) (= v_~z~0_127 (ite .cse0 v_~z$mem_tmp~0_24 .cse8)) (= (mod v_~main$tmp_guard1~0_38 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= v_~z$w_buff1_used~0_190 (ite .cse0 v_~z$w_buff1_used~0_191 (ite (or .cse11 .cse5 .cse6) v_~z$w_buff1_used~0_191 0))) (= v_~z$mem_tmp~0_24 v_~z~0_128) (= v_~z$w_buff0~0_123 v_~z$w_buff0~0_122) (= v_~z$w_buff1~0_106 v_~z$w_buff1~0_105)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_210, ~z$w_buff0~0=v_~z$w_buff0~0_123, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_191, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_106, ~z~0=v_~z~0_128, ~x~0=v_~x~0_39, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_209, ~z$w_buff0~0=v_~z$w_buff0~0_122, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_190, ~z$w_buff1~0=v_~z$w_buff1~0_105, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~weak$$choice0~0=v_~weak$$choice0~0_29, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_119, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_48, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][108], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 80#L812true, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, 163#true]) [2022-12-06 06:30:33,732 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,732 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,734 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([467] L854-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_120 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd0~0_120 256) 0))) (let ((.cse7 (not .cse3)) (.cse12 (= (mod v_~z$w_buff0_used~0_210 256) 0)) (.cse11 (and (= (mod v_~z$w_buff1_used~0_191 256) 0) .cse3)) (.cse6 (and .cse3 .cse10))) (let ((.cse1 (or .cse12 .cse11 .cse6)) (.cse2 (and (not .cse12) .cse7))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_190 256) 0)) (.cse8 (ite .cse1 v_~z~0_128 (ite .cse2 v_~z$w_buff0~0_123 v_~z$w_buff1~0_106))) (.cse0 (not (= (mod v_~weak$$choice2~0_48 256) 0))) (.cse5 (= (mod v_~z$w_buff0_used~0_209 256) 0))) (and (= v_~weak$$choice2~0_48 |v_ULTIMATE.start_main_#t~nondet12#1_41|) (= v_~z$w_buff0_used~0_209 (ite .cse0 v_~z$w_buff0_used~0_210 (ite .cse1 v_~z$w_buff0_used~0_210 (ite .cse2 0 v_~z$w_buff0_used~0_210)))) (= v_~z$flush_delayed~0_35 0) (= v_~z$r_buff0_thd0~0_119 (ite .cse0 v_~z$r_buff0_thd0~0_120 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd0~0_120 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd0~0_120)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~weak$$choice0~0_29 |v_ULTIMATE.start_main_#t~nondet11#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= v_~main$tmp_guard1~0_38 (ite (= (ite (not (and (= 2 .cse8) (= v_~__unbuffered_p1_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_28 0) (= v_~x~0_39 2))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_119 (ite .cse0 v_~z$r_buff1_thd0~0_120 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_119 256) 0))) (or (and .cse9 .cse4) (and .cse10 .cse9) .cse5)) v_~z$r_buff1_thd0~0_120 0))) (= v_~z~0_127 (ite .cse0 v_~z$mem_tmp~0_24 .cse8)) (= (mod v_~main$tmp_guard1~0_38 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= v_~z$w_buff1_used~0_190 (ite .cse0 v_~z$w_buff1_used~0_191 (ite (or .cse11 .cse5 .cse6) v_~z$w_buff1_used~0_191 0))) (= v_~z$mem_tmp~0_24 v_~z~0_128) (= v_~z$w_buff0~0_123 v_~z$w_buff0~0_122) (= v_~z$w_buff1~0_106 v_~z$w_buff1~0_105)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_210, ~z$w_buff0~0=v_~z$w_buff0~0_123, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_191, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_106, ~z~0=v_~z~0_128, ~x~0=v_~x~0_39, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_209, ~z$w_buff0~0=v_~z$w_buff0~0_122, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_190, ~z$w_buff1~0=v_~z$w_buff1~0_105, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~weak$$choice0~0=v_~weak$$choice0~0_29, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_119, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_48, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][108], [Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 154#true, 99#L767true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 80#L812true, P2Thread1of1ForFork0InUse, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 101#P0EXITtrue, 185#true, Black: 147#(= ~x~0 0), 194#true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, 163#true]) [2022-12-06 06:30:33,735 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,735 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,735 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,735 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,735 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:33,768 INFO L130 PetriNetUnfolder]: 3740/5579 cut-off events. [2022-12-06 06:30:33,768 INFO L131 PetriNetUnfolder]: For 18399/18732 co-relation queries the response was YES. [2022-12-06 06:30:33,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21079 conditions, 5579 events. 3740/5579 cut-off events. For 18399/18732 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 31502 event pairs, 670 based on Foata normal form. 218/5578 useless extension candidates. Maximal degree in co-relation 21052. Up to 4680 conditions per place. [2022-12-06 06:30:33,798 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 88 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2022-12-06 06:30:33,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 1037 flow [2022-12-06 06:30:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:30:33,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:30:33,800 INFO L175 Difference]: Start difference. First operand has 61 places, 72 transitions, 547 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:30:33,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 1037 flow [2022-12-06 06:30:33,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 110 transitions, 957 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:33,825 INFO L231 Difference]: Finished difference. Result has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=61, PETRI_TRANSITIONS=75} [2022-12-06 06:30:33,826 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-06 06:30:33,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:33,826 INFO L89 Accepts]: Start accepts. Operand has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:33,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:33,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,960 INFO L130 PetriNetUnfolder]: 1072/2009 cut-off events. [2022-12-06 06:30:33,960 INFO L131 PetriNetUnfolder]: For 2103/2160 co-relation queries the response was YES. [2022-12-06 06:30:33,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5848 conditions, 2009 events. 1072/2009 cut-off events. For 2103/2160 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 14318 event pairs, 251 based on Foata normal form. 5/1841 useless extension candidates. Maximal degree in co-relation 5823. Up to 949 conditions per place. [2022-12-06 06:30:33,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 936 [2022-12-06 06:30:33,984 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:33,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 06:30:33,986 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 75 transitions, 524 flow [2022-12-06 06:30:33,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:33,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:30:33,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1480807699, now seen corresponding path program 1 times [2022-12-06 06:30:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6762084] [2022-12-06 06:30:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:34,105 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 06:30:34,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:34,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6762084] [2022-12-06 06:30:34,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6762084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:34,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:34,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751072214] [2022-12-06 06:30:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:34,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:34,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:34,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:34,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 06:30:34,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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 06:30:34,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:34,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 06:30:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:34,409 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([467] L854-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_120 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd0~0_120 256) 0))) (let ((.cse7 (not .cse3)) (.cse12 (= (mod v_~z$w_buff0_used~0_210 256) 0)) (.cse11 (and (= (mod v_~z$w_buff1_used~0_191 256) 0) .cse3)) (.cse6 (and .cse3 .cse10))) (let ((.cse1 (or .cse12 .cse11 .cse6)) (.cse2 (and (not .cse12) .cse7))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_190 256) 0)) (.cse8 (ite .cse1 v_~z~0_128 (ite .cse2 v_~z$w_buff0~0_123 v_~z$w_buff1~0_106))) (.cse0 (not (= (mod v_~weak$$choice2~0_48 256) 0))) (.cse5 (= (mod v_~z$w_buff0_used~0_209 256) 0))) (and (= v_~weak$$choice2~0_48 |v_ULTIMATE.start_main_#t~nondet12#1_41|) (= v_~z$w_buff0_used~0_209 (ite .cse0 v_~z$w_buff0_used~0_210 (ite .cse1 v_~z$w_buff0_used~0_210 (ite .cse2 0 v_~z$w_buff0_used~0_210)))) (= v_~z$flush_delayed~0_35 0) (= v_~z$r_buff0_thd0~0_119 (ite .cse0 v_~z$r_buff0_thd0~0_120 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd0~0_120 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd0~0_120)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~weak$$choice0~0_29 |v_ULTIMATE.start_main_#t~nondet11#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= v_~main$tmp_guard1~0_38 (ite (= (ite (not (and (= 2 .cse8) (= v_~__unbuffered_p1_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_28 0) (= v_~x~0_39 2))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_119 (ite .cse0 v_~z$r_buff1_thd0~0_120 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_119 256) 0))) (or (and .cse9 .cse4) (and .cse10 .cse9) .cse5)) v_~z$r_buff1_thd0~0_120 0))) (= v_~z~0_127 (ite .cse0 v_~z$mem_tmp~0_24 .cse8)) (= (mod v_~main$tmp_guard1~0_38 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= v_~z$w_buff1_used~0_190 (ite .cse0 v_~z$w_buff1_used~0_191 (ite (or .cse11 .cse5 .cse6) v_~z$w_buff1_used~0_191 0))) (= v_~z$mem_tmp~0_24 v_~z~0_128) (= v_~z$w_buff0~0_123 v_~z$w_buff0~0_122) (= v_~z$w_buff1~0_106 v_~z$w_buff1~0_105)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_210, ~z$w_buff0~0=v_~z$w_buff0~0_123, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_191, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_106, ~z~0=v_~z~0_128, ~x~0=v_~x~0_39, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_209, ~z$w_buff0~0=v_~z$w_buff0~0_122, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_190, ~z$w_buff1~0=v_~z$w_buff1~0_105, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~weak$$choice0~0=v_~weak$$choice0~0_29, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_119, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_48, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][138], [Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 154#true, P3Thread1of1ForFork2InUse, Black: 196#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 101#P0EXITtrue, Black: 147#(= ~x~0 0), 194#true, Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 99#L767true, 80#L812true, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 198#true, 163#true]) [2022-12-06 06:30:34,410 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L812-->L819: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$w_buff0_used~0_103 (ite .cse2 0 v_~z$w_buff0_used~0_104)) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_40 (ite .cse0 v_~z$w_buff1~0_35 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= v_~z$r_buff0_thd4~0_28 (ite .cse1 0 v_~z$r_buff0_thd4~0_29))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][132], [Black: 190#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 154#true, P3Thread1of1ForFork2InUse, Black: 196#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 101#P0EXITtrue, Black: 147#(= ~x~0 0), 194#true, Black: 151#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 68#P2EXITtrue, Black: 160#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 158#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 99#L767true, 122#L854true, Black: 171#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 165#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 169#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 166#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 167#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 4#L819true, Black: 182#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 198#true, 163#true]) [2022-12-06 06:30:34,410 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,410 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 06:30:34,430 INFO L130 PetriNetUnfolder]: 2017/3198 cut-off events. [2022-12-06 06:30:34,430 INFO L131 PetriNetUnfolder]: For 8128/8406 co-relation queries the response was YES. [2022-12-06 06:30:34,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12615 conditions, 3198 events. 2017/3198 cut-off events. For 8128/8406 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17590 event pairs, 220 based on Foata normal form. 367/3455 useless extension candidates. Maximal degree in co-relation 12587. Up to 1645 conditions per place. [2022-12-06 06:30:34,447 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 119 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2022-12-06 06:30:34,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 145 transitions, 1320 flow [2022-12-06 06:30:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 06:30:34,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.68 [2022-12-06 06:30:34,448 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 524 flow. Second operand 4 states and 68 transitions. [2022-12-06 06:30:34,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 145 transitions, 1320 flow [2022-12-06 06:30:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 145 transitions, 1300 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:34,460 INFO L231 Difference]: Finished difference. Result has 63 places, 78 transitions, 555 flow [2022-12-06 06:30:34,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=63, PETRI_TRANSITIONS=78} [2022-12-06 06:30:34,461 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-12-06 06:30:34,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:34,461 INFO L89 Accepts]: Start accepts. Operand has 63 places, 78 transitions, 555 flow [2022-12-06 06:30:34,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:34,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:34,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 78 transitions, 555 flow [2022-12-06 06:30:34,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 78 transitions, 555 flow [2022-12-06 06:30:34,538 INFO L130 PetriNetUnfolder]: 533/1113 cut-off events. [2022-12-06 06:30:34,538 INFO L131 PetriNetUnfolder]: For 1534/1770 co-relation queries the response was YES. [2022-12-06 06:30:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 1113 events. 533/1113 cut-off events. For 1534/1770 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7306 event pairs, 58 based on Foata normal form. 52/1102 useless extension candidates. Maximal degree in co-relation 3873. Up to 540 conditions per place. [2022-12-06 06:30:34,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 78 transitions, 555 flow [2022-12-06 06:30:34,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-06 06:30:34,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:34,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-06 06:30:34,748 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 563 flow [2022-12-06 06:30:34,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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 06:30:34,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:34,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:34,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:34,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1955741871, now seen corresponding path program 1 times [2022-12-06 06:30:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:34,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770694675] [2022-12-06 06:30:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:34,877 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 06:30:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770694675] [2022-12-06 06:30:34,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770694675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:34,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:34,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331814195] [2022-12-06 06:30:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:34,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:34,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:30:34,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:34,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:30:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:35,306 INFO L130 PetriNetUnfolder]: 2636/4245 cut-off events. [2022-12-06 06:30:35,306 INFO L131 PetriNetUnfolder]: For 12070/12235 co-relation queries the response was YES. [2022-12-06 06:30:35,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17933 conditions, 4245 events. 2636/4245 cut-off events. For 12070/12235 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 24757 event pairs, 732 based on Foata normal form. 95/4196 useless extension candidates. Maximal degree in co-relation 17904. Up to 2003 conditions per place. [2022-12-06 06:30:35,336 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 92 selfloop transitions, 8 changer transitions 11/119 dead transitions. [2022-12-06 06:30:35,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 1058 flow [2022-12-06 06:30:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:30:35,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-06 06:30:35,337 INFO L175 Difference]: Start difference. First operand has 63 places, 78 transitions, 563 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:30:35,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 1058 flow [2022-12-06 06:30:35,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 119 transitions, 1024 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:35,355 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 531 flow [2022-12-06 06:30:35,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2022-12-06 06:30:35,356 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-12-06 06:30:35,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:35,356 INFO L89 Accepts]: Start accepts. Operand has 64 places, 72 transitions, 531 flow [2022-12-06 06:30:35,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:35,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:35,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 72 transitions, 531 flow [2022-12-06 06:30:35,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 72 transitions, 531 flow [2022-12-06 06:30:35,469 INFO L130 PetriNetUnfolder]: 596/1304 cut-off events. [2022-12-06 06:30:35,470 INFO L131 PetriNetUnfolder]: For 1939/2127 co-relation queries the response was YES. [2022-12-06 06:30:35,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 1304 events. 596/1304 cut-off events. For 1939/2127 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9275 event pairs, 92 based on Foata normal form. 64/1294 useless extension candidates. Maximal degree in co-relation 4168. Up to 625 conditions per place. [2022-12-06 06:30:35,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 72 transitions, 531 flow [2022-12-06 06:30:35,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 06:30:35,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L779-->L782: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [406] $Ultimate##0-->L764: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_27 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 06:30:35,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L779-->L782: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [406] $Ultimate##0-->L764: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_27 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 06:30:35,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L779-->L782: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [393] $Ultimate##0-->L809: Formula: (and (= v_~z$r_buff0_thd0~0_77 v_~z$r_buff1_thd0~0_75) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_118 256) 0)) (not (= (mod v_~z$w_buff0_used~0_131 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_131 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_65 v_~z$w_buff1~0_53) (= v_~z$w_buff0_used~0_132 v_~z$w_buff1_used~0_118) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd4~0_42 1) (= 2 v_~z$w_buff0~0_64) (= v_~z$r_buff0_thd4~0_43 v_~z$r_buff1_thd4~0_29) (= v_~z$r_buff0_thd3~0_39 v_~z$r_buff1_thd3~0_35)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_43, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_53, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_42, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-06 06:30:35,777 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:35,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-06 06:30:35,778 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 71 transitions, 552 flow [2022-12-06 06:30:35,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:35,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:35,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:35,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:35,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash 667886994, now seen corresponding path program 1 times [2022-12-06 06:30:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437033606] [2022-12-06 06:30:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:35,975 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 06:30:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:35,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437033606] [2022-12-06 06:30:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437033606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:35,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996586716] [2022-12-06 06:30:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:35,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:35,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:30:35,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 71 transitions, 552 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 06:30:35,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:35,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:30:35,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:36,405 INFO L130 PetriNetUnfolder]: 1420/2356 cut-off events. [2022-12-06 06:30:36,405 INFO L131 PetriNetUnfolder]: For 7735/8043 co-relation queries the response was YES. [2022-12-06 06:30:36,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9856 conditions, 2356 events. 1420/2356 cut-off events. For 7735/8043 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13154 event pairs, 174 based on Foata normal form. 376/2686 useless extension candidates. Maximal degree in co-relation 9827. Up to 824 conditions per place. [2022-12-06 06:30:36,428 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 119 selfloop transitions, 13 changer transitions 6/149 dead transitions. [2022-12-06 06:30:36,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 149 transitions, 1459 flow [2022-12-06 06:30:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 06:30:36,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:30:36,431 INFO L175 Difference]: Start difference. First operand has 63 places, 71 transitions, 552 flow. Second operand 5 states and 93 transitions. [2022-12-06 06:30:36,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 149 transitions, 1459 flow [2022-12-06 06:30:36,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 1384 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:36,456 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 565 flow [2022-12-06 06:30:36,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=565, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2022-12-06 06:30:36,464 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2022-12-06 06:30:36,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:36,464 INFO L89 Accepts]: Start accepts. Operand has 66 places, 72 transitions, 565 flow [2022-12-06 06:30:36,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:36,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:36,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 72 transitions, 565 flow [2022-12-06 06:30:36,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 72 transitions, 565 flow [2022-12-06 06:30:36,558 INFO L130 PetriNetUnfolder]: 364/812 cut-off events. [2022-12-06 06:30:36,558 INFO L131 PetriNetUnfolder]: For 1575/1870 co-relation queries the response was YES. [2022-12-06 06:30:36,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 812 events. 364/812 cut-off events. For 1575/1870 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5146 event pairs, 32 based on Foata normal form. 74/837 useless extension candidates. Maximal degree in co-relation 3009. Up to 365 conditions per place. [2022-12-06 06:30:36,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 72 transitions, 565 flow [2022-12-06 06:30:36,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-06 06:30:36,699 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:36,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 06:30:36,700 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 571 flow [2022-12-06 06:30:36,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 06:30:36,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:36,701 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] [2022-12-06 06:30:36,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:30:36,701 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2130517208, now seen corresponding path program 1 times [2022-12-06 06:30:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:36,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276804178] [2022-12-06 06:30:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:37,091 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 06:30:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:37,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276804178] [2022-12-06 06:30:37,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276804178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:37,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:37,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619225936] [2022-12-06 06:30:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:37,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:37,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:30:37,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 571 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 06:30:37,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:37,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:30:37,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:37,604 INFO L130 PetriNetUnfolder]: 3033/4698 cut-off events. [2022-12-06 06:30:37,604 INFO L131 PetriNetUnfolder]: For 13769/13769 co-relation queries the response was YES. [2022-12-06 06:30:37,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20513 conditions, 4698 events. 3033/4698 cut-off events. For 13769/13769 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25260 event pairs, 223 based on Foata normal form. 11/4709 useless extension candidates. Maximal degree in co-relation 20483. Up to 2089 conditions per place. [2022-12-06 06:30:37,624 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 113 selfloop transitions, 25 changer transitions 59/197 dead transitions. [2022-12-06 06:30:37,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 197 transitions, 1866 flow [2022-12-06 06:30:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 06:30:37,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-06 06:30:37,626 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 571 flow. Second operand 6 states and 94 transitions. [2022-12-06 06:30:37,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 197 transitions, 1866 flow [2022-12-06 06:30:37,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 197 transitions, 1744 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:37,669 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=683, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2022-12-06 06:30:37,670 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2022-12-06 06:30:37,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:37,670 INFO L89 Accepts]: Start accepts. Operand has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:37,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:37,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,745 INFO L130 PetriNetUnfolder]: 392/946 cut-off events. [2022-12-06 06:30:37,746 INFO L131 PetriNetUnfolder]: For 2002/2245 co-relation queries the response was YES. [2022-12-06 06:30:37,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 946 events. 392/946 cut-off events. For 2002/2245 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6645 event pairs, 45 based on Foata normal form. 82/973 useless extension candidates. Maximal degree in co-relation 3296. Up to 327 conditions per place. [2022-12-06 06:30:37,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-06 06:30:37,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:37,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 06:30:37,773 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 683 flow [2022-12-06 06:30:37,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 06:30:37,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:37,773 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] [2022-12-06 06:30:37,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:30:37,774 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -564582248, now seen corresponding path program 1 times [2022-12-06 06:30:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:37,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073163573] [2022-12-06 06:30:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:37,885 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 06:30:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:37,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073163573] [2022-12-06 06:30:37,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073163573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:37,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:37,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958587911] [2022-12-06 06:30:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:37,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:37,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:30:37,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 683 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:37,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:37,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:30:37,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:38,244 INFO L130 PetriNetUnfolder]: 2409/4123 cut-off events. [2022-12-06 06:30:38,244 INFO L131 PetriNetUnfolder]: For 13963/14201 co-relation queries the response was YES. [2022-12-06 06:30:38,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17439 conditions, 4123 events. 2409/4123 cut-off events. For 13963/14201 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25824 event pairs, 349 based on Foata normal form. 76/4145 useless extension candidates. Maximal degree in co-relation 17406. Up to 2028 conditions per place. [2022-12-06 06:30:38,262 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 97 selfloop transitions, 2 changer transitions 39/148 dead transitions. [2022-12-06 06:30:38,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 1532 flow [2022-12-06 06:30:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 06:30:38,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-06 06:30:38,263 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 683 flow. Second operand 4 states and 64 transitions. [2022-12-06 06:30:38,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 1532 flow [2022-12-06 06:30:38,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 148 transitions, 1514 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:38,298 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 631 flow [2022-12-06 06:30:38,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2022-12-06 06:30:38,299 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2022-12-06 06:30:38,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:38,299 INFO L89 Accepts]: Start accepts. Operand has 75 places, 74 transitions, 631 flow [2022-12-06 06:30:38,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:38,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:38,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 74 transitions, 631 flow [2022-12-06 06:30:38,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 631 flow [2022-12-06 06:30:38,398 INFO L130 PetriNetUnfolder]: 640/1503 cut-off events. [2022-12-06 06:30:38,398 INFO L131 PetriNetUnfolder]: For 2979/3355 co-relation queries the response was YES. [2022-12-06 06:30:38,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5182 conditions, 1503 events. 640/1503 cut-off events. For 2979/3355 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 11560 event pairs, 61 based on Foata normal form. 126/1527 useless extension candidates. Maximal degree in co-relation 5150. Up to 562 conditions per place. [2022-12-06 06:30:38,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 74 transitions, 631 flow [2022-12-06 06:30:38,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-06 06:30:38,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L779-->L782: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [393] $Ultimate##0-->L809: Formula: (and (= v_~z$r_buff0_thd0~0_77 v_~z$r_buff1_thd0~0_75) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_118 256) 0)) (not (= (mod v_~z$w_buff0_used~0_131 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_131 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_65 v_~z$w_buff1~0_53) (= v_~z$w_buff0_used~0_132 v_~z$w_buff1_used~0_118) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd4~0_42 1) (= 2 v_~z$w_buff0~0_64) (= v_~z$r_buff0_thd4~0_43 v_~z$r_buff1_thd4~0_29) (= v_~z$r_buff0_thd3~0_39 v_~z$r_buff1_thd3~0_35)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_43, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_53, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_42, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-06 06:30:38,860 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:30:38,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-06 06:30:38,861 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 640 flow [2022-12-06 06:30:38,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:38,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:38,861 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] [2022-12-06 06:30:38,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:30:38,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 766117574, now seen corresponding path program 2 times [2022-12-06 06:30:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:38,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253614817] [2022-12-06 06:30:38,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:39,020 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 06:30:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253614817] [2022-12-06 06:30:39,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253614817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:39,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:39,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:30:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330089052] [2022-12-06 06:30:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:39,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:30:39,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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 06:30:39,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:39,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:30:39,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:39,337 INFO L130 PetriNetUnfolder]: 1904/3217 cut-off events. [2022-12-06 06:30:39,337 INFO L131 PetriNetUnfolder]: For 12281/12788 co-relation queries the response was YES. [2022-12-06 06:30:39,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14001 conditions, 3217 events. 1904/3217 cut-off events. For 12281/12788 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20474 event pairs, 178 based on Foata normal form. 379/3473 useless extension candidates. Maximal degree in co-relation 13966. Up to 1119 conditions per place. [2022-12-06 06:30:39,353 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 42 selfloop transitions, 17 changer transitions 84/148 dead transitions. [2022-12-06 06:30:39,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 148 transitions, 1600 flow [2022-12-06 06:30:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 06:30:39,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-06 06:30:39,356 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 640 flow. Second operand 6 states and 96 transitions. [2022-12-06 06:30:39,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 148 transitions, 1600 flow [2022-12-06 06:30:39,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 148 transitions, 1585 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:39,413 INFO L231 Difference]: Finished difference. Result has 79 places, 43 transitions, 333 flow [2022-12-06 06:30:39,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=79, PETRI_TRANSITIONS=43} [2022-12-06 06:30:39,414 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2022-12-06 06:30:39,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:39,414 INFO L89 Accepts]: Start accepts. Operand has 79 places, 43 transitions, 333 flow [2022-12-06 06:30:39,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:39,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:39,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 43 transitions, 333 flow [2022-12-06 06:30:39,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 43 transitions, 333 flow [2022-12-06 06:30:39,426 INFO L130 PetriNetUnfolder]: 57/152 cut-off events. [2022-12-06 06:30:39,426 INFO L131 PetriNetUnfolder]: For 344/366 co-relation queries the response was YES. [2022-12-06 06:30:39,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 152 events. 57/152 cut-off events. For 344/366 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 594 event pairs, 5 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 587. Up to 54 conditions per place. [2022-12-06 06:30:39,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 43 transitions, 333 flow [2022-12-06 06:30:39,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:30:39,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L752: Formula: (and (= v_~a~0_27 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~x~0_85 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_85, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [406] $Ultimate##0-->L764: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_27 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 06:31:40,325 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:31:40,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60912 [2022-12-06 06:31:40,326 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 328 flow [2022-12-06 06:31:40,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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 06:31:40,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:31:40,327 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 06:31:40,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:31:40,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:31:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:31:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1448875160, now seen corresponding path program 1 times [2022-12-06 06:31:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:31:40,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358172242] [2022-12-06 06:31:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:31:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:31:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:31:40,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:31:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:31:40,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:31:40,433 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:31:40,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:31:40,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:31:40,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:31:40,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:31:40,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:31:40,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:31:40,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:31:40,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:31:40,436 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:40,440 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:31:40,440 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:31:40,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:31:40 BasicIcfg [2022-12-06 06:31:40,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:31:40,499 INFO L158 Benchmark]: Toolchain (without parser) took 80884.73ms. Allocated memory was 225.4MB in the beginning and 1.2GB in the end (delta: 945.8MB). Free memory was 200.4MB in the beginning and 1.1GB in the end (delta: -926.8MB). Peak memory consumption was 710.9MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,499 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:31:40,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.63ms. Allocated memory is still 225.4MB. Free memory was 200.4MB in the beginning and 173.0MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.31ms. Allocated memory is still 225.4MB. Free memory was 173.0MB in the beginning and 170.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,500 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 225.4MB. Free memory was 170.4MB in the beginning and 168.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,500 INFO L158 Benchmark]: RCFGBuilder took 604.29ms. Allocated memory is still 225.4MB. Free memory was 168.3MB in the beginning and 134.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,500 INFO L158 Benchmark]: TraceAbstraction took 79730.51ms. Allocated memory was 225.4MB in the beginning and 1.2GB in the end (delta: 945.8MB). Free memory was 134.2MB in the beginning and 1.1GB in the end (delta: -993.0MB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. [2022-12-06 06:31:40,501 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.63ms. Allocated memory is still 225.4MB. Free memory was 200.4MB in the beginning and 173.0MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.31ms. Allocated memory is still 225.4MB. Free memory was 173.0MB in the beginning and 170.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 225.4MB. Free memory was 170.4MB in the beginning and 168.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.29ms. Allocated memory is still 225.4MB. Free memory was 168.3MB in the beginning and 134.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 79730.51ms. Allocated memory was 225.4MB in the beginning and 1.2GB in the end (delta: 945.8MB). Free memory was 134.2MB in the beginning and 1.1GB in the end (delta: -993.0MB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 133 PlacesBefore, 42 PlacesAfterwards, 122 TransitionsBefore, 30 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1965, independent: 1905, independent conditional: 1905, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1965, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1965, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1965, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1615, independent: 1571, independent conditional: 0, independent unconditional: 1571, 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: 1615, independent: 1544, independent conditional: 0, independent unconditional: 1544, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1965, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1615, unknown conditional: 0, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2344, Positive conditional cache size: 0, Positive unconditional cache size: 2344, 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, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 154, 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: 178, independent: 154, independent conditional: 15, independent unconditional: 139, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 154, independent conditional: 15, independent unconditional: 139, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 15, independent unconditional: 139, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 143, independent conditional: 12, independent unconditional: 131, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 160, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 35, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 11, independent conditional: 3, independent unconditional: 8, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 160, unknown conditional: 14, unknown unconditional: 146] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 143, Positive conditional cache size: 12, Positive unconditional cache size: 131, Negative cache size: 17, Negative conditional cache size: 2, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 191, independent conditional: 27, independent unconditional: 164, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 14, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 155, Positive conditional cache size: 12, Positive unconditional cache size: 143, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 178, independent conditional: 33, independent unconditional: 145, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 178, independent conditional: 8, independent unconditional: 170, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 178, independent conditional: 8, independent unconditional: 170, dependent: 20, dependent conditional: 2, dependent unconditional: 18, 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: 2, dependent unconditional: 0, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 178, independent conditional: 8, independent unconditional: 170, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 155, Positive conditional cache size: 12, Positive unconditional cache size: 143, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 181, independent conditional: 42, independent unconditional: 139, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 179, independent conditional: 5, independent unconditional: 174, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 157, Positive conditional cache size: 14, Positive unconditional cache size: 143, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 496, independent: 466, independent conditional: 466, 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: 496, independent: 466, independent conditional: 254, independent unconditional: 212, dependent: 30, dependent conditional: 12, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 496, independent: 466, independent conditional: 66, independent unconditional: 400, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 496, independent: 466, independent conditional: 66, independent unconditional: 400, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 496, independent: 466, independent conditional: 66, independent unconditional: 400, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 157, Positive conditional cache size: 14, Positive unconditional cache size: 143, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 200, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 438, independent: 404, independent conditional: 404, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 438, independent: 404, independent conditional: 166, independent unconditional: 238, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 438, independent: 404, independent conditional: 57, independent unconditional: 347, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 438, independent: 404, independent conditional: 57, independent unconditional: 347, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 438, independent: 396, independent conditional: 54, independent unconditional: 342, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 165, Positive conditional cache size: 17, Positive unconditional cache size: 148, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 117, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 477, independent: 440, independent conditional: 440, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 477, independent: 440, independent conditional: 179, independent unconditional: 261, dependent: 37, dependent conditional: 8, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 477, independent: 440, independent conditional: 63, independent unconditional: 377, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 477, independent: 440, independent conditional: 63, independent unconditional: 377, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 477, independent: 439, independent conditional: 62, independent unconditional: 377, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 166, Positive conditional cache size: 18, Positive unconditional cache size: 148, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 124, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 203, independent conditional: 107, independent unconditional: 96, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 203, independent conditional: 60, independent unconditional: 143, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 203, independent conditional: 60, independent unconditional: 143, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 214, independent: 203, independent conditional: 60, independent unconditional: 143, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 166, Positive conditional cache size: 18, Positive unconditional cache size: 148, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 63 PlacesBefore, 63 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 566, independent conditional: 566, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 592, independent: 566, independent conditional: 314, independent unconditional: 252, dependent: 26, dependent conditional: 14, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 592, independent: 566, independent conditional: 198, independent unconditional: 368, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 592, independent: 566, independent conditional: 198, independent unconditional: 368, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 13, independent unconditional: 10, 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: 24, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, independent: 543, independent conditional: 185, independent unconditional: 358, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 24, unknown conditional: 13, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 203, Positive conditional cache size: 31, Positive unconditional cache size: 172, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 130, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 63 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 300, independent conditional: 300, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 300, independent conditional: 170, independent unconditional: 130, dependent: 21, dependent conditional: 8, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 300, independent conditional: 87, independent unconditional: 213, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 300, independent conditional: 87, independent unconditional: 213, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 321, independent: 300, independent conditional: 87, independent unconditional: 213, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 249, Positive conditional cache size: 33, Positive unconditional cache size: 216, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 91, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 66 PlacesBefore, 66 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 385, independent: 361, independent conditional: 361, 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: 385, independent: 361, independent conditional: 205, independent unconditional: 156, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 385, independent: 361, independent conditional: 119, independent unconditional: 242, 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: 385, independent: 361, independent conditional: 119, independent unconditional: 242, 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: 0, 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: 385, independent: 361, independent conditional: 119, independent unconditional: 242, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 256, Positive conditional cache size: 33, Positive unconditional cache size: 223, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 64, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 96, independent conditional: 32, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 32, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 104, independent: 96, independent conditional: 32, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 256, Positive conditional cache size: 33, Positive unconditional cache size: 223, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 75 PlacesBefore, 74 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 124, independent conditional: 124, 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: 124, independent: 124, independent conditional: 103, independent unconditional: 21, 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: 124, independent: 124, independent conditional: 50, independent unconditional: 74, 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: 124, independent: 124, independent conditional: 50, independent unconditional: 74, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 119, independent conditional: 48, independent unconditional: 71, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 309, Positive conditional cache size: 35, Positive unconditional cache size: 274, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.9s, 74 PlacesBefore, 69 PlacesAfterwards, 43 TransitionsBefore, 38 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 70, 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: 70, independent: 70, independent conditional: 62, independent unconditional: 8, 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: 70, independent: 70, independent conditional: 37, independent unconditional: 33, 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: 70, independent: 70, independent conditional: 37, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 63, independent conditional: 34, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 448, Positive conditional cache size: 43, Positive unconditional cache size: 405, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-2, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 [L751] 1 x = 1 [L763] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 843]: 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: 839]: 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: 837]: 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: 841]: 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, 160 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: 79.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1146 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 25 mSDtfsCounter, 1146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=12, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1357 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 06:31:40,535 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...