/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:40:09,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:40:09,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:40:09,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:40:09,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:40:09,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:40:09,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:40:09,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:40:09,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:40:09,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:40:09,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:40:09,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:40:09,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:40:09,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:40:09,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:40:09,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:40:09,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:40:09,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:40:09,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:40:09,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:40:09,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:40:09,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:40:09,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:40:09,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:40:09,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:40:09,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:40:09,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:40:09,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:40:09,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:40:09,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:40:09,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:40:09,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:40:09,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:40:09,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:40:09,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:40:09,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:40:09,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:40:09,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:40:09,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:40:09,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:40:09,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:40:09,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:40:09,196 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:40:09,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:40:09,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:40:09,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:40:09,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:40:09,198 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:40:09,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:40:09,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:40:09,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:40:09,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:40:09,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:40:09,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:40:09,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:40:09,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:40:09,484 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:40:09,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2022-12-13 00:40:10,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:40:10,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:40:10,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2022-12-13 00:40:10,704 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d54a45c/07fffb4d6794410a8eb09e35aff499d7/FLAG576d9484c [2022-12-13 00:40:10,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d54a45c/07fffb4d6794410a8eb09e35aff499d7 [2022-12-13 00:40:10,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:40:10,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:40:10,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:40:10,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:40:10,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:40:10,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:40:10" (1/1) ... [2022-12-13 00:40:10,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2924ba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:10, skipping insertion in model container [2022-12-13 00:40:10,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:40:10" (1/1) ... [2022-12-13 00:40:10,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:40:10,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:40:10,882 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/mix030_tso.i[944,957] [2022-12-13 00:40:10,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:40:11,061 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:40:11,073 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/mix030_tso.i[944,957] [2022-12-13 00:40:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:11,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:11,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:40:11,176 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:40:11,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11 WrapperNode [2022-12-13 00:40:11,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:40:11,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:40:11,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:40:11,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:40:11,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,249 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-13 00:40:11,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:40:11,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:40:11,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:40:11,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:40:11,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:40:11,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:40:11,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:40:11,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:40:11,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (1/1) ... [2022-12-13 00:40:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:40:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:40:11,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:40:11,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:40:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:40:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:40:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:40:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:40:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:40:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:40:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:40:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:40:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:40:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:40:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:40:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:40:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:40:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:40:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:40:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:40:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:40:11,410 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:40:11,584 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:40:11,586 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:40:11,830 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:40:11,936 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:40:11,936 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:40:11,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:40:11 BoogieIcfgContainer [2022-12-13 00:40:11,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:40:11,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:40:11,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:40:11,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:40:11,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:40:10" (1/3) ... [2022-12-13 00:40:11,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64461e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:40:11, skipping insertion in model container [2022-12-13 00:40:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:11" (2/3) ... [2022-12-13 00:40:11,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64461e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:40:11, skipping insertion in model container [2022-12-13 00:40:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:40:11" (3/3) ... [2022-12-13 00:40:11,946 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2022-12-13 00:40:11,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:40:11,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:40:11,962 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:40:12,022 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:40:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-13 00:40:12,134 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 00:40:12,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:12,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 00:40:12,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-13 00:40:12,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-13 00:40:12,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:12,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-13 00:40:12,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-13 00:40:12,232 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 00:40:12,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:12,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 00:40:12,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-13 00:40:12,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-13 00:40:21,493 INFO L241 LiptonReduction]: Total number of compositions: 97 [2022-12-13 00:40:21,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:40:21,508 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7af9d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:40:21,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:40:21,513 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:40:21,513 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:21,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:21,513 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:21,514 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-13 00:40:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2116548341, now seen corresponding path program 1 times [2022-12-13 00:40:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:21,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423779593] [2022-12-13 00:40:21,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:21,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423779593] [2022-12-13 00:40:21,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423779593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:21,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:21,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110105146] [2022-12-13 00:40:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:21,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:22,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2022-12-13 00:40:22,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:22,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:22,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2022-12-13 00:40:22,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:27,315 INFO L130 PetriNetUnfolder]: 42055/60367 cut-off events. [2022-12-13 00:40:27,315 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 00:40:27,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116271 conditions, 60367 events. 42055/60367 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 3524. Compared 464982 event pairs, 5495 based on Foata normal form. 0/37048 useless extension candidates. Maximal degree in co-relation 116259. Up to 47761 conditions per place. [2022-12-13 00:40:27,527 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 37 selfloop transitions, 2 changer transitions 48/100 dead transitions. [2022-12-13 00:40:27,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 386 flow [2022-12-13 00:40:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-13 00:40:27,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2022-12-13 00:40:27,539 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 144 flow. Second operand 3 states and 131 transitions. [2022-12-13 00:40:27,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 386 flow [2022-12-13 00:40:27,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:40:27,546 INFO L231 Difference]: Finished difference. Result has 74 places, 39 transitions, 90 flow [2022-12-13 00:40:27,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=74, PETRI_TRANSITIONS=39} [2022-12-13 00:40:27,551 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 00:40:27,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:27,552 INFO L89 Accepts]: Start accepts. Operand has 74 places, 39 transitions, 90 flow [2022-12-13 00:40:27,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:27,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:27,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 39 transitions, 90 flow [2022-12-13 00:40:27,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2022-12-13 00:40:27,571 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 00:40:27,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:27,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:40:27,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 90 flow [2022-12-13 00:40:27,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 00:40:27,872 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:27,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 323 [2022-12-13 00:40:27,875 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2022-12-13 00:40:27,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:27,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:27,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:27,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:40:27,880 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-13 00:40:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1811642005, now seen corresponding path program 1 times [2022-12-13 00:40:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:27,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731575607] [2022-12-13 00:40:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:28,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731575607] [2022-12-13 00:40:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731575607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:28,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205187379] [2022-12-13 00:40:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:28,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 00:40:28,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:28,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:28,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 00:40:28,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:29,134 INFO L130 PetriNetUnfolder]: 7407/10975 cut-off events. [2022-12-13 00:40:29,134 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-13 00:40:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21629 conditions, 10975 events. 7407/10975 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 69085 event pairs, 1611 based on Foata normal form. 48/8920 useless extension candidates. Maximal degree in co-relation 21619. Up to 9525 conditions per place. [2022-12-13 00:40:29,184 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 41 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-13 00:40:29,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 218 flow [2022-12-13 00:40:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 00:40:29,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 00:40:29,185 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 81 transitions. [2022-12-13 00:40:29,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 218 flow [2022-12-13 00:40:29,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:29,187 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 00:40:29,188 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 00:40:29,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:29,188 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:29,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:29,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,193 INFO L130 PetriNetUnfolder]: 3/55 cut-off events. [2022-12-13 00:40:29,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:29,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 55 events. 3/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 147 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2022-12-13 00:40:29,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-13 00:40:29,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:29,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 00:40:29,210 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 105 flow [2022-12-13 00:40:29,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:29,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:29,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:29,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:40:29,211 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-13 00:40:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash 326325556, now seen corresponding path program 1 times [2022-12-13 00:40:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129607798] [2022-12-13 00:40:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129607798] [2022-12-13 00:40:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129607798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:29,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:29,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098741057] [2022-12-13 00:40:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:29,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:29,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2022-12-13 00:40:29,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:29,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:29,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2022-12-13 00:40:29,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:29,903 INFO L130 PetriNetUnfolder]: 6295/9423 cut-off events. [2022-12-13 00:40:29,903 INFO L131 PetriNetUnfolder]: For 828/828 co-relation queries the response was YES. [2022-12-13 00:40:29,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19270 conditions, 9423 events. 6295/9423 cut-off events. For 828/828 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 58329 event pairs, 2123 based on Foata normal form. 184/7652 useless extension candidates. Maximal degree in co-relation 19259. Up to 5897 conditions per place. [2022-12-13 00:40:29,965 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 38 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-12-13 00:40:29,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 216 flow [2022-12-13 00:40:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 00:40:29,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:40:29,967 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 105 flow. Second operand 3 states and 78 transitions. [2022-12-13 00:40:29,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 216 flow [2022-12-13 00:40:29,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:40:29,968 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-13 00:40:29,969 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 00:40:29,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:29,969 INFO L89 Accepts]: Start accepts. Operand has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:29,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:29,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,976 INFO L130 PetriNetUnfolder]: 3/55 cut-off events. [2022-12-13 00:40:29,976 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:40:29,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 55 events. 3/55 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 152 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2022-12-13 00:40:29,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 00:40:29,979 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:29,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 00:40:29,980 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 110 flow [2022-12-13 00:40:29,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:29,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:29,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:29,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:40:29,980 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-13 00:40:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash 740863376, now seen corresponding path program 1 times [2022-12-13 00:40:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:29,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467025240] [2022-12-13 00:40:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467025240] [2022-12-13 00:40:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467025240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:30,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:30,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:40:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540421007] [2022-12-13 00:40:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:30,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:40:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:40:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:40:30,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 00:40:30,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:30,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:30,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 00:40:30,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:32,610 INFO L130 PetriNetUnfolder]: 21787/31237 cut-off events. [2022-12-13 00:40:32,611 INFO L131 PetriNetUnfolder]: For 5878/5878 co-relation queries the response was YES. [2022-12-13 00:40:32,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66816 conditions, 31237 events. 21787/31237 cut-off events. For 5878/5878 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 196389 event pairs, 3305 based on Foata normal form. 610/26145 useless extension candidates. Maximal degree in co-relation 66803. Up to 18640 conditions per place. [2022-12-13 00:40:32,810 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 67 selfloop transitions, 20 changer transitions 0/96 dead transitions. [2022-12-13 00:40:32,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 422 flow [2022-12-13 00:40:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:40:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:40:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-13 00:40:32,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-13 00:40:32,814 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 110 flow. Second operand 5 states and 129 transitions. [2022-12-13 00:40:32,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 422 flow [2022-12-13 00:40:32,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:32,866 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:32,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-13 00:40:32,867 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 00:40:32,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:32,867 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:32,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:32,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:32,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:32,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:32,989 INFO L130 PetriNetUnfolder]: 649/1660 cut-off events. [2022-12-13 00:40:32,989 INFO L131 PetriNetUnfolder]: For 614/658 co-relation queries the response was YES. [2022-12-13 00:40:32,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3627 conditions, 1660 events. 649/1660 cut-off events. For 614/658 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13362 event pairs, 183 based on Foata normal form. 3/1232 useless extension candidates. Maximal degree in co-relation 3614. Up to 681 conditions per place. [2022-12-13 00:40:33,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:33,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 1432 [2022-12-13 00:40:33,029 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:33,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 00:40:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 258 flow [2022-12-13 00:40:33,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:33,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:33,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:33,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:40:33,031 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-13 00:40:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 817641386, now seen corresponding path program 2 times [2022-12-13 00:40:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953704897] [2022-12-13 00:40:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953704897] [2022-12-13 00:40:33,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953704897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:33,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:33,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16259678] [2022-12-13 00:40:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:33,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:33,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:33,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 00:40:33,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:33,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:33,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 00:40:33,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:35,919 INFO L130 PetriNetUnfolder]: 21437/30747 cut-off events. [2022-12-13 00:40:35,919 INFO L131 PetriNetUnfolder]: For 22143/22143 co-relation queries the response was YES. [2022-12-13 00:40:35,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84128 conditions, 30747 events. 21437/30747 cut-off events. For 22143/22143 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 192834 event pairs, 3708 based on Foata normal form. 50/25170 useless extension candidates. Maximal degree in co-relation 84112. Up to 17728 conditions per place. [2022-12-13 00:40:36,099 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 73 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2022-12-13 00:40:36,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 103 transitions, 594 flow [2022-12-13 00:40:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 00:40:36,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2022-12-13 00:40:36,101 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 258 flow. Second operand 4 states and 114 transitions. [2022-12-13 00:40:36,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 103 transitions, 594 flow [2022-12-13 00:40:36,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 594 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:40:36,117 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2022-12-13 00:40:36,119 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-13 00:40:36,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:36,119 INFO L89 Accepts]: Start accepts. Operand has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:36,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:36,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,215 INFO L130 PetriNetUnfolder]: 650/1627 cut-off events. [2022-12-13 00:40:36,215 INFO L131 PetriNetUnfolder]: For 1865/1997 co-relation queries the response was YES. [2022-12-13 00:40:36,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 1627 events. 650/1627 cut-off events. For 1865/1997 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13069 event pairs, 165 based on Foata normal form. 11/1191 useless extension candidates. Maximal degree in co-relation 4545. Up to 639 conditions per place. [2022-12-13 00:40:36,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 1576 [2022-12-13 00:40:36,250 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:36,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 00:40:36,250 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 394 flow [2022-12-13 00:40:36,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:36,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:36,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:36,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:40:36,251 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-13 00:40:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2069676049, now seen corresponding path program 1 times [2022-12-13 00:40:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:36,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294579126] [2022-12-13 00:40:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:36,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294579126] [2022-12-13 00:40:36,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294579126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:36,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:36,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111519862] [2022-12-13 00:40:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:36,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:36,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 00:40:36,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:36,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:36,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 00:40:36,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:38,759 INFO L130 PetriNetUnfolder]: 21325/31784 cut-off events. [2022-12-13 00:40:38,759 INFO L131 PetriNetUnfolder]: For 45596/45863 co-relation queries the response was YES. [2022-12-13 00:40:38,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95354 conditions, 31784 events. 21325/31784 cut-off events. For 45596/45863 co-relation queries the response was YES. Maximal size of possible extension queue 1418. Compared 224669 event pairs, 8088 based on Foata normal form. 632/25315 useless extension candidates. Maximal degree in co-relation 95334. Up to 15128 conditions per place. [2022-12-13 00:40:38,960 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 68 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2022-12-13 00:40:38,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 643 flow [2022-12-13 00:40:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 00:40:38,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 00:40:38,961 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 394 flow. Second operand 3 states and 84 transitions. [2022-12-13 00:40:38,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 643 flow [2022-12-13 00:40:39,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:40:39,002 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,003 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2022-12-13 00:40:39,003 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -12 predicate places. [2022-12-13 00:40:39,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:39,003 INFO L89 Accepts]: Start accepts. Operand has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:39,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:39,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,142 INFO L130 PetriNetUnfolder]: 688/1856 cut-off events. [2022-12-13 00:40:39,142 INFO L131 PetriNetUnfolder]: For 3030/3172 co-relation queries the response was YES. [2022-12-13 00:40:39,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5273 conditions, 1856 events. 688/1856 cut-off events. For 3030/3172 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 16092 event pairs, 199 based on Foata normal form. 12/1336 useless extension candidates. Maximal degree in co-relation 5254. Up to 712 conditions per place. [2022-12-13 00:40:39,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 1574 [2022-12-13 00:40:39,169 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:39,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 00:40:39,170 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 414 flow [2022-12-13 00:40:39,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:39,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:39,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:40:39,170 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-13 00:40:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1661896452, now seen corresponding path program 1 times [2022-12-13 00:40:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:39,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767290168] [2022-12-13 00:40:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:39,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767290168] [2022-12-13 00:40:39,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767290168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:39,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:39,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:40:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449905640] [2022-12-13 00:40:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:39,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:39,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:39,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:39,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 00:40:39,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:39,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:39,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 00:40:39,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:44,420 INFO L130 PetriNetUnfolder]: 52192/73005 cut-off events. [2022-12-13 00:40:44,420 INFO L131 PetriNetUnfolder]: For 114223/118971 co-relation queries the response was YES. [2022-12-13 00:40:44,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214291 conditions, 73005 events. 52192/73005 cut-off events. For 114223/118971 co-relation queries the response was YES. Maximal size of possible extension queue 3896. Compared 522339 event pairs, 15824 based on Foata normal form. 6706/50872 useless extension candidates. Maximal degree in co-relation 214269. Up to 56458 conditions per place. [2022-12-13 00:40:44,821 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 134 selfloop transitions, 26 changer transitions 2/181 dead transitions. [2022-12-13 00:40:44,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 181 transitions, 1355 flow [2022-12-13 00:40:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:40:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:40:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-13 00:40:44,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2022-12-13 00:40:44,823 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 414 flow. Second operand 5 states and 141 transitions. [2022-12-13 00:40:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 181 transitions, 1355 flow [2022-12-13 00:40:44,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 181 transitions, 1327 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 00:40:44,890 INFO L231 Difference]: Finished difference. Result has 72 places, 94 transitions, 607 flow [2022-12-13 00:40:44,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=72, PETRI_TRANSITIONS=94} [2022-12-13 00:40:44,891 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -6 predicate places. [2022-12-13 00:40:44,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:44,891 INFO L89 Accepts]: Start accepts. Operand has 72 places, 94 transitions, 607 flow [2022-12-13 00:40:44,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:44,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:44,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 94 transitions, 607 flow [2022-12-13 00:40:44,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 94 transitions, 607 flow [2022-12-13 00:40:47,126 INFO L130 PetriNetUnfolder]: 26049/39565 cut-off events. [2022-12-13 00:40:47,126 INFO L131 PetriNetUnfolder]: For 42420/113992 co-relation queries the response was YES. [2022-12-13 00:40:47,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129406 conditions, 39565 events. 26049/39565 cut-off events. For 42420/113992 co-relation queries the response was YES. Maximal size of possible extension queue 4786. Compared 344768 event pairs, 12933 based on Foata normal form. 477/17921 useless extension candidates. Maximal degree in co-relation 129383. Up to 32557 conditions per place. [2022-12-13 00:40:47,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 94 transitions, 607 flow [2022-12-13 00:40:47,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 2616 [2022-12-13 00:40:47,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [407] L835-->L838: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:47,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [440] L835-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 00:40:47,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [398] L789-->L792: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:47,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [385] L752-->L757: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:47,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [391] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:47,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_11| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_11|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 00:40:47,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [501] L789-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:40:47,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [430] L752-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P0Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:48,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [516] L767-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_135 (+ v_~__unbuffered_cnt~0_136 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 00:40:48,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [502] L789-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:40:48,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [478] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:48,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [425] L767-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork3_#res.base_5| 0) (= |v_P1Thread1of1ForFork3_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 00:40:48,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:40:48,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3269 [2022-12-13 00:40:48,160 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 93 transitions, 649 flow [2022-12-13 00:40:48,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:48,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:48,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:48,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:40:48,160 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-13 00:40:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1347279338, now seen corresponding path program 1 times [2022-12-13 00:40:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:48,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746257660] [2022-12-13 00:40:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:48,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746257660] [2022-12-13 00:40:48,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746257660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:48,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:48,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:40:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188368202] [2022-12-13 00:40:48,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:48,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:48,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2022-12-13 00:40:48,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 93 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:48,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:48,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2022-12-13 00:40:48,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:55,626 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [170#true, 189#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, 145#true, P0Thread1of1ForFork1InUse, 41#L828true, P2Thread1of1ForFork0InUse, 84#L870true, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:55,626 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,626 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,626 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,626 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,851 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), 162#true, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 41#L828true, P2Thread1of1ForFork0InUse, 84#L870true, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:55,851 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,852 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,852 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,852 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,916 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), P3Thread1of1ForFork2InUse, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), 104#P0EXITtrue, P0Thread1of1ForFork1InUse, 41#L828true, P2Thread1of1ForFork0InUse, 84#L870true, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:55,916 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,916 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,916 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:55,916 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([407] L835-->L838: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0][166], [170#true, 189#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, 145#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, 150#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,724 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L835-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][179], [170#true, 189#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, 145#true, 164#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,724 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,724 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_11| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_11|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][180], [170#true, 189#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, 145#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~y~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 198#true, 82#P3EXITtrue, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,725 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [42#L835true, 170#true, 189#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, 145#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 84#L870true, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,725 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,725 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,779 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([407] L835-->L838: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0][166], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), 162#true, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 150#true, 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,779 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,779 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,779 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,779 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,779 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L835-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][179], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), 162#true, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 164#true, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,780 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_11| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_11|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][180], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), 162#true, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~y~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 82#P3EXITtrue, 144#true]) [2022-12-13 00:40:56,780 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [42#L835true, 189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), 162#true, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 84#L870true, Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~y~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,780 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,780 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([407] L835-->L838: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0][166], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), P3Thread1of1ForFork2InUse, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), 104#P0EXITtrue, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 150#true, 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~y~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,835 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L835-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][179], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), P3Thread1of1ForFork2InUse, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), 104#P0EXITtrue, P0Thread1of1ForFork1InUse, 164#true, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,835 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,835 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_11| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_11|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0][180], [189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), P3Thread1of1ForFork2InUse, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), 104#P0EXITtrue, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 69#L2true, 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, 82#P3EXITtrue, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,836 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L2-->L870: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_261 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_240 256) 0)) .cse4))) (and (= v_~z~0_199 (ite .cse0 v_~z$w_buff0~0_171 (ite .cse1 v_~z$w_buff1~0_165 v_~z~0_200))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~z$w_buff0_used~0_261 (ite .cse0 0 v_~z$w_buff0_used~0_262)) (= v_~z$r_buff0_thd0~0_131 (ite .cse2 0 v_~z$r_buff0_thd0~0_132)) (= v_~z$w_buff1_used~0_239 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_240)) (= v_~z$r_buff1_thd0~0_122 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_131 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_239 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_262, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_240, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_200, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_261, ~z$w_buff0~0=v_~z$w_buff0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_239, ~z$w_buff1~0=v_~z$w_buff1~0_165, ~z~0=v_~z~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0][154], [42#L835true, 189#true, 170#true, Black: 194#(or (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))) (not (= 2 ~x~0))), P3Thread1of1ForFork2InUse, Black: 192#(and (= ~z$r_buff0_thd4~0 1) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0_used~0 1) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~x~0)), 104#P0EXITtrue, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 84#L870true, Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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 (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 200#(= ~x~0 0), P1Thread1of1ForFork3InUse, 217#true, Black: 206#(= ~y~0 1), 208#true, Black: 211#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 210#(<= ~__unbuffered_cnt~0 0), Black: 213#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(<= ~y~0 0), 198#true, Black: 187#(= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 00:40:56,836 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:56,836 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 00:40:58,041 INFO L130 PetriNetUnfolder]: 91644/129118 cut-off events. [2022-12-13 00:40:58,041 INFO L131 PetriNetUnfolder]: For 226826/237551 co-relation queries the response was YES. [2022-12-13 00:40:58,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519195 conditions, 129118 events. 91644/129118 cut-off events. For 226826/237551 co-relation queries the response was YES. Maximal size of possible extension queue 5669. Compared 965042 event pairs, 29045 based on Foata normal form. 1535/99164 useless extension candidates. Maximal degree in co-relation 519169. Up to 84456 conditions per place. [2022-12-13 00:40:58,977 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 114 selfloop transitions, 22 changer transitions 36/185 dead transitions. [2022-12-13 00:40:58,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 185 transitions, 1620 flow [2022-12-13 00:40:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-12-13 00:40:58,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2022-12-13 00:40:58,978 INFO L175 Difference]: Start difference. First operand has 71 places, 93 transitions, 649 flow. Second operand 4 states and 152 transitions. [2022-12-13 00:40:58,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 185 transitions, 1620 flow [2022-12-13 00:40:59,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 185 transitions, 1519 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-13 00:40:59,242 INFO L231 Difference]: Finished difference. Result has 76 places, 94 transitions, 754 flow [2022-12-13 00:40:59,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=76, PETRI_TRANSITIONS=94} [2022-12-13 00:40:59,243 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2022-12-13 00:40:59,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:59,243 INFO L89 Accepts]: Start accepts. Operand has 76 places, 94 transitions, 754 flow [2022-12-13 00:40:59,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:59,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:59,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 94 transitions, 754 flow [2022-12-13 00:40:59,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 94 transitions, 754 flow [2022-12-13 00:41:02,549 INFO L130 PetriNetUnfolder]: 35011/52199 cut-off events. [2022-12-13 00:41:02,549 INFO L131 PetriNetUnfolder]: For 87569/111401 co-relation queries the response was YES. [2022-12-13 00:41:02,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176885 conditions, 52199 events. 35011/52199 cut-off events. For 87569/111401 co-relation queries the response was YES. Maximal size of possible extension queue 4866. Compared 441693 event pairs, 18447 based on Foata normal form. 1268/26270 useless extension candidates. Maximal degree in co-relation 176858. Up to 42427 conditions per place. [2022-12-13 00:41:03,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 94 transitions, 754 flow [2022-12-13 00:41:03,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 2358 [2022-12-13 00:41:03,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:03,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4144 [2022-12-13 00:41:03,387 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 756 flow [2022-12-13 00:41:03,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:03,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:03,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:03,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:41:03,388 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-13 00:41:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1911892927, now seen corresponding path program 1 times [2022-12-13 00:41:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:03,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79387853] [2022-12-13 00:41:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:03,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:03,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79387853] [2022-12-13 00:41:03,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79387853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:03,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:03,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763584291] [2022-12-13 00:41:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:03,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:03,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 00:41:03,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 756 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:03,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:03,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 00:41:03,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:10,084 INFO L130 PetriNetUnfolder]: 57726/83441 cut-off events. [2022-12-13 00:41:10,084 INFO L131 PetriNetUnfolder]: For 258981/266733 co-relation queries the response was YES. [2022-12-13 00:41:10,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363283 conditions, 83441 events. 57726/83441 cut-off events. For 258981/266733 co-relation queries the response was YES. Maximal size of possible extension queue 4845. Compared 647719 event pairs, 7875 based on Foata normal form. 8942/58825 useless extension candidates. Maximal degree in co-relation 363253. Up to 57097 conditions per place. [2022-12-13 00:41:10,555 INFO L137 encePairwiseOnDemand]: 24/40 looper letters, 124 selfloop transitions, 38 changer transitions 52/236 dead transitions. [2022-12-13 00:41:10,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 236 transitions, 2328 flow [2022-12-13 00:41:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2022-12-13 00:41:10,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 00:41:10,557 INFO L175 Difference]: Start difference. First operand has 75 places, 94 transitions, 756 flow. Second operand 6 states and 174 transitions. [2022-12-13 00:41:10,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 236 transitions, 2328 flow [2022-12-13 00:41:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 2312 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:13,572 INFO L231 Difference]: Finished difference. Result has 82 places, 116 transitions, 1018 flow [2022-12-13 00:41:13,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1018, PETRI_PLACES=82, PETRI_TRANSITIONS=116} [2022-12-13 00:41:13,572 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2022-12-13 00:41:13,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:13,573 INFO L89 Accepts]: Start accepts. Operand has 82 places, 116 transitions, 1018 flow [2022-12-13 00:41:13,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:13,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:13,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 116 transitions, 1018 flow [2022-12-13 00:41:13,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 116 transitions, 1018 flow [2022-12-13 00:41:16,355 INFO L130 PetriNetUnfolder]: 24550/39638 cut-off events. [2022-12-13 00:41:16,356 INFO L131 PetriNetUnfolder]: For 139284/332568 co-relation queries the response was YES. [2022-12-13 00:41:16,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175118 conditions, 39638 events. 24550/39638 cut-off events. For 139284/332568 co-relation queries the response was YES. Maximal size of possible extension queue 4929. Compared 370209 event pairs, 6813 based on Foata normal form. 245/19367 useless extension candidates. Maximal degree in co-relation 175087. Up to 31816 conditions per place. [2022-12-13 00:41:16,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 116 transitions, 1018 flow [2022-12-13 00:41:16,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 3510 [2022-12-13 00:41:16,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [391] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:41:16,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [478] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:41:16,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [516] L767-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_135 (+ v_~__unbuffered_cnt~0_136 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 00:41:16,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [398] L789-->L792: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:41:16,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [425] L767-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork3_#res.base_5| 0) (= |v_P1Thread1of1ForFork3_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 00:41:17,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [501] L789-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:41:17,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [407] L835-->L838: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:41:17,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [385] L752-->L757: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:41:17,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [502] L789-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:41:17,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [440] L835-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 00:41:17,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [430] L752-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P0Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:41:17,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L859-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_11| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_11|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 00:41:17,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:17,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3670 [2022-12-13 00:41:17,243 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 115 transitions, 1058 flow [2022-12-13 00:41:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:17,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:17,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:17,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:41:17,243 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-13 00:41:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash 376906479, now seen corresponding path program 1 times [2022-12-13 00:41:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:17,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343334336] [2022-12-13 00:41:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343334336] [2022-12-13 00:41:17,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343334336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:17,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:17,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:41:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175910641] [2022-12-13 00:41:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:17,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:17,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2022-12-13 00:41:17,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 115 transitions, 1058 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:17,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:17,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2022-12-13 00:41:17,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:22,707 INFO L130 PetriNetUnfolder]: 38882/59377 cut-off events. [2022-12-13 00:41:22,707 INFO L131 PetriNetUnfolder]: For 238368/246516 co-relation queries the response was YES. [2022-12-13 00:41:22,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314949 conditions, 59377 events. 38882/59377 cut-off events. For 238368/246516 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 492803 event pairs, 1320 based on Foata normal form. 6603/42155 useless extension candidates. Maximal degree in co-relation 314915. Up to 39565 conditions per place. [2022-12-13 00:41:23,037 INFO L137 encePairwiseOnDemand]: 24/51 looper letters, 116 selfloop transitions, 50 changer transitions 77/264 dead transitions. [2022-12-13 00:41:23,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 264 transitions, 2806 flow [2022-12-13 00:41:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:41:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:41:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2022-12-13 00:41:23,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022408963585434 [2022-12-13 00:41:23,039 INFO L175 Difference]: Start difference. First operand has 81 places, 115 transitions, 1058 flow. Second operand 7 states and 215 transitions. [2022-12-13 00:41:23,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 264 transitions, 2806 flow [2022-12-13 00:41:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 264 transitions, 2665 flow, removed 64 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:32,155 INFO L231 Difference]: Finished difference. Result has 88 places, 125 transitions, 1188 flow [2022-12-13 00:41:32,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1188, PETRI_PLACES=88, PETRI_TRANSITIONS=125} [2022-12-13 00:41:32,156 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2022-12-13 00:41:32,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:32,156 INFO L89 Accepts]: Start accepts. Operand has 88 places, 125 transitions, 1188 flow [2022-12-13 00:41:32,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:32,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:32,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 125 transitions, 1188 flow [2022-12-13 00:41:32,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 125 transitions, 1188 flow [2022-12-13 00:41:33,732 INFO L130 PetriNetUnfolder]: 12909/24062 cut-off events. [2022-12-13 00:41:33,732 INFO L131 PetriNetUnfolder]: For 106029/186884 co-relation queries the response was YES. [2022-12-13 00:41:33,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132000 conditions, 24062 events. 12909/24062 cut-off events. For 106029/186884 co-relation queries the response was YES. Maximal size of possible extension queue 2886. Compared 247831 event pairs, 1368 based on Foata normal form. 115/11851 useless extension candidates. Maximal degree in co-relation 131966. Up to 14710 conditions per place. [2022-12-13 00:41:34,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 125 transitions, 1188 flow [2022-12-13 00:41:34,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 3298 [2022-12-13 00:41:34,196 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:34,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2041 [2022-12-13 00:41:34,197 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 125 transitions, 1188 flow [2022-12-13 00:41:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:34,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:34,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:34,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:41:34,197 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-13 00:41:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 230084235, now seen corresponding path program 1 times [2022-12-13 00:41:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696231816] [2022-12-13 00:41:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:34,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696231816] [2022-12-13 00:41:34,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696231816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:34,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:34,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:41:34,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786833144] [2022-12-13 00:41:34,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:34,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:41:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:41:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:41:34,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2022-12-13 00:41:34,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 125 transitions, 1188 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:34,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:34,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2022-12-13 00:41:34,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:38,202 INFO L130 PetriNetUnfolder]: 26655/42662 cut-off events. [2022-12-13 00:41:38,202 INFO L131 PetriNetUnfolder]: For 166856/172036 co-relation queries the response was YES. [2022-12-13 00:41:38,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242211 conditions, 42662 events. 26655/42662 cut-off events. For 166856/172036 co-relation queries the response was YES. Maximal size of possible extension queue 3103. Compared 370792 event pairs, 204 based on Foata normal form. 3738/30130 useless extension candidates. Maximal degree in co-relation 242174. Up to 17857 conditions per place. [2022-12-13 00:41:38,472 INFO L137 encePairwiseOnDemand]: 24/51 looper letters, 71 selfloop transitions, 56 changer transitions 103/244 dead transitions. [2022-12-13 00:41:38,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 244 transitions, 2681 flow [2022-12-13 00:41:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:41:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:41:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2022-12-13 00:41:38,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48366013071895425 [2022-12-13 00:41:38,474 INFO L175 Difference]: Start difference. First operand has 87 places, 125 transitions, 1188 flow. Second operand 9 states and 222 transitions. [2022-12-13 00:41:38,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 244 transitions, 2681 flow [2022-12-13 00:41:49,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 244 transitions, 2490 flow, removed 47 selfloop flow, removed 6 redundant places. [2022-12-13 00:41:49,662 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 876 flow [2022-12-13 00:41:49,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=876, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2022-12-13 00:41:49,663 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 14 predicate places. [2022-12-13 00:41:49,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:49,663 INFO L89 Accepts]: Start accepts. Operand has 92 places, 97 transitions, 876 flow [2022-12-13 00:41:49,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:49,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:49,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 97 transitions, 876 flow [2022-12-13 00:41:49,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 97 transitions, 876 flow [2022-12-13 00:41:49,774 INFO L130 PetriNetUnfolder]: 921/2097 cut-off events. [2022-12-13 00:41:49,774 INFO L131 PetriNetUnfolder]: For 6095/10701 co-relation queries the response was YES. [2022-12-13 00:41:49,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10029 conditions, 2097 events. 921/2097 cut-off events. For 6095/10701 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 16135 event pairs, 6 based on Foata normal form. 9/898 useless extension candidates. Maximal degree in co-relation 9995. Up to 1234 conditions per place. [2022-12-13 00:41:49,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 97 transitions, 876 flow [2022-12-13 00:41:49,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 1506 [2022-12-13 00:41:50,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] $Ultimate##0-->L809: Formula: (and (= v_~z$w_buff0~0_118 v_~z$w_buff1~0_116) (= v_~z$r_buff0_thd0~0_85 v_~z$r_buff1_thd0~0_77) (= |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) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_17) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_205 256) 0)) (not (= (mod v_~z$w_buff1_used~0_186 256) 0)))) 1 0)) (= v_~z$w_buff0~0_117 2) (= v_~z$r_buff0_thd3~0_41 v_~z$r_buff1_thd3~0_41) (= v_~z$r_buff1_thd4~0_85 v_~z$r_buff0_thd4~0_101) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd4~0_100 1) (= v_~z$w_buff0_used~0_206 v_~z$w_buff1_used~0_186) (= v_~z$w_buff0_used~0_205 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_85, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_118, 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_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~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_85, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_205, ~z$w_buff0~0=v_~z$w_buff0~0_117, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_186, ~z$w_buff1~0=v_~z$w_buff1~0_116, 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_85, 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_77, ~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_100, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~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] and [384] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:41:52,164 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:41:52,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2502 [2022-12-13 00:41:52,165 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 799 flow [2022-12-13 00:41:52,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:52,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:52,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:52,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:41:52,165 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-13 00:41:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 242284294, now seen corresponding path program 1 times [2022-12-13 00:41:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:52,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540345060] [2022-12-13 00:41:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540345060] [2022-12-13 00:41:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540345060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618277939] [2022-12-13 00:41:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:52,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2022-12-13 00:41:52,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 799 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:52,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:52,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2022-12-13 00:41:52,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:52,781 INFO L130 PetriNetUnfolder]: 3391/5298 cut-off events. [2022-12-13 00:41:52,782 INFO L131 PetriNetUnfolder]: For 22694/23410 co-relation queries the response was YES. [2022-12-13 00:41:52,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27605 conditions, 5298 events. 3391/5298 cut-off events. For 22694/23410 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 31187 event pairs, 302 based on Foata normal form. 275/4110 useless extension candidates. Maximal degree in co-relation 27568. Up to 2656 conditions per place. [2022-12-13 00:41:52,811 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 54 selfloop transitions, 1 changer transitions 61/138 dead transitions. [2022-12-13 00:41:52,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 138 transitions, 1470 flow [2022-12-13 00:41:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 00:41:52,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 00:41:52,812 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 799 flow. Second operand 4 states and 95 transitions. [2022-12-13 00:41:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 138 transitions, 1470 flow [2022-12-13 00:41:53,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 138 transitions, 1037 flow, removed 110 selfloop flow, removed 17 redundant places. [2022-12-13 00:41:53,090 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 427 flow [2022-12-13 00:41:53,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2022-12-13 00:41:53,091 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2022-12-13 00:41:53,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:53,091 INFO L89 Accepts]: Start accepts. Operand has 71 places, 74 transitions, 427 flow [2022-12-13 00:41:53,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:53,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:53,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 74 transitions, 427 flow [2022-12-13 00:41:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 74 transitions, 427 flow [2022-12-13 00:41:53,150 INFO L130 PetriNetUnfolder]: 761/1309 cut-off events. [2022-12-13 00:41:53,150 INFO L131 PetriNetUnfolder]: For 3665/3884 co-relation queries the response was YES. [2022-12-13 00:41:53,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4112 conditions, 1309 events. 761/1309 cut-off events. For 3665/3884 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 7403 event pairs, 3 based on Foata normal form. 6/464 useless extension candidates. Maximal degree in co-relation 4090. Up to 649 conditions per place. [2022-12-13 00:41:53,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 74 transitions, 427 flow [2022-12-13 00:41:53,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 00:41:53,366 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:41:53,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-13 00:41:53,366 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 427 flow [2022-12-13 00:41:53,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:53,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:53,367 INFO L214 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-13 00:41:53,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:41:53,367 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-13 00:41:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 366368876, now seen corresponding path program 1 times [2022-12-13 00:41:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:53,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974999046] [2022-12-13 00:41:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:53,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974999046] [2022-12-13 00:41:53,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974999046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:53,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:53,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375303617] [2022-12-13 00:41:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:53,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:53,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:41:53,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:53,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:53,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:41:53,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:54,213 INFO L130 PetriNetUnfolder]: 1933/2977 cut-off events. [2022-12-13 00:41:54,213 INFO L131 PetriNetUnfolder]: For 9463/9758 co-relation queries the response was YES. [2022-12-13 00:41:54,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 2977 events. 1933/2977 cut-off events. For 9463/9758 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 16305 event pairs, 113 based on Foata normal form. 189/2205 useless extension candidates. Maximal degree in co-relation 11035. Up to 1382 conditions per place. [2022-12-13 00:41:54,226 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 73 selfloop transitions, 6 changer transitions 27/125 dead transitions. [2022-12-13 00:41:54,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 933 flow [2022-12-13 00:41:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-13 00:41:54,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2022-12-13 00:41:54,227 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 427 flow. Second operand 6 states and 91 transitions. [2022-12-13 00:41:54,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 933 flow [2022-12-13 00:41:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 908 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 00:41:54,281 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 417 flow [2022-12-13 00:41:54,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2022-12-13 00:41:54,282 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 00:41:54,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:54,282 INFO L89 Accepts]: Start accepts. Operand has 68 places, 72 transitions, 417 flow [2022-12-13 00:41:54,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:54,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:54,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 72 transitions, 417 flow [2022-12-13 00:41:54,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 72 transitions, 417 flow [2022-12-13 00:41:54,363 INFO L130 PetriNetUnfolder]: 1183/1909 cut-off events. [2022-12-13 00:41:54,364 INFO L131 PetriNetUnfolder]: For 3685/4231 co-relation queries the response was YES. [2022-12-13 00:41:54,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5591 conditions, 1909 events. 1183/1909 cut-off events. For 3685/4231 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 11254 event pairs, 2 based on Foata normal form. 5/603 useless extension candidates. Maximal degree in co-relation 5569. Up to 892 conditions per place. [2022-12-13 00:41:54,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 72 transitions, 417 flow [2022-12-13 00:41:54,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 00:41:54,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] $Ultimate##0-->L752: Formula: (and (= v_~a~0_47 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|) (= v_~x~0_219 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_47, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_219, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [458] $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_28 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_28} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-13 00:41:54,421 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:41:54,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 00:41:54,422 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 71 transitions, 416 flow [2022-12-13 00:41:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:54,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:54,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:41:54,423 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-13 00:41:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1394370212, now seen corresponding path program 1 times [2022-12-13 00:41:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271248359] [2022-12-13 00:41:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:54,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:41:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:54,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:41:54,514 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:41:54,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:41:54,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:41:54,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:41:54,518 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:54,521 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:41:54,522 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:41:54,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:41:54 BasicIcfg [2022-12-13 00:41:54,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:41:54,582 INFO L158 Benchmark]: Toolchain (without parser) took 103865.23ms. Allocated memory was 176.2MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 151.8MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 00:41:54,582 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:41:54,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.99ms. Allocated memory is still 176.2MB. Free memory was 151.8MB in the beginning and 122.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:41:54,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.60ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 119.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:54,583 INFO L158 Benchmark]: Boogie Preprocessor took 55.16ms. Allocated memory is still 176.2MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:54,583 INFO L158 Benchmark]: RCFGBuilder took 634.61ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 77.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-12-13 00:41:54,583 INFO L158 Benchmark]: TraceAbstraction took 102640.20ms. Allocated memory was 176.2MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 76.8MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 00:41:54,584 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.14ms. Allocated memory is still 176.2MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.99ms. Allocated memory is still 176.2MB. Free memory was 151.8MB in the beginning and 122.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.60ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 119.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.16ms. Allocated memory is still 176.2MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 634.61ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 77.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 102640.20ms. Allocated memory was 176.2MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 76.8MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 134 PlacesBefore, 78 PlacesAfterwards, 123 TransitionsBefore, 66 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5051, independent: 4899, independent conditional: 4899, independent unconditional: 0, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5051, independent: 4899, independent conditional: 0, independent unconditional: 4899, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5051, independent: 4899, independent conditional: 0, independent unconditional: 4899, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5051, independent: 4899, independent conditional: 0, independent unconditional: 4899, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2518, independent: 2451, independent conditional: 0, independent unconditional: 2451, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2518, independent: 2403, independent conditional: 0, independent unconditional: 2403, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 412, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5051, independent: 2448, independent conditional: 0, independent unconditional: 2448, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 2518, unknown conditional: 0, unknown unconditional: 2518] , Statistics on independence cache: Total cache size (in pairs): 4499, Positive cache size: 4432, Positive conditional cache size: 0, Positive unconditional cache size: 4432, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, 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.3s, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 488, independent: 446, independent conditional: 446, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 488, independent: 446, independent conditional: 14, independent unconditional: 432, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 488, independent: 446, independent conditional: 14, independent unconditional: 432, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 488, independent: 446, independent conditional: 14, independent unconditional: 432, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 394, independent: 363, independent conditional: 13, independent unconditional: 350, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 394, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 247, dependent conditional: 20, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 488, independent: 83, independent conditional: 1, independent unconditional: 82, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 394, unknown conditional: 16, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 363, Positive conditional cache size: 13, Positive unconditional cache size: 350, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, 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, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 473, independent: 440, independent conditional: 440, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 473, independent: 440, independent conditional: 32, independent unconditional: 408, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 473, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 473, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 473, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 437, Positive conditional cache size: 13, Positive unconditional cache size: 424, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, 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.0s, 53 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 453, independent: 421, independent conditional: 421, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 453, independent: 421, independent conditional: 47, independent unconditional: 374, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 453, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 453, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 453, independent: 416, independent conditional: 0, independent unconditional: 416, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 442, Positive conditional cache size: 13, Positive unconditional cache size: 429, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 276, independent conditional: 94, independent unconditional: 182, dependent: 14, dependent conditional: 12, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 276, independent conditional: 36, independent unconditional: 240, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 276, independent conditional: 36, independent unconditional: 240, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 276, independent conditional: 36, independent unconditional: 240, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 442, Positive conditional cache size: 13, Positive unconditional cache size: 429, Negative cache size: 39, Negative conditional cache size: 6, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 283, independent conditional: 109, independent unconditional: 174, dependent: 19, dependent conditional: 16, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 314, independent: 283, independent conditional: 54, independent unconditional: 229, dependent: 31, dependent conditional: 16, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 314, independent: 283, independent conditional: 54, independent unconditional: 229, dependent: 31, dependent conditional: 16, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, independent: 280, independent conditional: 54, independent unconditional: 226, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 445, Positive conditional cache size: 13, Positive unconditional cache size: 432, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 267, independent conditional: 267, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 267, independent conditional: 93, independent unconditional: 174, dependent: 19, dependent conditional: 16, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 267, independent conditional: 56, independent unconditional: 211, dependent: 25, dependent conditional: 16, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 267, independent conditional: 56, independent unconditional: 211, dependent: 25, dependent conditional: 16, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 292, independent: 267, independent conditional: 56, independent unconditional: 211, dependent: 25, dependent conditional: 16, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 445, Positive conditional cache size: 13, Positive unconditional cache size: 432, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 72 PlacesBefore, 71 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1552, independent: 1520, independent conditional: 1520, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1552, independent: 1520, independent conditional: 1040, independent unconditional: 480, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1552, independent: 1520, independent conditional: 708, independent unconditional: 812, dependent: 32, dependent conditional: 20, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1552, independent: 1520, independent conditional: 708, independent unconditional: 812, dependent: 32, dependent conditional: 20, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 10, independent unconditional: 4, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1552, independent: 1506, independent conditional: 698, independent unconditional: 808, dependent: 30, dependent conditional: 18, dependent unconditional: 12, unknown: 16, unknown conditional: 12, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 511, Positive conditional cache size: 23, Positive unconditional cache size: 488, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 344, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 75 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 2358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1060, independent: 1030, independent conditional: 1030, 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: 1060, independent: 1030, independent conditional: 477, independent unconditional: 553, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1060, independent: 1030, independent conditional: 277, independent unconditional: 753, dependent: 30, dependent conditional: 16, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1060, independent: 1030, independent conditional: 277, independent unconditional: 753, dependent: 30, dependent conditional: 16, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 1060, independent: 1022, independent conditional: 275, independent unconditional: 747, dependent: 30, dependent conditional: 16, dependent unconditional: 14, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 528, Positive conditional cache size: 25, Positive unconditional cache size: 503, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 214, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 82 PlacesBefore, 81 PlacesAfterwards, 116 TransitionsBefore, 115 TransitionsAfterwards, 3510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1707, independent: 1679, independent conditional: 1679, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1707, independent: 1679, independent conditional: 1203, independent unconditional: 476, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1707, independent: 1679, independent conditional: 915, independent unconditional: 764, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1707, independent: 1679, independent conditional: 915, independent unconditional: 764, dependent: 28, dependent conditional: 14, dependent unconditional: 14, 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: 1707, independent: 1679, independent conditional: 915, independent unconditional: 764, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 641, Positive cache size: 596, Positive conditional cache size: 25, Positive unconditional cache size: 571, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 302, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 3298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 419, independent conditional: 419, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 432, independent: 419, independent conditional: 254, independent unconditional: 165, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 432, independent: 419, independent conditional: 188, independent unconditional: 231, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 432, independent: 419, independent conditional: 188, independent unconditional: 231, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 432, independent: 419, independent conditional: 188, independent unconditional: 231, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 641, Positive cache size: 596, Positive conditional cache size: 25, Positive unconditional cache size: 571, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 73, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 89 PlacesBefore, 83 PlacesAfterwards, 97 TransitionsBefore, 87 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 280, independent conditional: 280, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 292, independent: 280, independent conditional: 228, independent unconditional: 52, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 280, independent conditional: 206, independent unconditional: 74, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 280, independent conditional: 206, independent unconditional: 74, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 42, independent unconditional: 15, 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: 57, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 292, independent: 223, independent conditional: 164, independent unconditional: 59, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 57, unknown conditional: 42, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 691, Positive conditional cache size: 69, Positive unconditional cache size: 622, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 68 PlacesBefore, 66 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 115, independent: 109, independent conditional: 93, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 109, independent conditional: 85, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 109, independent conditional: 85, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 115, independent: 106, independent conditional: 84, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 758, Positive conditional cache size: 70, Positive unconditional cache size: 688, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 66 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 42, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 814, Positive conditional cache size: 70, Positive unconditional cache size: 744, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 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; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t825, ((void *)0), P0, ((void *)0))=-3, t825={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] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t826, ((void *)0), P1, ((void *)0))=-2, t825={5:0}, t826={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] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t827, ((void *)0), P2, ((void *)0))=-1, t825={5:0}, t826={6:0}, t827={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] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t828, ((void *)0), P3, ((void *)0))=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={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 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, 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_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, 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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=1, 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 = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L830] 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) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 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_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=2, y=2, 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] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 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 [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 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 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, 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: 859]: 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: 853]: 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: 857]: 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: 855]: 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, 162 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: 102.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 71.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 594 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 23 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1188occurred in iteration=10, InterpolantAutomatonStates: 62, 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.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:41:54,603 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...