/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/mix037.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:14:43,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:14:43,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:14:43,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:14:43,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:14:43,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:14:43,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:14:43,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:14:43,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:14:43,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:14:43,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:14:43,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:14:43,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:14:43,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:14:43,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:14:43,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:14:43,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:14:43,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:14:43,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:14:43,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:14:43,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:14:43,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:14:43,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:14:43,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:14:43,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:14:43,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:14:43,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:14:43,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:14:43,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:14:43,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:14:43,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:14:43,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:14:43,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:14:43,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:14:43,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:14:43,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:14:43,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:14:43,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:14:43,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:14:43,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:14:43,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:14:43,246 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:14:43,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:14:43,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:14:43,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:14:43,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:14:43,263 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:14:43,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:14:43,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:14:43,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:14:43,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:14:43,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:14:43,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:43,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:14:43,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:14:43,265 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:14:43,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:14:43,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:14:43,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:14:43,516 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:14:43,516 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:14:43,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2022-12-06 04:14:44,518 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:14:44,762 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:14:44,763 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2022-12-06 04:14:44,787 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da51298fe/db86ddfae06248dfa1924e48ff72d35e/FLAGd04a089fb [2022-12-06 04:14:44,812 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da51298fe/db86ddfae06248dfa1924e48ff72d35e [2022-12-06 04:14:44,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:14:44,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:14:44,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:44,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:14:44,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:14:44,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:44" (1/1) ... [2022-12-06 04:14:44,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2e1484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:44, skipping insertion in model container [2022-12-06 04:14:44,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:44" (1/1) ... [2022-12-06 04:14:44,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:14:44,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:14:45,073 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i[944,957] [2022-12-06 04:14:45,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:45,245 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:14:45,255 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/mix037.opt.i[944,957] [2022-12-06 04:14:45,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:45,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:45,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:45,332 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:14:45,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45 WrapperNode [2022-12-06 04:14:45,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:45,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:45,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:14:45,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:14:45,339 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:14:45" (1/1) ... [2022-12-06 04:14:45,354 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:14:45" (1/1) ... [2022-12-06 04:14:45,377 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-06 04:14:45,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:45,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:14:45,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:14:45,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:14:45,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,408 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:14:45,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:14:45,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:14:45,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:14:45,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (1/1) ... [2022-12-06 04:14:45,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:45,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:14:45,439 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:14:45,442 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:14:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:14:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:14:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:14:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:14:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:14:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:14:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:14:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:14:45,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:14:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:14:45,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:14:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:14:45,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:14:45,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:14:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:14:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:14:45,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:14:45,514 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:14:45,665 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:14:45,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:14:46,051 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:14:46,162 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:14:46,162 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:14:46,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:46 BoogieIcfgContainer [2022-12-06 04:14:46,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:14:46,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:14:46,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:14:46,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:14:46,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:14:44" (1/3) ... [2022-12-06 04:14:46,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4549986f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:46, skipping insertion in model container [2022-12-06 04:14:46,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:45" (2/3) ... [2022-12-06 04:14:46,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4549986f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:46, skipping insertion in model container [2022-12-06 04:14:46,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:46" (3/3) ... [2022-12-06 04:14:46,172 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2022-12-06 04:14:46,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:14:46,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:14:46,218 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:14:46,300 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:14:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:14:46,385 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:14:46,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:46,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:14:46,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:14:46,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 04:14:46,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:46,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:14:46,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 04:14:46,461 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:14:46,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:14:46,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:14:46,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 04:14:50,600 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 04:14:50,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:14:50,614 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;@6c8e9932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:14:50,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:14:50,618 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 04:14:50,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:50,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:50,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:50,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -951910600, now seen corresponding path program 1 times [2022-12-06 04:14:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738873942] [2022-12-06 04:14:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:51,025 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:14:51,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738873942] [2022-12-06 04:14:51,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738873942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:51,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:51,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891856207] [2022-12-06 04:14:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:51,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:51,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:14:51,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:51,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:51,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:14:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:51,507 INFO L130 PetriNetUnfolder]: 2483/3884 cut-off events. [2022-12-06 04:14:51,507 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 04:14:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 3884 events. 2483/3884 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22602 event pairs, 593 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7420. Up to 2539 conditions per place. [2022-12-06 04:14:51,528 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 29 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 04:14:51,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-12-06 04:14:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:14:51,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 04:14:51,537 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:14:51,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-12-06 04:14:51,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:14:51,542 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:51,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:14:51,545 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:14:51,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:51,546 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:51,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:51,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:51,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:51,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 04:14:51,559 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:14:51,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:51,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:14:51,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 04:14:51,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:14:51,629 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:51,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 04:14:51,632 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 04:14:51,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:51,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:51,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:51,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:14:51,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash 41946315, now seen corresponding path program 1 times [2022-12-06 04:14:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:51,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080246808] [2022-12-06 04:14:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:51,871 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:14:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080246808] [2022-12-06 04:14:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080246808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:51,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430556955] [2022-12-06 04:14:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:51,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:51,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:14:51,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:14:51,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:51,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:14:51,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:52,683 INFO L130 PetriNetUnfolder]: 6453/8946 cut-off events. [2022-12-06 04:14:52,683 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-06 04:14:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18494 conditions, 8946 events. 6453/8946 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 43447 event pairs, 2293 based on Foata normal form. 200/9146 useless extension candidates. Maximal degree in co-relation 18484. Up to 6549 conditions per place. [2022-12-06 04:14:52,745 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2022-12-06 04:14:52,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2022-12-06 04:14:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:14:52,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-06 04:14:52,748 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:14:52,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2022-12-06 04:14:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:52,755 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-06 04:14:52,756 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:14:52,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:52,756 INFO L89 Accepts]: Start accepts. Operand has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:52,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:52,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,792 INFO L130 PetriNetUnfolder]: 152/361 cut-off events. [2022-12-06 04:14:52,793 INFO L131 PetriNetUnfolder]: For 40/51 co-relation queries the response was YES. [2022-12-06 04:14:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 361 events. 152/361 cut-off events. For 40/51 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1996 event pairs, 78 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 720. Up to 221 conditions per place. [2022-12-06 04:14:52,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:14:52,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:52,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:14:52,849 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2022-12-06 04:14:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:14:52,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:52,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:52,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:14:52,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1300334415, now seen corresponding path program 1 times [2022-12-06 04:14:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:52,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106495675] [2022-12-06 04:14:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:53,106 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:14:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106495675] [2022-12-06 04:14:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106495675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:53,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:53,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724992932] [2022-12-06 04:14:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:53,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:53,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:14:53,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:53,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:53,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:14:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:53,683 INFO L130 PetriNetUnfolder]: 4346/6361 cut-off events. [2022-12-06 04:14:53,683 INFO L131 PetriNetUnfolder]: For 2360/2403 co-relation queries the response was YES. [2022-12-06 04:14:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15375 conditions, 6361 events. 4346/6361 cut-off events. For 2360/2403 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34100 event pairs, 1581 based on Foata normal form. 96/6293 useless extension candidates. Maximal degree in co-relation 15363. Up to 3891 conditions per place. [2022-12-06 04:14:53,719 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 33 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 04:14:53,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 218 flow [2022-12-06 04:14:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 04:14:53,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 04:14:53,722 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 3 states and 41 transitions. [2022-12-06 04:14:53,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 218 flow [2022-12-06 04:14:53,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:53,733 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-06 04:14:53,734 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-06 04:14:53,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:53,734 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:53,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:53,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,752 INFO L130 PetriNetUnfolder]: 122/291 cut-off events. [2022-12-06 04:14:53,752 INFO L131 PetriNetUnfolder]: For 36/44 co-relation queries the response was YES. [2022-12-06 04:14:53,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 291 events. 122/291 cut-off events. For 36/44 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1440 event pairs, 46 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 563. Up to 181 conditions per place. [2022-12-06 04:14:53,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 04:14:53,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:53,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 04:14:53,767 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 109 flow [2022-12-06 04:14:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:53,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:53,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:53,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:14:53,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1670517345, now seen corresponding path program 1 times [2022-12-06 04:14:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:53,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715503149] [2022-12-06 04:14:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:53,895 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:14:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:53,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715503149] [2022-12-06 04:14:53,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715503149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:53,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:53,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:14:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178675762] [2022-12-06 04:14:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:53,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:53,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:14:53,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 109 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:14:53,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:53,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:14:53,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:54,429 INFO L130 PetriNetUnfolder]: 5813/8074 cut-off events. [2022-12-06 04:14:54,429 INFO L131 PetriNetUnfolder]: For 2016/2016 co-relation queries the response was YES. [2022-12-06 04:14:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20035 conditions, 8074 events. 5813/8074 cut-off events. For 2016/2016 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 38966 event pairs, 1497 based on Foata normal form. 32/8106 useless extension candidates. Maximal degree in co-relation 20022. Up to 5505 conditions per place. [2022-12-06 04:14:54,458 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-12-06 04:14:54,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 343 flow [2022-12-06 04:14:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 04:14:54,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-06 04:14:54,460 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 109 flow. Second operand 4 states and 63 transitions. [2022-12-06 04:14:54,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 343 flow [2022-12-06 04:14:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:54,462 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 04:14:54,463 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 04:14:54,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:54,464 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:54,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:54,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,481 INFO L130 PetriNetUnfolder]: 106/263 cut-off events. [2022-12-06 04:14:54,482 INFO L131 PetriNetUnfolder]: For 143/183 co-relation queries the response was YES. [2022-12-06 04:14:54,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 263 events. 106/263 cut-off events. For 143/183 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1290 event pairs, 44 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 655. Up to 161 conditions per place. [2022-12-06 04:14:54,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 04:14:54,488 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:54,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 04:14:54,492 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 167 flow [2022-12-06 04:14:54,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:14:54,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:54,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:54,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:14:54,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 246473433, now seen corresponding path program 1 times [2022-12-06 04:14:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967298746] [2022-12-06 04:14:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:54,586 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:14:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967298746] [2022-12-06 04:14:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967298746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:54,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:54,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491021649] [2022-12-06 04:14:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:54,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:54,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:54,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 04:14:54,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 167 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:14:54,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:54,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 04:14:54,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:55,046 INFO L130 PetriNetUnfolder]: 3884/5812 cut-off events. [2022-12-06 04:14:55,047 INFO L131 PetriNetUnfolder]: For 3701/3970 co-relation queries the response was YES. [2022-12-06 04:14:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15084 conditions, 5812 events. 3884/5812 cut-off events. For 3701/3970 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 34019 event pairs, 790 based on Foata normal form. 563/6062 useless extension candidates. Maximal degree in co-relation 15069. Up to 3837 conditions per place. [2022-12-06 04:14:55,075 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2022-12-06 04:14:55,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 84 transitions, 489 flow [2022-12-06 04:14:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 04:14:55,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 04:14:55,076 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 167 flow. Second operand 5 states and 80 transitions. [2022-12-06 04:14:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 84 transitions, 489 flow [2022-12-06 04:14:55,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:14:55,082 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 242 flow [2022-12-06 04:14:55,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-06 04:14:55,082 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2022-12-06 04:14:55,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:55,082 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 242 flow [2022-12-06 04:14:55,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:55,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:55,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 242 flow [2022-12-06 04:14:55,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 242 flow [2022-12-06 04:14:55,156 INFO L130 PetriNetUnfolder]: 678/1323 cut-off events. [2022-12-06 04:14:55,156 INFO L131 PetriNetUnfolder]: For 1037/1450 co-relation queries the response was YES. [2022-12-06 04:14:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3852 conditions, 1323 events. 678/1323 cut-off events. For 1037/1450 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 9393 event pairs, 321 based on Foata normal form. 13/1186 useless extension candidates. Maximal degree in co-relation 3835. Up to 844 conditions per place. [2022-12-06 04:14:55,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 242 flow [2022-12-06 04:14:55,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-06 04:14:55,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [483] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_139 (+ v_~__unbuffered_cnt~0_140 1)) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:14:55,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [495] L758-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_159 (+ v_~__unbuffered_cnt~0_160 1)) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_160} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:14:55,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [423] L801-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 04:14:55,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_85 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_14) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_14 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [452] L839-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_13|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-06 04:14:55,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:55,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 04:14:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 252 flow [2022-12-06 04:14:55,293 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:14:55,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:55,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:55,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:14:55,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2023581695, now seen corresponding path program 1 times [2022-12-06 04:14:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:55,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624485625] [2022-12-06 04:14:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:55,422 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:14:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624485625] [2022-12-06 04:14:55,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624485625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:55,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:55,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964084680] [2022-12-06 04:14:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:55,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:14:55,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:14:55,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:55,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:14:55,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:55,845 INFO L130 PetriNetUnfolder]: 2796/4431 cut-off events. [2022-12-06 04:14:55,846 INFO L131 PetriNetUnfolder]: For 5630/6135 co-relation queries the response was YES. [2022-12-06 04:14:55,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15445 conditions, 4431 events. 2796/4431 cut-off events. For 5630/6135 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26798 event pairs, 302 based on Foata normal form. 495/4738 useless extension candidates. Maximal degree in co-relation 15425. Up to 1941 conditions per place. [2022-12-06 04:14:55,868 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 75 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2022-12-06 04:14:55,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 103 transitions, 700 flow [2022-12-06 04:14:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 04:14:55,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 04:14:55,870 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 252 flow. Second operand 6 states and 102 transitions. [2022-12-06 04:14:55,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 103 transitions, 700 flow [2022-12-06 04:14:55,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 103 transitions, 687 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:55,877 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 371 flow [2022-12-06 04:14:55,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-06 04:14:55,877 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:14:55,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:55,877 INFO L89 Accepts]: Start accepts. Operand has 55 places, 53 transitions, 371 flow [2022-12-06 04:14:55,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:55,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:55,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 53 transitions, 371 flow [2022-12-06 04:14:55,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 371 flow [2022-12-06 04:14:55,949 INFO L130 PetriNetUnfolder]: 488/1089 cut-off events. [2022-12-06 04:14:55,950 INFO L131 PetriNetUnfolder]: For 3186/4858 co-relation queries the response was YES. [2022-12-06 04:14:55,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 1089 events. 488/1089 cut-off events. For 3186/4858 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7909 event pairs, 96 based on Foata normal form. 25/1020 useless extension candidates. Maximal degree in co-relation 4721. Up to 805 conditions per place. [2022-12-06 04:14:55,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 371 flow [2022-12-06 04:14:55,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 842 [2022-12-06 04:14:56,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:56,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 04:14:56,352 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 363 flow [2022-12-06 04:14:56,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:14:56,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:56,352 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:14:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:14:56,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 25307601, now seen corresponding path program 1 times [2022-12-06 04:14:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599111790] [2022-12-06 04:14:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:56,459 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:14:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:56,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599111790] [2022-12-06 04:14:56,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599111790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:56,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:56,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:14:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165405595] [2022-12-06 04:14:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:56,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:56,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:56,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:14:56,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:56,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:56,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:14:56,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:56,882 INFO L130 PetriNetUnfolder]: 2943/4751 cut-off events. [2022-12-06 04:14:56,883 INFO L131 PetriNetUnfolder]: For 12781/12953 co-relation queries the response was YES. [2022-12-06 04:14:56,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19764 conditions, 4751 events. 2943/4751 cut-off events. For 12781/12953 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 28639 event pairs, 1000 based on Foata normal form. 73/4605 useless extension candidates. Maximal degree in co-relation 19740. Up to 2353 conditions per place. [2022-12-06 04:14:56,906 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 68 selfloop transitions, 5 changer transitions 4/84 dead transitions. [2022-12-06 04:14:56,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 749 flow [2022-12-06 04:14:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 04:14:56,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-06 04:14:56,907 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 363 flow. Second operand 3 states and 57 transitions. [2022-12-06 04:14:56,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 749 flow [2022-12-06 04:14:56,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 647 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:56,961 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:56,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 04:14:56,962 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:14:56,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:56,962 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:56,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:56,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:56,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:56,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:57,023 INFO L130 PetriNetUnfolder]: 499/1097 cut-off events. [2022-12-06 04:14:57,023 INFO L131 PetriNetUnfolder]: For 2622/2906 co-relation queries the response was YES. [2022-12-06 04:14:57,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 1097 events. 499/1097 cut-off events. For 2622/2906 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7758 event pairs, 121 based on Foata normal form. 31/1059 useless extension candidates. Maximal degree in co-relation 4099. Up to 562 conditions per place. [2022-12-06 04:14:57,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:57,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-06 04:14:57,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:57,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 04:14:57,040 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 328 flow [2022-12-06 04:14:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:57,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:57,040 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:14:57,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:14:57,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1705807882, now seen corresponding path program 1 times [2022-12-06 04:14:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:57,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029880665] [2022-12-06 04:14:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:57,190 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:14:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029880665] [2022-12-06 04:14:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029880665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:57,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:57,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531088419] [2022-12-06 04:14:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:57,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:57,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:14:57,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 328 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:14:57,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:57,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:14:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:57,734 INFO L130 PetriNetUnfolder]: 4933/7575 cut-off events. [2022-12-06 04:14:57,734 INFO L131 PetriNetUnfolder]: For 18168/18168 co-relation queries the response was YES. [2022-12-06 04:14:57,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29913 conditions, 7575 events. 4933/7575 cut-off events. For 18168/18168 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 44161 event pairs, 315 based on Foata normal form. 39/7614 useless extension candidates. Maximal degree in co-relation 29890. Up to 3703 conditions per place. [2022-12-06 04:14:57,759 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 89 selfloop transitions, 23 changer transitions 33/145 dead transitions. [2022-12-06 04:14:57,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 145 transitions, 1194 flow [2022-12-06 04:14:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 04:14:57,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2022-12-06 04:14:57,761 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 328 flow. Second operand 5 states and 91 transitions. [2022-12-06 04:14:57,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 145 transitions, 1194 flow [2022-12-06 04:14:57,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 145 transitions, 1143 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:57,802 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 433 flow [2022-12-06 04:14:57,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-06 04:14:57,806 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 04:14:57,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:57,806 INFO L89 Accepts]: Start accepts. Operand has 60 places, 57 transitions, 433 flow [2022-12-06 04:14:57,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:57,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:57,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 57 transitions, 433 flow [2022-12-06 04:14:57,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 433 flow [2022-12-06 04:14:57,888 INFO L130 PetriNetUnfolder]: 628/1378 cut-off events. [2022-12-06 04:14:57,888 INFO L131 PetriNetUnfolder]: For 2278/2558 co-relation queries the response was YES. [2022-12-06 04:14:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 1378 events. 628/1378 cut-off events. For 2278/2558 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9818 event pairs, 147 based on Foata normal form. 54/1381 useless extension candidates. Maximal degree in co-relation 4760. Up to 801 conditions per place. [2022-12-06 04:14:57,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 433 flow [2022-12-06 04:14:57,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 04:14:57,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:57,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 04:14:57,900 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 433 flow [2022-12-06 04:14:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:14:57,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:57,900 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:14:57,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:14:57,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -794872566, now seen corresponding path program 1 times [2022-12-06 04:14:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247880236] [2022-12-06 04:14:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:57,997 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:14:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247880236] [2022-12-06 04:14:57,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247880236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:57,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:57,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292949370] [2022-12-06 04:14:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:57,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:57,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 04:14:57,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:14:57,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:57,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 04:14:57,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:58,324 INFO L130 PetriNetUnfolder]: 2099/3505 cut-off events. [2022-12-06 04:14:58,325 INFO L131 PetriNetUnfolder]: For 7329/7794 co-relation queries the response was YES. [2022-12-06 04:14:58,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13459 conditions, 3505 events. 2099/3505 cut-off events. For 7329/7794 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21452 event pairs, 189 based on Foata normal form. 469/3879 useless extension candidates. Maximal degree in co-relation 13433. Up to 1216 conditions per place. [2022-12-06 04:14:58,339 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 85 selfloop transitions, 18 changer transitions 16/138 dead transitions. [2022-12-06 04:14:58,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 138 transitions, 1171 flow [2022-12-06 04:14:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:14:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:14:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-06 04:14:58,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2022-12-06 04:14:58,341 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 433 flow. Second operand 7 states and 114 transitions. [2022-12-06 04:14:58,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 138 transitions, 1171 flow [2022-12-06 04:14:58,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 138 transitions, 1157 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:58,352 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 560 flow [2022-12-06 04:14:58,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=560, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-06 04:14:58,352 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-12-06 04:14:58,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:58,352 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 560 flow [2022-12-06 04:14:58,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:58,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:58,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 560 flow [2022-12-06 04:14:58,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 560 flow [2022-12-06 04:14:58,409 INFO L130 PetriNetUnfolder]: 429/1034 cut-off events. [2022-12-06 04:14:58,409 INFO L131 PetriNetUnfolder]: For 2705/3030 co-relation queries the response was YES. [2022-12-06 04:14:58,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4567 conditions, 1034 events. 429/1034 cut-off events. For 2705/3030 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7390 event pairs, 33 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 4541. Up to 636 conditions per place. [2022-12-06 04:14:58,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 560 flow [2022-12-06 04:14:58,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-06 04:14:58,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:58,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:14:58,492 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 550 flow [2022-12-06 04:14:58,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:14:58,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:58,492 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:14:58,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:14:58,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1731388914, now seen corresponding path program 1 times [2022-12-06 04:14:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:58,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950188009] [2022-12-06 04:14:58,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:58,628 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:14:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950188009] [2022-12-06 04:14:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950188009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:58,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:58,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:14:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294231268] [2022-12-06 04:14:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:14:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:14:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:14:58,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 04:14:58,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 550 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:58,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:58,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 04:14:58,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:58,911 INFO L130 PetriNetUnfolder]: 1705/2795 cut-off events. [2022-12-06 04:14:58,911 INFO L131 PetriNetUnfolder]: For 7887/8236 co-relation queries the response was YES. [2022-12-06 04:14:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11818 conditions, 2795 events. 1705/2795 cut-off events. For 7887/8236 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16307 event pairs, 177 based on Foata normal form. 198/2908 useless extension candidates. Maximal degree in co-relation 11789. Up to 975 conditions per place. [2022-12-06 04:14:58,921 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 60 selfloop transitions, 18 changer transitions 29/122 dead transitions. [2022-12-06 04:14:58,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1072 flow [2022-12-06 04:14:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:14:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:14:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2022-12-06 04:14:58,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 04:14:58,923 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 550 flow. Second operand 8 states and 108 transitions. [2022-12-06 04:14:58,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1072 flow [2022-12-06 04:14:58,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 122 transitions, 1022 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 04:14:58,967 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 442 flow [2022-12-06 04:14:58,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2022-12-06 04:14:58,967 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2022-12-06 04:14:58,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:58,967 INFO L89 Accepts]: Start accepts. Operand has 67 places, 55 transitions, 442 flow [2022-12-06 04:14:58,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:58,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:58,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 55 transitions, 442 flow [2022-12-06 04:14:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 442 flow [2022-12-06 04:14:58,986 INFO L130 PetriNetUnfolder]: 125/309 cut-off events. [2022-12-06 04:14:58,986 INFO L131 PetriNetUnfolder]: For 648/708 co-relation queries the response was YES. [2022-12-06 04:14:58,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 309 events. 125/309 cut-off events. For 648/708 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1533 event pairs, 7 based on Foata normal form. 2/298 useless extension candidates. Maximal degree in co-relation 1239. Up to 111 conditions per place. [2022-12-06 04:14:58,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 442 flow [2022-12-06 04:14:58,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-06 04:14:59,254 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:59,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 288 [2022-12-06 04:14:59,255 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 426 flow [2022-12-06 04:14:59,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:59,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:59,255 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:14:59,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:14:59,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1057764316, now seen corresponding path program 1 times [2022-12-06 04:14:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:59,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759633972] [2022-12-06 04:14:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:59,380 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:14:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:59,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759633972] [2022-12-06 04:14:59,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759633972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:59,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:59,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288024964] [2022-12-06 04:14:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:59,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:59,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:14:59,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 426 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:59,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:59,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:14:59,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:59,544 INFO L130 PetriNetUnfolder]: 1010/1600 cut-off events. [2022-12-06 04:14:59,544 INFO L131 PetriNetUnfolder]: For 4884/4884 co-relation queries the response was YES. [2022-12-06 04:14:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7139 conditions, 1600 events. 1010/1600 cut-off events. For 4884/4884 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7085 event pairs, 107 based on Foata normal form. 1/1601 useless extension candidates. Maximal degree in co-relation 7109. Up to 1098 conditions per place. [2022-12-06 04:14:59,549 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 68 selfloop transitions, 19 changer transitions 18/105 dead transitions. [2022-12-06 04:14:59,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 978 flow [2022-12-06 04:14:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 04:14:59,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5391304347826087 [2022-12-06 04:14:59,550 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 426 flow. Second operand 5 states and 62 transitions. [2022-12-06 04:14:59,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 978 flow [2022-12-06 04:14:59,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 817 flow, removed 35 selfloop flow, removed 11 redundant places. [2022-12-06 04:14:59,563 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-06 04:14:59,563 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2022-12-06 04:14:59,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:59,563 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:59,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:59,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,586 INFO L130 PetriNetUnfolder]: 150/355 cut-off events. [2022-12-06 04:14:59,587 INFO L131 PetriNetUnfolder]: For 693/753 co-relation queries the response was YES. [2022-12-06 04:14:59,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 355 events. 150/355 cut-off events. For 693/753 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1884 event pairs, 4 based on Foata normal form. 15/350 useless extension candidates. Maximal degree in co-relation 1197. Up to 106 conditions per place. [2022-12-06 04:14:59,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 04:14:59,591 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:59,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:14:59,592 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 476 flow [2022-12-06 04:14:59,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:59,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:59,592 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:14:59,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:14:59,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash -300085650, now seen corresponding path program 2 times [2022-12-06 04:14:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:59,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128296256] [2022-12-06 04:14:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:59,728 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:14:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128296256] [2022-12-06 04:14:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128296256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:59,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323704457] [2022-12-06 04:14:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:59,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:14:59,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:59,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:59,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:14:59,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:59,874 INFO L130 PetriNetUnfolder]: 930/1565 cut-off events. [2022-12-06 04:14:59,874 INFO L131 PetriNetUnfolder]: For 5075/5161 co-relation queries the response was YES. [2022-12-06 04:14:59,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6632 conditions, 1565 events. 930/1565 cut-off events. For 5075/5161 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7969 event pairs, 143 based on Foata normal form. 26/1539 useless extension candidates. Maximal degree in co-relation 6607. Up to 746 conditions per place. [2022-12-06 04:14:59,878 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 38 selfloop transitions, 1 changer transitions 54/99 dead transitions. [2022-12-06 04:14:59,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 858 flow [2022-12-06 04:14:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:14:59,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2022-12-06 04:14:59,879 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 476 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:14:59,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 858 flow [2022-12-06 04:14:59,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 854 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 04:14:59,892 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 281 flow [2022-12-06 04:14:59,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2022-12-06 04:14:59,892 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-06 04:14:59,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:59,892 INFO L89 Accepts]: Start accepts. Operand has 62 places, 41 transitions, 281 flow [2022-12-06 04:14:59,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:59,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:59,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 41 transitions, 281 flow [2022-12-06 04:14:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 41 transitions, 281 flow [2022-12-06 04:14:59,902 INFO L130 PetriNetUnfolder]: 64/167 cut-off events. [2022-12-06 04:14:59,902 INFO L131 PetriNetUnfolder]: For 535/569 co-relation queries the response was YES. [2022-12-06 04:14:59,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 167 events. 64/167 cut-off events. For 535/569 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 719 event pairs, 1 based on Foata normal form. 8/166 useless extension candidates. Maximal degree in co-relation 552. Up to 50 conditions per place. [2022-12-06 04:14:59,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 41 transitions, 281 flow [2022-12-06 04:14:59,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:15:00,123 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:15:00,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 04:15:00,124 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 278 flow [2022-12-06 04:15:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:00,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:00,124 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:15:00,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:15:00,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:15:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -336190347, now seen corresponding path program 1 times [2022-12-06 04:15:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:00,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622247485] [2022-12-06 04:15:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:00,426 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:15:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:00,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622247485] [2022-12-06 04:15:00,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622247485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:00,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:00,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:15:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272274080] [2022-12-06 04:15:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:00,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:15:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:15:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:15:00,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:15:00,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 278 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:15:00,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:00,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:15:00,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:00,529 INFO L130 PetriNetUnfolder]: 274/504 cut-off events. [2022-12-06 04:15:00,529 INFO L131 PetriNetUnfolder]: For 2451/2472 co-relation queries the response was YES. [2022-12-06 04:15:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 504 events. 274/504 cut-off events. For 2451/2472 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2258 event pairs, 35 based on Foata normal form. 5/502 useless extension candidates. Maximal degree in co-relation 2240. Up to 221 conditions per place. [2022-12-06 04:15:00,531 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 37 selfloop transitions, 4 changer transitions 38/82 dead transitions. [2022-12-06 04:15:00,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 771 flow [2022-12-06 04:15:00,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:15:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:15:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 04:15:00,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45217391304347826 [2022-12-06 04:15:00,532 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 278 flow. Second operand 5 states and 52 transitions. [2022-12-06 04:15:00,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 771 flow [2022-12-06 04:15:00,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 666 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-12-06 04:15:00,537 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 247 flow [2022-12-06 04:15:00,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2022-12-06 04:15:00,538 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:15:00,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:00,538 INFO L89 Accepts]: Start accepts. Operand has 55 places, 39 transitions, 247 flow [2022-12-06 04:15:00,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:00,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:00,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 39 transitions, 247 flow [2022-12-06 04:15:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 39 transitions, 247 flow [2022-12-06 04:15:00,550 INFO L130 PetriNetUnfolder]: 62/159 cut-off events. [2022-12-06 04:15:00,550 INFO L131 PetriNetUnfolder]: For 249/259 co-relation queries the response was YES. [2022-12-06 04:15:00,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 159 events. 62/159 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 663 event pairs, 1 based on Foata normal form. 8/162 useless extension candidates. Maximal degree in co-relation 506. Up to 50 conditions per place. [2022-12-06 04:15:00,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 247 flow [2022-12-06 04:15:00,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:15:00,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:15:00,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 04:15:00,850 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 251 flow [2022-12-06 04:15:00,850 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:15:00,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:00,850 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:15:00,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:15:00,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:15:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash -700127632, now seen corresponding path program 1 times [2022-12-06 04:15:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:00,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676596240] [2022-12-06 04:15:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:00,966 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:15:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676596240] [2022-12-06 04:15:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676596240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:00,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:00,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:15:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722357710] [2022-12-06 04:15:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:00,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:15:00,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:00,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:00,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:15:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:01,039 INFO L130 PetriNetUnfolder]: 151/309 cut-off events. [2022-12-06 04:15:01,040 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-12-06 04:15:01,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 309 events. 151/309 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1286 event pairs, 13 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 1363. Up to 155 conditions per place. [2022-12-06 04:15:01,041 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 34 selfloop transitions, 1 changer transitions 24/60 dead transitions. [2022-12-06 04:15:01,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 495 flow [2022-12-06 04:15:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:15:01,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-06 04:15:01,042 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 251 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:15:01,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 495 flow [2022-12-06 04:15:01,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 485 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:15:01,044 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 193 flow [2022-12-06 04:15:01,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2022-12-06 04:15:01,045 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 04:15:01,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:01,045 INFO L89 Accepts]: Start accepts. Operand has 54 places, 32 transitions, 193 flow [2022-12-06 04:15:01,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:01,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:01,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 32 transitions, 193 flow [2022-12-06 04:15:01,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 32 transitions, 193 flow [2022-12-06 04:15:01,054 INFO L130 PetriNetUnfolder]: 30/91 cut-off events. [2022-12-06 04:15:01,055 INFO L131 PetriNetUnfolder]: For 235/245 co-relation queries the response was YES. [2022-12-06 04:15:01,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 91 events. 30/91 cut-off events. For 235/245 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 300 event pairs, 1 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 290. Up to 30 conditions per place. [2022-12-06 04:15:01,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 32 transitions, 193 flow [2022-12-06 04:15:01,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 04:15:01,371 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:15:01,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 04:15:01,372 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 202 flow [2022-12-06 04:15:01,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:01,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:01,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:01,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:15:01,372 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:15:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1912652468, now seen corresponding path program 1 times [2022-12-06 04:15:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401165691] [2022-12-06 04:15:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:15:01,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:15:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:15:01,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:15:01,425 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:15:01,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:15:01,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:15:01,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:15:01,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:15:01,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:15:01,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:15:01,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:15:01,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:15:01,427 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:01,431 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:15:01,431 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:15:01,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:15:01 BasicIcfg [2022-12-06 04:15:01,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:15:01,480 INFO L158 Benchmark]: Toolchain (without parser) took 16662.22ms. Allocated memory was 190.8MB in the beginning and 864.0MB in the end (delta: 673.2MB). Free memory was 166.1MB in the beginning and 717.3MB in the end (delta: -551.2MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.90ms. Allocated memory is still 190.8MB. Free memory was 166.1MB in the beginning and 138.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 190.8MB. Free memory was 138.9MB in the beginning and 136.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: RCFGBuilder took 754.45ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 103.2MB in the end (delta: 31.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,480 INFO L158 Benchmark]: TraceAbstraction took 15310.95ms. Allocated memory was 190.8MB in the beginning and 864.0MB in the end (delta: 673.2MB). Free memory was 102.3MB in the beginning and 717.3MB in the end (delta: -615.0MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2022-12-06 04:15:01,481 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 511.90ms. Allocated memory is still 190.8MB. Free memory was 166.1MB in the beginning and 138.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 190.8MB. Free memory was 138.9MB in the beginning and 136.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 754.45ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 103.2MB in the end (delta: 31.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 15310.95ms. Allocated memory was 190.8MB in the beginning and 864.0MB in the end (delta: 673.2MB). Free memory was 102.3MB in the beginning and 717.3MB in the end (delta: -615.0MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2331, independent: 2269, independent conditional: 2269, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2331, independent: 2269, independent conditional: 0, independent unconditional: 2269, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2331, independent: 2269, independent conditional: 0, independent unconditional: 2269, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2331, independent: 2269, independent conditional: 0, independent unconditional: 2269, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1828, independent: 1783, independent conditional: 0, independent unconditional: 1783, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1769, independent conditional: 0, independent unconditional: 1769, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2331, independent: 486, independent conditional: 0, independent unconditional: 486, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 3142, Positive cache size: 3097, Positive conditional cache size: 0, Positive unconditional cache size: 3097, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 129, independent conditional: 129, 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: 153, independent: 129, independent conditional: 7, independent unconditional: 122, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 129, independent conditional: 7, independent unconditional: 122, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 129, independent conditional: 7, independent unconditional: 122, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 138, independent: 118, independent conditional: 6, independent unconditional: 112, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 138, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 61, dependent conditional: 18, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 138, unknown conditional: 9, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 118, Positive conditional cache size: 6, Positive unconditional cache size: 112, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 148, independent conditional: 28, independent unconditional: 120, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 140, Positive conditional cache size: 6, Positive unconditional cache size: 134, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 157, independent conditional: 4, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, independent: 151, independent conditional: 0, independent unconditional: 151, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 146, Positive conditional cache size: 6, Positive unconditional cache size: 140, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 258, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 258, independent: 239, independent conditional: 65, independent unconditional: 174, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 258, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 258, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 152, Positive conditional cache size: 6, Positive unconditional cache size: 146, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, independent: 442, independent conditional: 442, 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: 476, independent: 442, independent conditional: 222, independent unconditional: 220, dependent: 34, dependent conditional: 7, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 476, independent: 442, independent conditional: 101, independent unconditional: 341, 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: 476, independent: 442, independent conditional: 101, independent unconditional: 341, 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: 7, independent: 7, independent conditional: 4, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, independent: 435, independent conditional: 97, independent unconditional: 338, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 13, Positive unconditional cache size: 166, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 128, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 55 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 473, independent: 435, independent conditional: 435, 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: 473, independent: 435, independent conditional: 213, independent unconditional: 222, 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: 473, independent: 435, independent conditional: 112, independent unconditional: 323, 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: 473, independent: 435, independent conditional: 112, independent unconditional: 323, 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: 2, independent: 2, independent conditional: 2, 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: 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.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: 473, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 181, Positive conditional cache size: 15, Positive unconditional cache size: 166, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 113, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 159, independent conditional: 159, 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: 177, independent: 159, independent conditional: 77, independent unconditional: 82, 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: 177, independent: 159, independent conditional: 39, independent unconditional: 120, 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: 177, independent: 159, independent conditional: 39, independent unconditional: 120, 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: 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: 177, independent: 159, independent conditional: 39, independent unconditional: 120, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 181, Positive conditional cache size: 15, Positive unconditional cache size: 166, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 308, independent: 292, independent conditional: 186, independent unconditional: 106, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 292, independent conditional: 54, independent unconditional: 238, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, independent: 292, independent conditional: 54, independent unconditional: 238, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 308, independent: 292, independent conditional: 54, independent unconditional: 238, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 181, Positive conditional cache size: 15, Positive unconditional cache size: 166, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 148, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 603, independent: 567, independent conditional: 567, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 603, independent: 567, independent conditional: 315, independent unconditional: 252, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 615, independent: 567, independent conditional: 133, independent unconditional: 434, 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: 615, independent: 567, independent conditional: 133, independent unconditional: 434, 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: 2, independent: 2, independent conditional: 2, 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: 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.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: 615, independent: 565, independent conditional: 131, independent unconditional: 434, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 183, Positive conditional cache size: 17, Positive unconditional cache size: 166, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 218, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 63 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 324, independent conditional: 324, 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: 354, independent: 324, independent conditional: 252, independent unconditional: 72, dependent: 30, dependent conditional: 24, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 324, independent conditional: 175, independent unconditional: 149, 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: 366, independent: 324, independent conditional: 175, independent unconditional: 149, 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: 5, independent: 5, independent conditional: 5, 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: 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: 366, independent: 319, independent conditional: 170, independent unconditional: 149, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 197, Positive conditional cache size: 22, Positive unconditional cache size: 175, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 113, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 120, independent unconditional: 32, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 152, independent conditional: 64, independent unconditional: 88, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 64, independent unconditional: 88, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 168, independent: 151, independent conditional: 63, independent unconditional: 88, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 198, Positive conditional cache size: 23, Positive unconditional cache size: 175, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 61 PlacesBefore, 59 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 120, independent conditional: 90, independent unconditional: 30, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 250, Positive conditional cache size: 23, Positive unconditional cache size: 227, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 53 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 40, independent unconditional: 8, 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: 48, independent: 48, independent conditional: 40, independent unconditional: 8, 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: 48, independent: 48, independent conditional: 40, independent unconditional: 8, 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): 321, Positive cache size: 298, Positive conditional cache size: 23, Positive unconditional cache size: 275, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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.3s, 52 PlacesBefore, 50 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 8, 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: 9, independent: 9, independent conditional: 7, independent unconditional: 2, 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: 9, independent: 9, independent conditional: 7, independent unconditional: 2, 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: 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] , 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: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 360, Positive conditional cache size: 24, Positive unconditional cache size: 336, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, 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; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-2, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-1, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=1, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 [L757] 1 x = 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 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: 15.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 419 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1159 IncrementalHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 31 mSDtfsCounter, 1159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:15:01,530 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...