/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:10,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:10,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:10,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:10,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:10,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:10,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:10,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:10,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:10,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:10,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:10,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:10,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:10,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:10,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:10,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:10,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:10,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:10,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:10,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:10,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:10,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:10,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:10,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:10,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:10,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:10,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:10,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:10,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:10,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:10,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:10,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:10,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:10,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:10,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:10,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:10,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:10,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:10,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:10,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:10,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:10,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:10,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:10,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:10,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:10,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:10,228 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:10,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:10,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:10,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:10,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:10,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:10,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:10,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:10,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:10,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:10,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:10,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:09:10,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:10,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:10,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:10,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:10,526 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:10,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-12-06 04:09:11,523 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:11,761 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:11,762 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-12-06 04:09:11,777 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053a1f9ee/5607a8e93ff14d6f9d42a98bd9c1ca0a/FLAG6d04f86be [2022-12-06 04:09:11,793 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053a1f9ee/5607a8e93ff14d6f9d42a98bd9c1ca0a [2022-12-06 04:09:11,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:11,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:11,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:11,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:11,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:11,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:11" (1/1) ... [2022-12-06 04:09:11,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5926270a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:11, skipping insertion in model container [2022-12-06 04:09:11,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:11" (1/1) ... [2022-12-06 04:09:11,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:11,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:12,000 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/mix018_tso.oepc.i[949,962] [2022-12-06 04:09:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:12,263 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:12,272 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/mix018_tso.oepc.i[949,962] [2022-12-06 04:09:12,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:12,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:12,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:12,362 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:12,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12 WrapperNode [2022-12-06 04:09:12,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:12,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:12,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:12,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:12,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,441 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-06 04:09:12,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:12,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:12,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:12,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:12,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,469 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:12,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:12,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:12,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:12,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (1/1) ... [2022-12-06 04:09:12,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:12,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:09:12,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:09:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:09:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:09:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:12,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:12,574 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:09:12,667 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:12,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:12,999 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:13,081 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:13,081 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:13,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:13 BoogieIcfgContainer [2022-12-06 04:09:13,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:13,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:13,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:13,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:13,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:11" (1/3) ... [2022-12-06 04:09:13,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e90baae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:13, skipping insertion in model container [2022-12-06 04:09:13,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:12" (2/3) ... [2022-12-06 04:09:13,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e90baae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:13, skipping insertion in model container [2022-12-06 04:09:13,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:13" (3/3) ... [2022-12-06 04:09:13,088 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2022-12-06 04:09:13,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:13,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:13,102 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:13,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:13,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:09:13,223 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:09:13,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:13,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:09:13,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:09:13,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:13,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:13,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:13,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:13,264 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:09:13,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:13,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:09:13,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:13,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-06 04:09:18,706 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:09:18,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:18,723 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;@79ce8e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:18,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:09:18,725 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:09:18,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:18,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:18,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:09:18,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 520609042, now seen corresponding path program 1 times [2022-12-06 04:09:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:18,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983143059] [2022-12-06 04:09:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:19,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983143059] [2022-12-06 04:09:19,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983143059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:19,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:19,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132575395] [2022-12-06 04:09:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:19,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:19,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 04:09:19,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:19,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:19,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 04:09:19,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:19,876 INFO L130 PetriNetUnfolder]: 4863/6914 cut-off events. [2022-12-06 04:09:19,876 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:09:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13738 conditions, 6914 events. 4863/6914 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 37637 event pairs, 1320 based on Foata normal form. 0/6253 useless extension candidates. Maximal degree in co-relation 13726. Up to 5308 conditions per place. [2022-12-06 04:09:19,914 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 2 changer transitions 8/52 dead transitions. [2022-12-06 04:09:19,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 216 flow [2022-12-06 04:09:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 04:09:19,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 04:09:19,926 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-06 04:09:19,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 216 flow [2022-12-06 04:09:19,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:19,932 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-06 04:09:19,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 04:09:19,937 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:09:19,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:19,937 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 68 flow [2022-12-06 04:09:19,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:19,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:19,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 68 flow [2022-12-06 04:09:19,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:19,956 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:09:19,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:19,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:19,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:19,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 04:09:20,021 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:20,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 04:09:20,023 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:20,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:20,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:20,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1771569732, now seen corresponding path program 1 times [2022-12-06 04:09:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:20,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242138676] [2022-12-06 04:09:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:20,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:20,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242138676] [2022-12-06 04:09:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242138676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:20,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780448817] [2022-12-06 04:09:20,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:20,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:09:20,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:20,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:20,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:09:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:21,404 INFO L130 PetriNetUnfolder]: 8789/11850 cut-off events. [2022-12-06 04:09:21,404 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-12-06 04:09:21,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24626 conditions, 11850 events. 8789/11850 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 53292 event pairs, 2989 based on Foata normal form. 250/12100 useless extension candidates. Maximal degree in co-relation 24616. Up to 8176 conditions per place. [2022-12-06 04:09:21,489 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 40 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 04:09:21,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 182 flow [2022-12-06 04:09:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:09:21,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 04:09:21,505 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:09:21,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 182 flow [2022-12-06 04:09:21,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:21,507 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:21,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 04:09:21,507 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 04:09:21,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:21,508 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:21,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:21,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:21,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:21,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:21,512 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:09:21,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:09:21,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 04:09:21,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 04:09:21,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:21,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 04:09:21,553 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 04:09:21,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:21,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:21,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:21,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:21,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash -915547529, now seen corresponding path program 1 times [2022-12-06 04:09:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:21,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337789240] [2022-12-06 04:09:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337789240] [2022-12-06 04:09:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337789240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:21,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029778275] [2022-12-06 04:09:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:21,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:21,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:09:21,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:21,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:21,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:09:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:23,119 INFO L130 PetriNetUnfolder]: 7742/10465 cut-off events. [2022-12-06 04:09:23,120 INFO L131 PetriNetUnfolder]: For 889/889 co-relation queries the response was YES. [2022-12-06 04:09:23,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22485 conditions, 10465 events. 7742/10465 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 50527 event pairs, 1089 based on Foata normal form. 60/10525 useless extension candidates. Maximal degree in co-relation 22474. Up to 9814 conditions per place. [2022-12-06 04:09:23,173 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 53 selfloop transitions, 11 changer transitions 0/64 dead transitions. [2022-12-06 04:09:23,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 290 flow [2022-12-06 04:09:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:09:23,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:09:23,177 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:09:23,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 290 flow [2022-12-06 04:09:23,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:23,181 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 143 flow [2022-12-06 04:09:23,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 04:09:23,183 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2022-12-06 04:09:23,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:23,183 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 143 flow [2022-12-06 04:09:23,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:23,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:23,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 143 flow [2022-12-06 04:09:23,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 143 flow [2022-12-06 04:09:23,273 INFO L130 PetriNetUnfolder]: 348/620 cut-off events. [2022-12-06 04:09:23,273 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 04:09:23,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 620 events. 348/620 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3177 event pairs, 250 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 1404. Up to 492 conditions per place. [2022-12-06 04:09:23,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 143 flow [2022-12-06 04:09:23,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:09:23,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [403] L829-->L836: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse2)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5))) (and (= v_~x$w_buff1_used~0_126 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$r_buff0_thd4~0_21 (ite .cse1 0 v_~x$r_buff0_thd4~0_22)) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_58 (ite .cse0 v_~x$w_buff1~0_55 v_~x~0_82))) (= (ite .cse4 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 04:09:23,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [394] L803-->L806: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 04:09:23,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [468] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_239 256) 0)) (not (= (mod v_~x$w_buff1_used~0_205 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_66 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff0_thd2~0_64 1) (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_205) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:09:23,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [527] $Ultimate##0-->L826: Formula: (and (= v_P3Thread1of1ForFork1_~arg.offset_15 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_15 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z~0_47 1) (= v_~z~0_47 v_~__unbuffered_p3_EAX~0_88)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_88, ~z~0=v_~z~0_47, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_15, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-06 04:09:23,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [395] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_52)) v_~x~0_51) (= (ite .cse0 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_100 256) 0)))) 0 v_~x$r_buff1_thd3~0_22) v_~x$r_buff1_thd3~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:09:23,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [352] L865-->L871: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_58 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_60 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_140 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= 0 (mod v_~x$w_buff1_used~0_119 256))) .cse4))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_60) v_~x$r_buff0_thd0~0_59) (= v_~x~0_73 (ite .cse1 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_51 v_~x~0_74))) (= (ite .cse1 0 v_~x$w_buff0_used~0_140) v_~x$w_buff0_used~0_139) (= v_~x$r_buff1_thd0~0_57 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_118 256) 0)))) 0 v_~x$r_buff1_thd0~0_58)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_119) v_~x$w_buff1_used~0_118)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_119, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_140} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_118, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_57, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_139} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:09:23,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [402] L826-->L829: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] [2022-12-06 04:09:23,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:23,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 04:09:23,891 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 167 flow [2022-12-06 04:09:23,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:23,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:23,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:23,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:23,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1676540801, now seen corresponding path program 1 times [2022-12-06 04:09:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:23,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139232158] [2022-12-06 04:09:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139232158] [2022-12-06 04:09:24,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139232158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:24,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:24,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229769367] [2022-12-06 04:09:24,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:24,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:24,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:24,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:24,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:24,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:24,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:25,207 INFO L130 PetriNetUnfolder]: 5842/8263 cut-off events. [2022-12-06 04:09:25,207 INFO L131 PetriNetUnfolder]: For 5223/5678 co-relation queries the response was YES. [2022-12-06 04:09:25,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22419 conditions, 8263 events. 5842/8263 cut-off events. For 5223/5678 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 44952 event pairs, 1080 based on Foata normal form. 124/7997 useless extension candidates. Maximal degree in co-relation 22406. Up to 6802 conditions per place. [2022-12-06 04:09:25,254 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 49 selfloop transitions, 14 changer transitions 0/66 dead transitions. [2022-12-06 04:09:25,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 383 flow [2022-12-06 04:09:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 04:09:25,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 04:09:25,257 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 167 flow. Second operand 4 states and 76 transitions. [2022-12-06 04:09:25,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 383 flow [2022-12-06 04:09:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:09:25,261 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-06 04:09:25,263 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-12-06 04:09:25,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:25,263 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:25,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:25,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,356 INFO L130 PetriNetUnfolder]: 572/969 cut-off events. [2022-12-06 04:09:25,356 INFO L131 PetriNetUnfolder]: For 893/921 co-relation queries the response was YES. [2022-12-06 04:09:25,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 969 events. 572/969 cut-off events. For 893/921 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5291 event pairs, 356 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 2697. Up to 658 conditions per place. [2022-12-06 04:09:25,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 04:09:25,376 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:25,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 04:09:25,382 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 224 flow [2022-12-06 04:09:25,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:25,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:25,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:25,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2143219843, now seen corresponding path program 1 times [2022-12-06 04:09:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667073121] [2022-12-06 04:09:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:25,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667073121] [2022-12-06 04:09:25,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667073121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:25,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:25,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183284938] [2022-12-06 04:09:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:25,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:25,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:25,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:25,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:25,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:25,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:26,513 INFO L130 PetriNetUnfolder]: 5897/8401 cut-off events. [2022-12-06 04:09:26,513 INFO L131 PetriNetUnfolder]: For 9524/10070 co-relation queries the response was YES. [2022-12-06 04:09:26,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25815 conditions, 8401 events. 5897/8401 cut-off events. For 9524/10070 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 45997 event pairs, 1143 based on Foata normal form. 186/8284 useless extension candidates. Maximal degree in co-relation 25799. Up to 6342 conditions per place. [2022-12-06 04:09:26,565 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 53 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2022-12-06 04:09:26,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 456 flow [2022-12-06 04:09:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 04:09:26,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 04:09:26,566 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 224 flow. Second operand 4 states and 73 transitions. [2022-12-06 04:09:26,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 456 flow [2022-12-06 04:09:26,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:26,571 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-06 04:09:26,572 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-06 04:09:26,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:26,572 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:26,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:26,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,662 INFO L130 PetriNetUnfolder]: 580/984 cut-off events. [2022-12-06 04:09:26,663 INFO L131 PetriNetUnfolder]: For 1237/1265 co-relation queries the response was YES. [2022-12-06 04:09:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 984 events. 580/984 cut-off events. For 1237/1265 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5394 event pairs, 352 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 3045. Up to 662 conditions per place. [2022-12-06 04:09:26,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 04:09:26,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:26,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 04:09:26,679 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 259 flow [2022-12-06 04:09:26,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:26,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:26,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:26,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:26,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1392686532, now seen corresponding path program 1 times [2022-12-06 04:09:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201776708] [2022-12-06 04:09:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:27,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201776708] [2022-12-06 04:09:27,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201776708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:27,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:27,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229995684] [2022-12-06 04:09:27,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:27,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:27,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:27,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:27,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:27,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:27,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:27,912 INFO L130 PetriNetUnfolder]: 5731/8127 cut-off events. [2022-12-06 04:09:27,912 INFO L131 PetriNetUnfolder]: For 13521/14069 co-relation queries the response was YES. [2022-12-06 04:09:27,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26791 conditions, 8127 events. 5731/8127 cut-off events. For 13521/14069 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 44477 event pairs, 740 based on Foata normal form. 218/8008 useless extension candidates. Maximal degree in co-relation 26774. Up to 6243 conditions per place. [2022-12-06 04:09:27,967 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 58 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2022-12-06 04:09:27,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 505 flow [2022-12-06 04:09:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 04:09:27,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:09:27,970 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 259 flow. Second operand 4 states and 75 transitions. [2022-12-06 04:09:27,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 505 flow [2022-12-06 04:09:27,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 494 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:27,986 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:27,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-06 04:09:27,988 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-06 04:09:27,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:27,989 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:27,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:27,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:27,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:27,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:28,086 INFO L130 PetriNetUnfolder]: 559/947 cut-off events. [2022-12-06 04:09:28,086 INFO L131 PetriNetUnfolder]: For 2131/2162 co-relation queries the response was YES. [2022-12-06 04:09:28,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 947 events. 559/947 cut-off events. For 2131/2162 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5144 event pairs, 332 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 3066. Up to 636 conditions per place. [2022-12-06 04:09:28,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:28,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 04:09:28,103 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:28,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 04:09:28,104 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 283 flow [2022-12-06 04:09:28,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:28,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:28,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:28,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:28,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2015131951, now seen corresponding path program 1 times [2022-12-06 04:09:28,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:28,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121283523] [2022-12-06 04:09:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:28,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121283523] [2022-12-06 04:09:28,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121283523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:28,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417157539] [2022-12-06 04:09:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:28,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:28,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:28,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:28,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:29,156 INFO L130 PetriNetUnfolder]: 6002/8529 cut-off events. [2022-12-06 04:09:29,157 INFO L131 PetriNetUnfolder]: For 18169/18709 co-relation queries the response was YES. [2022-12-06 04:09:29,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28642 conditions, 8529 events. 6002/8529 cut-off events. For 18169/18709 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 46494 event pairs, 1258 based on Foata normal form. 194/8458 useless extension candidates. Maximal degree in co-relation 28623. Up to 6430 conditions per place. [2022-12-06 04:09:29,211 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 60 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2022-12-06 04:09:29,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 533 flow [2022-12-06 04:09:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 04:09:29,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-06 04:09:29,212 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 283 flow. Second operand 4 states and 74 transitions. [2022-12-06 04:09:29,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 533 flow [2022-12-06 04:09:29,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 506 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:29,221 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-06 04:09:29,221 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2022-12-06 04:09:29,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:29,222 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:29,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:29,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,312 INFO L130 PetriNetUnfolder]: 697/1140 cut-off events. [2022-12-06 04:09:29,312 INFO L131 PetriNetUnfolder]: For 2920/3002 co-relation queries the response was YES. [2022-12-06 04:09:29,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1140 events. 697/1140 cut-off events. For 2920/3002 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6165 event pairs, 348 based on Foata normal form. 1/1089 useless extension candidates. Maximal degree in co-relation 4124. Up to 787 conditions per place. [2022-12-06 04:09:29,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-06 04:09:29,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:29,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 04:09:29,332 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 324 flow [2022-12-06 04:09:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:29,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:29,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:29,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2015297491, now seen corresponding path program 2 times [2022-12-06 04:09:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473894803] [2022-12-06 04:09:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:29,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473894803] [2022-12-06 04:09:29,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473894803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:29,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:29,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868481390] [2022-12-06 04:09:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:29,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:29,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:29,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:29,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:29,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:29,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:30,510 INFO L130 PetriNetUnfolder]: 6086/8646 cut-off events. [2022-12-06 04:09:30,510 INFO L131 PetriNetUnfolder]: For 23917/24488 co-relation queries the response was YES. [2022-12-06 04:09:30,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31737 conditions, 8646 events. 6086/8646 cut-off events. For 23917/24488 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 47150 event pairs, 1269 based on Foata normal form. 208/8569 useless extension candidates. Maximal degree in co-relation 31718. Up to 6489 conditions per place. [2022-12-06 04:09:30,553 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 61 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2022-12-06 04:09:30,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 594 flow [2022-12-06 04:09:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 04:09:30,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-06 04:09:30,554 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 324 flow. Second operand 4 states and 74 transitions. [2022-12-06 04:09:30,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 594 flow [2022-12-06 04:09:30,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 568 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:30,572 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 04:09:30,573 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-06 04:09:30,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:30,573 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:30,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:30,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,659 INFO L130 PetriNetUnfolder]: 701/1165 cut-off events. [2022-12-06 04:09:30,659 INFO L131 PetriNetUnfolder]: For 3698/3782 co-relation queries the response was YES. [2022-12-06 04:09:30,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1165 events. 701/1165 cut-off events. For 3698/3782 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6447 event pairs, 318 based on Foata normal form. 6/1119 useless extension candidates. Maximal degree in co-relation 4634. Up to 787 conditions per place. [2022-12-06 04:09:30,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-06 04:09:30,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:30,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 04:09:30,679 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 377 flow [2022-12-06 04:09:30,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:30,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:30,680 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2015304931, now seen corresponding path program 1 times [2022-12-06 04:09:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:30,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152928616] [2022-12-06 04:09:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152928616] [2022-12-06 04:09:31,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152928616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:31,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:31,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:31,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546126170] [2022-12-06 04:09:31,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:31,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:31,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:31,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:31,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:31,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:31,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:32,047 INFO L130 PetriNetUnfolder]: 6620/9432 cut-off events. [2022-12-06 04:09:32,047 INFO L131 PetriNetUnfolder]: For 36103/36764 co-relation queries the response was YES. [2022-12-06 04:09:32,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37077 conditions, 9432 events. 6620/9432 cut-off events. For 36103/36764 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 53121 event pairs, 944 based on Foata normal form. 255/9328 useless extension candidates. Maximal degree in co-relation 37057. Up to 6653 conditions per place. [2022-12-06 04:09:32,100 INFO L137 encePairwiseOnDemand]: 19/35 looper letters, 72 selfloop transitions, 22 changer transitions 0/97 dead transitions. [2022-12-06 04:09:32,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 770 flow [2022-12-06 04:09:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 04:09:32,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2022-12-06 04:09:32,102 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 377 flow. Second operand 5 states and 93 transitions. [2022-12-06 04:09:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 770 flow [2022-12-06 04:09:32,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 741 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:32,133 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-12-06 04:09:32,134 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2022-12-06 04:09:32,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:32,134 INFO L89 Accepts]: Start accepts. Operand has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:32,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:32,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,239 INFO L130 PetriNetUnfolder]: 787/1299 cut-off events. [2022-12-06 04:09:32,239 INFO L131 PetriNetUnfolder]: For 6022/6204 co-relation queries the response was YES. [2022-12-06 04:09:32,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5950 conditions, 1299 events. 787/1299 cut-off events. For 6022/6204 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7216 event pairs, 310 based on Foata normal form. 42/1288 useless extension candidates. Maximal degree in co-relation 5932. Up to 876 conditions per place. [2022-12-06 04:09:32,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-06 04:09:32,261 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:32,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 04:09:32,262 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 465 flow [2022-12-06 04:09:32,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:32,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:32,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:32,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:32,262 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2015357073, now seen corresponding path program 1 times [2022-12-06 04:09:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:32,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227270827] [2022-12-06 04:09:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:32,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227270827] [2022-12-06 04:09:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227270827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:32,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:32,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905770764] [2022-12-06 04:09:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:32,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 04:09:32,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 465 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:32,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:32,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 04:09:32,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:34,192 INFO L130 PetriNetUnfolder]: 10441/14042 cut-off events. [2022-12-06 04:09:34,192 INFO L131 PetriNetUnfolder]: For 45010/45010 co-relation queries the response was YES. [2022-12-06 04:09:34,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57118 conditions, 14042 events. 10441/14042 cut-off events. For 45010/45010 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 68060 event pairs, 1790 based on Foata normal form. 24/14066 useless extension candidates. Maximal degree in co-relation 57097. Up to 11635 conditions per place. [2022-12-06 04:09:34,292 INFO L137 encePairwiseOnDemand]: 18/35 looper letters, 98 selfloop transitions, 43 changer transitions 0/141 dead transitions. [2022-12-06 04:09:34,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 141 transitions, 1220 flow [2022-12-06 04:09:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-06 04:09:34,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-06 04:09:34,294 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 465 flow. Second operand 7 states and 115 transitions. [2022-12-06 04:09:34,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 141 transitions, 1220 flow [2022-12-06 04:09:34,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 141 transitions, 1148 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:34,375 INFO L231 Difference]: Finished difference. Result has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=63, PETRI_TRANSITIONS=86} [2022-12-06 04:09:34,376 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-06 04:09:34,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:34,376 INFO L89 Accepts]: Start accepts. Operand has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:34,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:34,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,529 INFO L130 PetriNetUnfolder]: 1137/1796 cut-off events. [2022-12-06 04:09:34,530 INFO L131 PetriNetUnfolder]: For 10273/10649 co-relation queries the response was YES. [2022-12-06 04:09:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9569 conditions, 1796 events. 1137/1796 cut-off events. For 10273/10649 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 9984 event pairs, 295 based on Foata normal form. 38/1729 useless extension candidates. Maximal degree in co-relation 9547. Up to 1282 conditions per place. [2022-12-06 04:09:34,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-06 04:09:34,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:34,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 04:09:34,560 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 86 transitions, 848 flow [2022-12-06 04:09:34,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:34,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:34,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:34,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:34,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1944728348, now seen corresponding path program 1 times [2022-12-06 04:09:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757753757] [2022-12-06 04:09:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:35,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757753757] [2022-12-06 04:09:35,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757753757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:35,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:35,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023060624] [2022-12-06 04:09:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:35,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:35,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:35,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 86 transitions, 848 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:35,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:35,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:36,263 INFO L130 PetriNetUnfolder]: 8358/11886 cut-off events. [2022-12-06 04:09:36,263 INFO L131 PetriNetUnfolder]: For 75999/77276 co-relation queries the response was YES. [2022-12-06 04:09:36,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57776 conditions, 11886 events. 8358/11886 cut-off events. For 75999/77276 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 66683 event pairs, 1675 based on Foata normal form. 654/12248 useless extension candidates. Maximal degree in co-relation 57751. Up to 7512 conditions per place. [2022-12-06 04:09:36,381 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 77 selfloop transitions, 47 changer transitions 0/130 dead transitions. [2022-12-06 04:09:36,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 1357 flow [2022-12-06 04:09:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 04:09:36,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 04:09:36,382 INFO L175 Difference]: Start difference. First operand has 63 places, 86 transitions, 848 flow. Second operand 5 states and 95 transitions. [2022-12-06 04:09:36,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 1357 flow [2022-12-06 04:09:36,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 1301 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-12-06 04:09:36,477 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=991, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2022-12-06 04:09:36,477 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2022-12-06 04:09:36,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:36,477 INFO L89 Accepts]: Start accepts. Operand has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:36,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:36,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,644 INFO L130 PetriNetUnfolder]: 1180/1888 cut-off events. [2022-12-06 04:09:36,644 INFO L131 PetriNetUnfolder]: For 14782/15203 co-relation queries the response was YES. [2022-12-06 04:09:36,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11310 conditions, 1888 events. 1180/1888 cut-off events. For 14782/15203 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 10818 event pairs, 338 based on Foata normal form. 111/1922 useless extension candidates. Maximal degree in co-relation 11285. Up to 1336 conditions per place. [2022-12-06 04:09:36,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-06 04:09:36,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:36,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 04:09:36,677 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 90 transitions, 991 flow [2022-12-06 04:09:36,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:36,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:36,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:36,677 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1947583479, now seen corresponding path program 1 times [2022-12-06 04:09:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884029231] [2022-12-06 04:09:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:37,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884029231] [2022-12-06 04:09:37,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884029231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:37,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:37,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280455312] [2022-12-06 04:09:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:37,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:37,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:09:37,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 991 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:37,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:37,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:09:37,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:38,541 INFO L130 PetriNetUnfolder]: 8761/12477 cut-off events. [2022-12-06 04:09:38,541 INFO L131 PetriNetUnfolder]: For 101914/103621 co-relation queries the response was YES. [2022-12-06 04:09:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66331 conditions, 12477 events. 8761/12477 cut-off events. For 101914/103621 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 71022 event pairs, 1805 based on Foata normal form. 846/13006 useless extension candidates. Maximal degree in co-relation 66303. Up to 6997 conditions per place. [2022-12-06 04:09:38,628 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 81 selfloop transitions, 32 changer transitions 0/119 dead transitions. [2022-12-06 04:09:38,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 119 transitions, 1397 flow [2022-12-06 04:09:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 04:09:38,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:09:38,629 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 991 flow. Second operand 4 states and 77 transitions. [2022-12-06 04:09:38,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 119 transitions, 1397 flow [2022-12-06 04:09:38,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1272 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:38,749 INFO L231 Difference]: Finished difference. Result has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1031, PETRI_PLACES=69, PETRI_TRANSITIONS=93} [2022-12-06 04:09:38,749 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-06 04:09:38,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:38,749 INFO L89 Accepts]: Start accepts. Operand has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:38,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:38,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,913 INFO L130 PetriNetUnfolder]: 1180/1922 cut-off events. [2022-12-06 04:09:38,913 INFO L131 PetriNetUnfolder]: For 12629/13031 co-relation queries the response was YES. [2022-12-06 04:09:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 1922 events. 1180/1922 cut-off events. For 12629/13031 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11354 event pairs, 341 based on Foata normal form. 151/1997 useless extension candidates. Maximal degree in co-relation 10718. Up to 1342 conditions per place. [2022-12-06 04:09:38,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 04:09:38,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:38,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 04:09:38,945 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 93 transitions, 1031 flow [2022-12-06 04:09:38,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:38,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:38,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:38,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1112203584, now seen corresponding path program 1 times [2022-12-06 04:09:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315041885] [2022-12-06 04:09:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:39,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:39,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315041885] [2022-12-06 04:09:39,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315041885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:39,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:39,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206339818] [2022-12-06 04:09:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:39,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:39,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 04:09:39,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 93 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:39,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:39,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 04:09:39,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:39,770 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_155 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_135 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_156 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_64 (ite .cse1 v_~x$w_buff1~0_61 v_~x~0_90)) v_~x~0_89) (= v_~x$w_buff1_used~0_134 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_135)) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_155 (ite .cse0 0 v_~x$w_buff0_used~0_156)) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_134 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)))) 0 v_~x$r_buff1_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_135, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][96], [Black: 192#(and (= 0 ~x$w_buff1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 240#true, 33#P3EXITtrue, Black: 197#(and (= ~x$w_buff1_used~0 0) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 204#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork3InUse, 208#true, Black: 211#(and (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 213#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 103#L871true, Black: 215#(and (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= ~x$r_buff0_thd0~0 0)), Black: 212#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (not (= ~x~0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 0)), Black: 154#(<= ~__unbuffered_p3_EAX~0 0), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 159#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), Black: 224#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (not (= ~x~0 ~x$w_buff0~0)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x~0 ~x$w_buff1~0)), 234#(and (= 0 ~x$w_buff1~0) (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (not (= ~x~0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 0) (not (<= (+ (div ~x$r_buff1_thd1~0 256) 1) 0)) (<= ~x$r_buff0_thd1~0 (* (div ~x$r_buff0_thd1~0 256) 256)) (<= 0 ~x$r_buff0_thd1~0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), 97#L786true, 5#L763true, Black: 176#(and (= 0 ~x$w_buff1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 4#L806true, Black: 186#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1))]) [2022-12-06 04:09:39,770 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 04:09:39,770 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 04:09:39,770 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 04:09:39,770 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 04:09:39,891 INFO L130 PetriNetUnfolder]: 5578/8122 cut-off events. [2022-12-06 04:09:39,891 INFO L131 PetriNetUnfolder]: For 65622/66187 co-relation queries the response was YES. [2022-12-06 04:09:39,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42887 conditions, 8122 events. 5578/8122 cut-off events. For 65622/66187 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 45204 event pairs, 1235 based on Foata normal form. 359/8101 useless extension candidates. Maximal degree in co-relation 42858. Up to 6258 conditions per place. [2022-12-06 04:09:39,972 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 129 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2022-12-06 04:09:39,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 142 transitions, 1879 flow [2022-12-06 04:09:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 04:09:39,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-06 04:09:39,974 INFO L175 Difference]: Start difference. First operand has 69 places, 93 transitions, 1031 flow. Second operand 3 states and 69 transitions. [2022-12-06 04:09:39,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 142 transitions, 1879 flow [2022-12-06 04:09:40,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 142 transitions, 1816 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:40,029 INFO L231 Difference]: Finished difference. Result has 70 places, 94 transitions, 1003 flow [2022-12-06 04:09:40,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1003, PETRI_PLACES=70, PETRI_TRANSITIONS=94} [2022-12-06 04:09:40,030 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2022-12-06 04:09:40,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:40,030 INFO L89 Accepts]: Start accepts. Operand has 70 places, 94 transitions, 1003 flow [2022-12-06 04:09:40,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:40,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:40,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 94 transitions, 1003 flow [2022-12-06 04:09:40,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 94 transitions, 1003 flow [2022-12-06 04:09:40,524 INFO L130 PetriNetUnfolder]: 1627/2815 cut-off events. [2022-12-06 04:09:40,524 INFO L131 PetriNetUnfolder]: For 14314/14874 co-relation queries the response was YES. [2022-12-06 04:09:40,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13713 conditions, 2815 events. 1627/2815 cut-off events. For 14314/14874 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 19522 event pairs, 611 based on Foata normal form. 146/2702 useless extension candidates. Maximal degree in co-relation 13686. Up to 1569 conditions per place. [2022-12-06 04:09:40,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 94 transitions, 1003 flow [2022-12-06 04:09:40,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 04:09:40,695 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:40,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 665 [2022-12-06 04:09:40,696 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 94 transitions, 1005 flow [2022-12-06 04:09:40,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:40,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:40,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:40,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:09:40,696 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash 163818932, now seen corresponding path program 1 times [2022-12-06 04:09:40,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:40,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047731437] [2022-12-06 04:09:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047731437] [2022-12-06 04:09:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047731437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442095484] [2022-12-06 04:09:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:40,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:40,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:40,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:09:40,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 94 transitions, 1005 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:40,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:40,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:09:40,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:41,342 INFO L130 PetriNetUnfolder]: 3006/4620 cut-off events. [2022-12-06 04:09:41,342 INFO L131 PetriNetUnfolder]: For 35789/36101 co-relation queries the response was YES. [2022-12-06 04:09:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24872 conditions, 4620 events. 3006/4620 cut-off events. For 35789/36101 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25205 event pairs, 552 based on Foata normal form. 404/4866 useless extension candidates. Maximal degree in co-relation 24842. Up to 1793 conditions per place. [2022-12-06 04:09:41,376 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 149 selfloop transitions, 9 changer transitions 0/166 dead transitions. [2022-12-06 04:09:41,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 166 transitions, 2117 flow [2022-12-06 04:09:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 04:09:41,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 04:09:41,378 INFO L175 Difference]: Start difference. First operand has 70 places, 94 transitions, 1005 flow. Second operand 4 states and 92 transitions. [2022-12-06 04:09:41,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 166 transitions, 2117 flow [2022-12-06 04:09:41,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 166 transitions, 2112 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:41,410 INFO L231 Difference]: Finished difference. Result has 73 places, 89 transitions, 931 flow [2022-12-06 04:09:41,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=931, PETRI_PLACES=73, PETRI_TRANSITIONS=89} [2022-12-06 04:09:41,411 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2022-12-06 04:09:41,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:41,411 INFO L89 Accepts]: Start accepts. Operand has 73 places, 89 transitions, 931 flow [2022-12-06 04:09:41,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:41,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:41,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 89 transitions, 931 flow [2022-12-06 04:09:41,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 89 transitions, 931 flow [2022-12-06 04:09:41,533 INFO L130 PetriNetUnfolder]: 757/1444 cut-off events. [2022-12-06 04:09:41,533 INFO L131 PetriNetUnfolder]: For 7741/8254 co-relation queries the response was YES. [2022-12-06 04:09:41,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 1444 events. 757/1444 cut-off events. For 7741/8254 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9151 event pairs, 216 based on Foata normal form. 125/1484 useless extension candidates. Maximal degree in co-relation 7402. Up to 739 conditions per place. [2022-12-06 04:09:41,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 89 transitions, 931 flow [2022-12-06 04:09:41,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 04:09:41,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] L860-3-->L865: Formula: (and (= (mod v_~main$tmp_guard0~0_52 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|) (= v_~main$tmp_guard0~0_52 (ite (= (ite (= v_~__unbuffered_cnt~0_199 4) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_52, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [534] L753-->L871: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_591 256) 0))) (.cse1 (not (= 0 (mod v_~x$r_buff1_thd0~0_302 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_303 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_592 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_540 256) 0)) .cse1)) (.cse4 (and .cse5 .cse2))) (and (= v_~x$w_buff0_used~0_591 (ite .cse0 0 v_~x$w_buff0_used~0_592)) (= v_~x$r_buff1_thd0~0_301 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_539 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd0~0_302 256) 0)))) 0 v_~x$r_buff1_thd0~0_302)) (= (ite .cse0 v_~x$w_buff0~0_372 (ite .cse3 v_~x$w_buff1~0_342 1)) v_~x~0_490) (= v_~x$r_buff0_thd0~0_302 (ite .cse4 0 v_~x$r_buff0_thd0~0_303)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_540) v_~x$w_buff1_used~0_539)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_372, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_303, ~x$w_buff1~0=v_~x$w_buff1~0_342, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_540, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_592} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_372, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_302, ~x$w_buff1~0=v_~x$w_buff1~0_342, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_301, ~x~0=v_~x~0_490, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_591} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:09:41,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:41,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 04:09:41,761 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 939 flow [2022-12-06 04:09:41,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:41,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:41,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:41,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:09:41,762 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1893899857, now seen corresponding path program 1 times [2022-12-06 04:09:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708453728] [2022-12-06 04:09:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:41,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708453728] [2022-12-06 04:09:41,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708453728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:41,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:41,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882838928] [2022-12-06 04:09:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:41,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:41,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:41,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:09:41,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 939 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:41,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:41,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:09:41,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:42,336 INFO L130 PetriNetUnfolder]: 2362/3627 cut-off events. [2022-12-06 04:09:42,337 INFO L131 PetriNetUnfolder]: For 30372/30610 co-relation queries the response was YES. [2022-12-06 04:09:42,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20051 conditions, 3627 events. 2362/3627 cut-off events. For 30372/30610 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19492 event pairs, 444 based on Foata normal form. 189/3686 useless extension candidates. Maximal degree in co-relation 20019. Up to 1410 conditions per place. [2022-12-06 04:09:42,364 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 154 selfloop transitions, 13 changer transitions 0/175 dead transitions. [2022-12-06 04:09:42,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 175 transitions, 2214 flow [2022-12-06 04:09:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 04:09:42,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:09:42,366 INFO L175 Difference]: Start difference. First operand has 73 places, 89 transitions, 939 flow. Second operand 5 states and 110 transitions. [2022-12-06 04:09:42,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 175 transitions, 2214 flow [2022-12-06 04:09:42,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 175 transitions, 1991 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-12-06 04:09:42,390 INFO L231 Difference]: Finished difference. Result has 71 places, 87 transitions, 821 flow [2022-12-06 04:09:42,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=821, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2022-12-06 04:09:42,391 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2022-12-06 04:09:42,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:42,391 INFO L89 Accepts]: Start accepts. Operand has 71 places, 87 transitions, 821 flow [2022-12-06 04:09:42,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:42,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:42,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 87 transitions, 821 flow [2022-12-06 04:09:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 87 transitions, 821 flow [2022-12-06 04:09:42,463 INFO L130 PetriNetUnfolder]: 481/934 cut-off events. [2022-12-06 04:09:42,463 INFO L131 PetriNetUnfolder]: For 4038/4347 co-relation queries the response was YES. [2022-12-06 04:09:42,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 934 events. 481/934 cut-off events. For 4038/4347 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5417 event pairs, 98 based on Foata normal form. 120/1008 useless extension candidates. Maximal degree in co-relation 4381. Up to 445 conditions per place. [2022-12-06 04:09:42,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 87 transitions, 821 flow [2022-12-06 04:09:42,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 1006 [2022-12-06 04:09:42,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:42,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-06 04:09:42,749 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 833 flow [2022-12-06 04:09:42,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:42,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:42,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:42,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:09:42,750 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 981444622, now seen corresponding path program 1 times [2022-12-06 04:09:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:42,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535435883] [2022-12-06 04:09:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:42,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:42,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535435883] [2022-12-06 04:09:42,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535435883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:42,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:42,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274762076] [2022-12-06 04:09:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:42,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 04:09:42,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 833 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:42,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:42,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 04:09:42,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:43,458 INFO L130 PetriNetUnfolder]: 3441/5298 cut-off events. [2022-12-06 04:09:43,459 INFO L131 PetriNetUnfolder]: For 32600/32994 co-relation queries the response was YES. [2022-12-06 04:09:43,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27514 conditions, 5298 events. 3441/5298 cut-off events. For 32600/32994 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30251 event pairs, 541 based on Foata normal form. 125/5305 useless extension candidates. Maximal degree in co-relation 27484. Up to 2977 conditions per place. [2022-12-06 04:09:43,498 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 155 selfloop transitions, 3 changer transitions 11/176 dead transitions. [2022-12-06 04:09:43,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 176 transitions, 2031 flow [2022-12-06 04:09:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 04:09:43,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:09:43,499 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 833 flow. Second operand 4 states and 84 transitions. [2022-12-06 04:09:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 176 transitions, 2031 flow [2022-12-06 04:09:43,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1941 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:43,570 INFO L231 Difference]: Finished difference. Result has 73 places, 88 transitions, 818 flow [2022-12-06 04:09:43,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=818, PETRI_PLACES=73, PETRI_TRANSITIONS=88} [2022-12-06 04:09:43,571 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2022-12-06 04:09:43,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:43,571 INFO L89 Accepts]: Start accepts. Operand has 73 places, 88 transitions, 818 flow [2022-12-06 04:09:43,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:43,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:43,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 88 transitions, 818 flow [2022-12-06 04:09:43,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 88 transitions, 818 flow [2022-12-06 04:09:43,684 INFO L130 PetriNetUnfolder]: 747/1486 cut-off events. [2022-12-06 04:09:43,685 INFO L131 PetriNetUnfolder]: For 6277/6650 co-relation queries the response was YES. [2022-12-06 04:09:43,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6634 conditions, 1486 events. 747/1486 cut-off events. For 6277/6650 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9892 event pairs, 118 based on Foata normal form. 224/1642 useless extension candidates. Maximal degree in co-relation 6606. Up to 657 conditions per place. [2022-12-06 04:09:43,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 88 transitions, 818 flow [2022-12-06 04:09:43,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 1022 [2022-12-06 04:09:43,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:43,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 409 [2022-12-06 04:09:43,980 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 88 transitions, 834 flow [2022-12-06 04:09:43,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:43,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:43,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:43,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:09:43,980 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -502140820, now seen corresponding path program 1 times [2022-12-06 04:09:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274282939] [2022-12-06 04:09:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274282939] [2022-12-06 04:09:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274282939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:44,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:44,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157844656] [2022-12-06 04:09:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:44,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:44,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:44,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 04:09:44,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 88 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:44,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:44,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 04:09:44,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:44,624 INFO L130 PetriNetUnfolder]: 3105/4722 cut-off events. [2022-12-06 04:09:44,624 INFO L131 PetriNetUnfolder]: For 32201/32576 co-relation queries the response was YES. [2022-12-06 04:09:44,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24675 conditions, 4722 events. 3105/4722 cut-off events. For 32201/32576 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 26765 event pairs, 456 based on Foata normal form. 157/4695 useless extension candidates. Maximal degree in co-relation 24644. Up to 1902 conditions per place. [2022-12-06 04:09:44,650 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 129 selfloop transitions, 17 changer transitions 19/173 dead transitions. [2022-12-06 04:09:44,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 173 transitions, 2021 flow [2022-12-06 04:09:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-06 04:09:44,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-06 04:09:44,651 INFO L175 Difference]: Start difference. First operand has 73 places, 88 transitions, 834 flow. Second operand 6 states and 118 transitions. [2022-12-06 04:09:44,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 173 transitions, 2021 flow [2022-12-06 04:09:44,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 173 transitions, 1897 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:44,719 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 679 flow [2022-12-06 04:09:44,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=679, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2022-12-06 04:09:44,720 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2022-12-06 04:09:44,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:44,720 INFO L89 Accepts]: Start accepts. Operand has 75 places, 78 transitions, 679 flow [2022-12-06 04:09:44,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:44,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:44,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 78 transitions, 679 flow [2022-12-06 04:09:44,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 78 transitions, 679 flow [2022-12-06 04:09:44,779 INFO L130 PetriNetUnfolder]: 386/793 cut-off events. [2022-12-06 04:09:44,779 INFO L131 PetriNetUnfolder]: For 2963/3060 co-relation queries the response was YES. [2022-12-06 04:09:44,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 793 events. 386/793 cut-off events. For 2963/3060 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4924 event pairs, 44 based on Foata normal form. 43/799 useless extension candidates. Maximal degree in co-relation 3536. Up to 312 conditions per place. [2022-12-06 04:09:44,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 78 transitions, 679 flow [2022-12-06 04:09:44,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-06 04:09:46,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] $Ultimate##0-->L806: Formula: (and (= v_~a~0_63 1) (= v_~x~0_538 1) (= v_P0Thread1of1ForFork0_~arg.base_31 |v_P0Thread1of1ForFork0_#in~arg.base_31|) (= v_P0Thread1of1ForFork0_~arg.offset_31 |v_P0Thread1of1ForFork0_#in~arg.offset_31|) (= v_~z~0_63 v_~__unbuffered_p2_EAX~0_112)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~z~0=v_~z~0_63} OutVars{~a~0=v_~a~0_63, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_112, ~z~0=v_~z~0_63, ~x~0=v_~x~0_538, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_31, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_31} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [380] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_155 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_135 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_156 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_64 (ite .cse1 v_~x$w_buff1~0_61 v_~x~0_90)) v_~x~0_89) (= v_~x$w_buff1_used~0_134 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_135)) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_155 (ite .cse0 0 v_~x$w_buff0_used~0_156)) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_134 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)))) 0 v_~x$r_buff1_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_135, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:09:46,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] $Ultimate##0-->L806: Formula: (and (= v_~a~0_63 1) (= v_~x~0_538 1) (= v_P0Thread1of1ForFork0_~arg.base_31 |v_P0Thread1of1ForFork0_#in~arg.base_31|) (= v_P0Thread1of1ForFork0_~arg.offset_31 |v_P0Thread1of1ForFork0_#in~arg.offset_31|) (= v_~z~0_63 v_~__unbuffered_p2_EAX~0_112)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~z~0=v_~z~0_63} OutVars{~a~0=v_~a~0_63, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_112, ~z~0=v_~z~0_63, ~x~0=v_~x~0_538, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_31, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_31} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [468] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_239 256) 0)) (not (= (mod v_~x$w_buff1_used~0_205 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_66 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff0_thd2~0_64 1) (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_205) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:09:46,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] $Ultimate##0-->L806: Formula: (and (= v_~a~0_63 1) (= v_~x~0_538 1) (= v_P0Thread1of1ForFork0_~arg.base_31 |v_P0Thread1of1ForFork0_#in~arg.base_31|) (= v_P0Thread1of1ForFork0_~arg.offset_31 |v_P0Thread1of1ForFork0_#in~arg.offset_31|) (= v_~z~0_63 v_~__unbuffered_p2_EAX~0_112)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~z~0=v_~z~0_63} OutVars{~a~0=v_~a~0_63, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_112, ~z~0=v_~z~0_63, ~x~0=v_~x~0_538, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_31, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_31} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [403] L829-->L836: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse2)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5))) (and (= v_~x$w_buff1_used~0_126 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$r_buff0_thd4~0_21 (ite .cse1 0 v_~x$r_buff0_thd4~0_22)) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_58 (ite .cse0 v_~x$w_buff1~0_55 v_~x~0_82))) (= (ite .cse4 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 04:09:46,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_655 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_128 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_125 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_600 256) 0)) .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_656 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5))) (and (= v_P0Thread1of1ForFork0_~arg.base_39 |v_P0Thread1of1ForFork0_#in~arg.base_39|) (= v_~a~0_71 1) (= v_~x$w_buff1_used~0_599 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_600)) (= v_~x~0_556 (ite .cse2 v_~x$w_buff0~0_408 (ite .cse1 v_~x$w_buff1~0_374 1))) (= v_~x$r_buff1_thd1~0_124 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_599 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_127 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_125)) (= v_~z~0_65 v_~__unbuffered_p2_EAX~0_116) (= (ite .cse2 0 v_~x$w_buff0_used~0_656) v_~x$w_buff0_used~0_655) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_128) v_~x$r_buff0_thd1~0_127) (= v_P0Thread1of1ForFork0_~arg.offset_39 |v_P0Thread1of1ForFork0_#in~arg.offset_39|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_408, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_374, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125, ~z~0=v_~z~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_656} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_408, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_127, ~x$w_buff1~0=v_~x$w_buff1~0_374, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_599, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_124, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_655, ~a~0=v_~a~0_71, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~z~0=v_~z~0_65, ~x~0=v_~x~0_556, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_39} AuxVars[] AssignedVars[~a~0, ~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [468] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_239 256) 0)) (not (= (mod v_~x$w_buff1_used~0_205 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_66 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff0_thd2~0_64 1) (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_205) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:09:46,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [557] $Ultimate##0-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_659 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd3~0_168 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_170 256) 0)))) (let ((.cse3 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_660 256))))) (.cse4 (and (not (= 0 (mod v_~x$w_buff1_used~0_604 256))) .cse2)) (.cse0 (and .cse5 .cse1))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_170) v_~x$r_buff0_thd3~0_169) (= v_~a~0_73 1) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_169 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_603 256) 0)) .cse2)) 0 v_~x$r_buff1_thd3~0_168) v_~x$r_buff1_thd3~0_167) (= (ite .cse3 v_~x$w_buff0~0_410 (ite .cse4 v_~x$w_buff1~0_376 1)) v_~x~0_560) (= v_~x$w_buff0_used~0_659 (ite .cse3 0 v_~x$w_buff0_used~0_660)) (= v_~z~0_67 v_~__unbuffered_p2_EAX~0_118) (= v_P0Thread1of1ForFork0_~arg.base_41 |v_P0Thread1of1ForFork0_#in~arg.base_41|) (= v_~x$w_buff1_used~0_603 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_604)) (= v_P0Thread1of1ForFork0_~arg.offset_41 |v_P0Thread1of1ForFork0_#in~arg.offset_41|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_410, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_41|, ~x$w_buff1~0=v_~x$w_buff1~0_376, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_41|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_604, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_170, ~z~0=v_~z~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_660} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_410, ~x$w_buff1~0=v_~x$w_buff1~0_376, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_41|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_603, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_659, ~a~0=v_~a~0_73, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_41|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_118, ~z~0=v_~z~0_67, ~x~0=v_~x~0_560, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_41} AuxVars[] AssignedVars[~a~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [468] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_239 256) 0)) (not (= (mod v_~x$w_buff1_used~0_205 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_66 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff0_thd2~0_64 1) (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_205) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:09:46,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [559] $Ultimate##0-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_118 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_118 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_667 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_610 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_668 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_609 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_610)) (= v_~x$r_buff0_thd4~0_117 (ite .cse1 0 v_~x$r_buff0_thd4~0_118)) (= (ite .cse2 v_~x$w_buff0~0_416 (ite .cse0 v_~x$w_buff1~0_380 1)) v_~x~0_566) (= v_P0Thread1of1ForFork0_~arg.offset_45 |v_P0Thread1of1ForFork0_#in~arg.offset_45|) (= v_~z~0_71 v_~__unbuffered_p2_EAX~0_122) (= v_P0Thread1of1ForFork0_~arg.base_45 |v_P0Thread1of1ForFork0_#in~arg.base_45|) (= v_~x$r_buff1_thd4~0_117 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_609 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_117 256) 0)))) 0 v_~x$r_buff1_thd4~0_118)) (= v_~a~0_77 1) (= v_~x$w_buff0_used~0_667 (ite .cse2 0 v_~x$w_buff0_used~0_668))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_380, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_45|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_610, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_118, ~z~0=v_~z~0_71, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_416, ~x$w_buff1~0=v_~x$w_buff1~0_380, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_45|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_609, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_117, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_45, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_667, ~a~0=v_~a~0_77, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_122, ~z~0=v_~z~0_71, ~x~0=v_~x~0_566, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_45} AuxVars[] AssignedVars[~a~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd4~0, P0Thread1of1ForFork0_~arg.base, ~x~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [468] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_239 256) 0)) (not (= (mod v_~x$w_buff1_used~0_205 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_66 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff0_thd2~0_64 1) (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_205) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_205, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:09:47,207 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:09:47,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2488 [2022-12-06 04:09:47,208 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 725 flow [2022-12-06 04:09:47,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:47,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:47,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:47,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:09:47,209 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 929537927, now seen corresponding path program 1 times [2022-12-06 04:09:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:47,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143259409] [2022-12-06 04:09:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:47,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143259409] [2022-12-06 04:09:47,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143259409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:47,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:47,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336307988] [2022-12-06 04:09:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:47,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 04:09:47,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 725 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:47,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:47,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 04:09:47,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:47,781 INFO L130 PetriNetUnfolder]: 2728/4167 cut-off events. [2022-12-06 04:09:47,781 INFO L131 PetriNetUnfolder]: For 23858/23923 co-relation queries the response was YES. [2022-12-06 04:09:47,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21491 conditions, 4167 events. 2728/4167 cut-off events. For 23858/23923 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 22753 event pairs, 357 based on Foata normal form. 8/4152 useless extension candidates. Maximal degree in co-relation 21464. Up to 1878 conditions per place. [2022-12-06 04:09:47,803 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 90 selfloop transitions, 1 changer transitions 67/160 dead transitions. [2022-12-06 04:09:47,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 1863 flow [2022-12-06 04:09:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:09:47,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-06 04:09:47,804 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 725 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:09:47,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 1863 flow [2022-12-06 04:09:47,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 1686 flow, removed 56 selfloop flow, removed 6 redundant places. [2022-12-06 04:09:47,854 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 502 flow [2022-12-06 04:09:47,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2022-12-06 04:09:47,855 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-06 04:09:47,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:47,855 INFO L89 Accepts]: Start accepts. Operand has 69 places, 63 transitions, 502 flow [2022-12-06 04:09:47,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:47,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:47,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 63 transitions, 502 flow [2022-12-06 04:09:47,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 63 transitions, 502 flow [2022-12-06 04:09:47,902 INFO L130 PetriNetUnfolder]: 292/636 cut-off events. [2022-12-06 04:09:47,902 INFO L131 PetriNetUnfolder]: For 1763/1833 co-relation queries the response was YES. [2022-12-06 04:09:47,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 636 events. 292/636 cut-off events. For 1763/1833 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3917 event pairs, 65 based on Foata normal form. 27/644 useless extension candidates. Maximal degree in co-relation 2508. Up to 260 conditions per place. [2022-12-06 04:09:47,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 63 transitions, 502 flow [2022-12-06 04:09:47,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-06 04:09:48,018 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:48,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 04:09:48,019 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 510 flow [2022-12-06 04:09:48,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:48,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:48,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:48,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:09:48,019 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 929194047, now seen corresponding path program 1 times [2022-12-06 04:09:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:48,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210521621] [2022-12-06 04:09:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:48,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210521621] [2022-12-06 04:09:48,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210521621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:48,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:48,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041173509] [2022-12-06 04:09:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:48,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:48,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:09:48,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:48,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:48,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:09:48,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:48,429 INFO L130 PetriNetUnfolder]: 1341/2122 cut-off events. [2022-12-06 04:09:48,429 INFO L131 PetriNetUnfolder]: For 10174/10223 co-relation queries the response was YES. [2022-12-06 04:09:48,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10453 conditions, 2122 events. 1341/2122 cut-off events. For 10174/10223 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10517 event pairs, 303 based on Foata normal form. 1/2096 useless extension candidates. Maximal degree in co-relation 10426. Up to 960 conditions per place. [2022-12-06 04:09:48,438 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 51 selfloop transitions, 1 changer transitions 74/127 dead transitions. [2022-12-06 04:09:48,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 127 transitions, 1305 flow [2022-12-06 04:09:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 04:09:48,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2022-12-06 04:09:48,439 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 510 flow. Second operand 4 states and 59 transitions. [2022-12-06 04:09:48,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 127 transitions, 1305 flow [2022-12-06 04:09:48,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 1279 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:48,457 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 321 flow [2022-12-06 04:09:48,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2022-12-06 04:09:48,458 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2022-12-06 04:09:48,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:48,458 INFO L89 Accepts]: Start accepts. Operand has 68 places, 45 transitions, 321 flow [2022-12-06 04:09:48,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:48,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:48,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 45 transitions, 321 flow [2022-12-06 04:09:48,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 45 transitions, 321 flow [2022-12-06 04:09:48,477 INFO L130 PetriNetUnfolder]: 128/291 cut-off events. [2022-12-06 04:09:48,478 INFO L131 PetriNetUnfolder]: For 587/640 co-relation queries the response was YES. [2022-12-06 04:09:48,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 291 events. 128/291 cut-off events. For 587/640 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1379 event pairs, 23 based on Foata normal form. 9/288 useless extension candidates. Maximal degree in co-relation 1059. Up to 92 conditions per place. [2022-12-06 04:09:48,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 45 transitions, 321 flow [2022-12-06 04:09:48,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:09:48,685 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:48,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 04:09:48,685 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 327 flow [2022-12-06 04:09:48,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:48,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:48,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:48,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:09:48,686 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1782203036, now seen corresponding path program 1 times [2022-12-06 04:09:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:48,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853203702] [2022-12-06 04:09:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:32,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853203702] [2022-12-06 04:10:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853203702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:32,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:32,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:10:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044585881] [2022-12-06 04:10:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:10:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:10:32,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:10:32,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:10:32,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 327 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:32,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:32,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:10:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:33,466 INFO L130 PetriNetUnfolder]: 1100/1794 cut-off events. [2022-12-06 04:10:33,467 INFO L131 PetriNetUnfolder]: For 6195/6195 co-relation queries the response was YES. [2022-12-06 04:10:33,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 1794 events. 1100/1794 cut-off events. For 6195/6195 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8901 event pairs, 299 based on Foata normal form. 1/1790 useless extension candidates. Maximal degree in co-relation 8213. Up to 908 conditions per place. [2022-12-06 04:10:33,474 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 86 selfloop transitions, 6 changer transitions 10/102 dead transitions. [2022-12-06 04:10:33,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 871 flow [2022-12-06 04:10:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 04:10:33,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2022-12-06 04:10:33,492 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 327 flow. Second operand 6 states and 59 transitions. [2022-12-06 04:10:33,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 871 flow [2022-12-06 04:10:33,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 821 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-06 04:10:33,507 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 350 flow [2022-12-06 04:10:33,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2022-12-06 04:10:33,507 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2022-12-06 04:10:33,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:33,507 INFO L89 Accepts]: Start accepts. Operand has 60 places, 48 transitions, 350 flow [2022-12-06 04:10:33,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:33,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:33,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 48 transitions, 350 flow [2022-12-06 04:10:33,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 350 flow [2022-12-06 04:10:33,537 INFO L130 PetriNetUnfolder]: 221/512 cut-off events. [2022-12-06 04:10:33,537 INFO L131 PetriNetUnfolder]: For 1200/1290 co-relation queries the response was YES. [2022-12-06 04:10:33,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 512 events. 221/512 cut-off events. For 1200/1290 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3089 event pairs, 43 based on Foata normal form. 26/508 useless extension candidates. Maximal degree in co-relation 1814. Up to 159 conditions per place. [2022-12-06 04:10:33,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 48 transitions, 350 flow [2022-12-06 04:10:33,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 04:10:33,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:33,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:10:33,647 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 354 flow [2022-12-06 04:10:33,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:33,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:33,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:33,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:10:33,648 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 303808402, now seen corresponding path program 1 times [2022-12-06 04:10:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742752280] [2022-12-06 04:10:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:33,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:10:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:33,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:10:33,784 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:10:33,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:10:33,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:10:33,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:10:33,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:10:33,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:10:33,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:10:33,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:10:33,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:10:33,800 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:33,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:10:33,804 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:10:33,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:10:33 BasicIcfg [2022-12-06 04:10:33,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:10:33,893 INFO L158 Benchmark]: Toolchain (without parser) took 82096.95ms. Allocated memory was 208.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 184.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 957.2MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,893 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 208.7MB. Free memory was 185.8MB in the beginning and 185.8MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:33,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.45ms. Allocated memory is still 208.7MB. Free memory was 184.3MB in the beginning and 156.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.94ms. Allocated memory is still 208.7MB. Free memory was 156.0MB in the beginning and 153.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,894 INFO L158 Benchmark]: Boogie Preprocessor took 51.07ms. Allocated memory is still 208.7MB. Free memory was 153.4MB in the beginning and 151.1MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,894 INFO L158 Benchmark]: RCFGBuilder took 588.97ms. Allocated memory is still 208.7MB. Free memory was 151.1MB in the beginning and 112.5MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,894 INFO L158 Benchmark]: TraceAbstraction took 80808.20ms. Allocated memory was 208.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 112.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 884.9MB. Max. memory is 8.0GB. [2022-12-06 04:10:33,896 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.61ms. Allocated memory is still 208.7MB. Free memory was 185.8MB in the beginning and 185.8MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 566.45ms. Allocated memory is still 208.7MB. Free memory was 184.3MB in the beginning and 156.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.94ms. Allocated memory is still 208.7MB. Free memory was 156.0MB in the beginning and 153.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.07ms. Allocated memory is still 208.7MB. Free memory was 153.4MB in the beginning and 151.1MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 588.97ms. Allocated memory is still 208.7MB. Free memory was 151.1MB in the beginning and 112.5MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 80808.20ms. Allocated memory was 208.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 112.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 884.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 138 PlacesBefore, 47 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 3150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2185, independent: 2111, independent conditional: 2111, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2185, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2185, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2185, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1854, independent: 1802, independent conditional: 0, independent unconditional: 1802, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1854, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2185, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1854, unknown conditional: 0, unknown unconditional: 1854] , Statistics on independence cache: Total cache size (in pairs): 2693, Positive cache size: 2641, Positive conditional cache size: 0, Positive unconditional cache size: 2641, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 176, independent conditional: 176, 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: 206, independent: 176, independent conditional: 16, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 176, independent conditional: 16, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 176, independent conditional: 16, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 160, independent conditional: 15, independent unconditional: 145, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 53, dependent conditional: 9, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 16, independent conditional: 1, independent unconditional: 15, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 183, unknown conditional: 17, unknown unconditional: 166] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 160, Positive conditional cache size: 15, Positive unconditional cache size: 145, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, 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, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 359, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 359, independent: 306, independent conditional: 14, independent unconditional: 292, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 359, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 359, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 0, dependent unconditional: 4, 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: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 193, Positive conditional cache size: 16, Positive unconditional cache size: 177, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 42 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 489, independent: 455, independent conditional: 455, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 489, independent: 455, independent conditional: 120, independent unconditional: 335, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 489, independent: 455, independent conditional: 33, independent unconditional: 422, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 489, independent: 455, independent conditional: 33, independent unconditional: 422, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 489, independent: 440, independent conditional: 33, independent unconditional: 407, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 269, Positive conditional cache size: 19, Positive unconditional cache size: 250, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 298, independent: 280, independent conditional: 280, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 298, independent: 280, independent conditional: 53, independent unconditional: 227, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 298, independent: 280, independent conditional: 53, independent unconditional: 227, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 298, independent: 280, independent conditional: 53, independent unconditional: 227, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 298, independent: 276, independent conditional: 53, independent unconditional: 223, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 273, Positive conditional cache size: 19, Positive unconditional cache size: 254, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, 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, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 25, independent unconditional: 105, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 124, independent conditional: 23, independent unconditional: 101, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 279, Positive conditional cache size: 19, Positive unconditional cache size: 260, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 29, independent unconditional: 114, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 143, independent conditional: 26, independent unconditional: 117, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 26, independent unconditional: 117, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 165, independent: 143, independent conditional: 26, independent unconditional: 117, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 279, Positive conditional cache size: 19, Positive unconditional cache size: 260, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 204, independent: 180, independent conditional: 40, independent unconditional: 140, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 204, independent: 180, independent conditional: 33, independent unconditional: 147, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204, independent: 180, independent conditional: 33, independent unconditional: 147, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, independent: 180, independent conditional: 33, independent unconditional: 147, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 279, Positive conditional cache size: 19, Positive unconditional cache size: 260, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, independent: 245, independent conditional: 245, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272, independent: 245, independent conditional: 78, independent unconditional: 167, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 245, independent conditional: 68, independent unconditional: 177, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 245, independent conditional: 68, independent unconditional: 177, dependent: 27, dependent conditional: 0, dependent unconditional: 27, 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: 272, independent: 245, independent conditional: 68, independent unconditional: 177, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 279, Positive conditional cache size: 19, Positive unconditional cache size: 260, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318, independent: 285, independent conditional: 285, 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: 318, independent: 285, independent conditional: 90, independent unconditional: 195, 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: 318, independent: 285, independent conditional: 76, independent unconditional: 209, 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: 318, independent: 285, independent conditional: 76, independent unconditional: 209, 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: 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] , 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: 318, independent: 282, independent conditional: 76, independent unconditional: 206, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 282, Positive conditional cache size: 19, Positive unconditional cache size: 263, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 926, independent: 878, independent conditional: 878, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 926, independent: 878, independent conditional: 396, independent unconditional: 482, dependent: 48, dependent conditional: 6, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 926, independent: 878, independent conditional: 308, independent unconditional: 570, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 926, independent: 878, independent conditional: 308, independent unconditional: 570, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 926, independent: 877, independent conditional: 307, independent unconditional: 570, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 283, Positive conditional cache size: 20, Positive unconditional cache size: 263, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 846, independent: 794, independent conditional: 794, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 846, independent: 794, independent conditional: 307, independent unconditional: 487, dependent: 52, dependent conditional: 6, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 846, independent: 794, independent conditional: 221, independent unconditional: 573, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 846, independent: 794, independent conditional: 221, independent unconditional: 573, dependent: 52, dependent conditional: 0, dependent unconditional: 52, 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: 846, independent: 789, independent conditional: 221, independent unconditional: 568, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 288, Positive conditional cache size: 20, Positive unconditional cache size: 268, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 853, independent: 802, independent conditional: 802, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 853, independent: 802, independent conditional: 328, independent unconditional: 474, dependent: 51, dependent conditional: 6, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 853, independent: 802, independent conditional: 243, independent unconditional: 559, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 853, independent: 802, independent conditional: 243, independent unconditional: 559, dependent: 51, dependent conditional: 0, dependent unconditional: 51, 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: 853, independent: 802, independent conditional: 243, independent unconditional: 559, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 288, Positive conditional cache size: 20, Positive unconditional cache size: 268, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 91, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 70 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 935, independent: 893, independent conditional: 893, 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: 935, independent: 893, independent conditional: 442, independent unconditional: 451, dependent: 42, dependent conditional: 12, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 935, independent: 893, independent conditional: 296, independent unconditional: 597, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 935, independent: 893, independent conditional: 296, independent unconditional: 597, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 7, independent unconditional: 8, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 935, independent: 878, independent conditional: 289, independent unconditional: 589, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 15, unknown conditional: 7, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 310, Positive conditional cache size: 27, Positive unconditional cache size: 283, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 158, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 73 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1066 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 998, independent: 957, independent conditional: 957, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 998, independent: 957, independent conditional: 481, independent unconditional: 476, dependent: 41, dependent conditional: 12, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 998, independent: 957, independent conditional: 342, independent unconditional: 615, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 998, independent: 957, independent conditional: 342, independent unconditional: 615, dependent: 41, dependent conditional: 0, dependent unconditional: 41, 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: 998, independent: 957, independent conditional: 342, independent unconditional: 615, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 321, Positive conditional cache size: 27, Positive unconditional cache size: 294, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 151, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 71 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1006 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 924, independent: 886, independent conditional: 886, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 924, independent: 886, independent conditional: 490, independent unconditional: 396, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 924, independent: 886, independent conditional: 358, independent unconditional: 528, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 924, independent: 886, independent conditional: 358, independent unconditional: 528, dependent: 38, dependent conditional: 0, dependent unconditional: 38, 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: 924, independent: 886, independent conditional: 358, independent unconditional: 528, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 335, Positive conditional cache size: 27, Positive unconditional cache size: 308, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 144, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 73 PlacesBefore, 73 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1022 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 236, independent conditional: 236, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 236, independent conditional: 132, independent unconditional: 104, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 236, independent conditional: 100, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 236, independent conditional: 100, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 246, independent: 236, independent conditional: 100, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 389, Positive conditional cache size: 31, Positive unconditional cache size: 358, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 74 PlacesBefore, 70 PlacesAfterwards, 78 TransitionsBefore, 74 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375, independent: 363, independent conditional: 363, 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: 375, independent: 363, independent conditional: 272, independent unconditional: 91, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 363, independent conditional: 234, independent unconditional: 129, 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: 375, independent: 363, independent conditional: 234, independent unconditional: 129, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 375, independent: 349, independent conditional: 220, independent unconditional: 129, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 531, Positive conditional cache size: 51, Positive unconditional cache size: 480, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 67 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 44, independent conditional: 28, independent unconditional: 16, 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: 44, independent: 44, independent conditional: 28, independent unconditional: 16, 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: 10, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 44, independent: 34, independent conditional: 25, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 592, Positive conditional cache size: 55, Positive unconditional cache size: 537, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, 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.2s, 60 PlacesBefore, 60 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 12, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 12, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 619, Positive conditional cache size: 62, Positive unconditional cache size: 557, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 13, independent unconditional: 2, 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: 15, independent: 15, independent conditional: 11, independent unconditional: 4, 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: 15, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 624, Positive conditional cache size: 62, Positive unconditional cache size: 562, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-4, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-3, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t491, ((void *)0), P2, ((void *)0))=-2, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t492, ((void *)0), P3, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 4 z = 1 [L825] 4 __unbuffered_p3_EAX = z [L828] 4 __unbuffered_p3_EBX = a [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 a = 1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: 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: 860]: 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: 858]: 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, 168 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: 80.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2305 IncrementalHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 30 mSDtfsCounter, 2305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1031occurred in iteration=12, InterpolantAutomatonStates: 87, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.5s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 4049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:10:33,928 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...