/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:41:29,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:41:29,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:41:29,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:41:29,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:41:29,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:41:29,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:41:29,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:41:29,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:41:29,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:41:29,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:41:29,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:41:29,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:41:29,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:41:29,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:41:29,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:41:29,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:41:29,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:41:29,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:41:29,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:41:29,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:41:29,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:41:29,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:41:29,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:41:29,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:41:29,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:41:29,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:41:29,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:41:29,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:41:29,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:41:29,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:41:29,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:41:29,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:41:29,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:41:29,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:41:29,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:41:29,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:41:29,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:41:29,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:41:29,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:41:29,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:41:29,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:41:29,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:41:29,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:41:29,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:41:29,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:41:29,246 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:41:29,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:41:29,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:41:29,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:41:29,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:41:29,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:41:29,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:41:29,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:41:29,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:41:29,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:41:29,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:41:29,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:41:29,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:41:29,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:41:29,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:41:29,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:41:29,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:41:29,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:41:29,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:41:29,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:41:29,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:41:29,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:41:29,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:41:29,537 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:41:29,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2022-12-06 06:41:30,659 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:41:30,909 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:41:30,910 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2022-12-06 06:41:30,921 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0691f98d0/9a5ee07c00f54831ae9d02ef71fae637/FLAG4e3bb41fb [2022-12-06 06:41:30,933 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0691f98d0/9a5ee07c00f54831ae9d02ef71fae637 [2022-12-06 06:41:30,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:41:30,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:41:30,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:41:30,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:41:30,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:41:30,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:41:30" (1/1) ... [2022-12-06 06:41:30,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454e8ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:30, skipping insertion in model container [2022-12-06 06:41:30,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:41:30" (1/1) ... [2022-12-06 06:41:30,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:41:30,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:41:31,116 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/safe019_rmo.oepc.i[993,1006] [2022-12-06 06:41:31,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:41:31,322 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:41:31,329 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/safe019_rmo.oepc.i[993,1006] [2022-12-06 06:41:31,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:31,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:41:31,425 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:41:31,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31 WrapperNode [2022-12-06 06:41:31,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:41:31,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:41:31,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:41:31,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:41:31,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,488 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-12-06 06:41:31,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:41:31,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:41:31,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:41:31,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:41:31,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:41:31,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:41:31,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:41:31,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:41:31,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (1/1) ... [2022-12-06 06:41:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:41:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:41:31,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:41:31,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:41:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:41:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:41:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:41:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:41:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:41:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:41:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:41:31,595 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:41:31,702 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:41:31,703 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:41:32,047 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:41:32,310 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:41:32,310 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:41:32,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:41:32 BoogieIcfgContainer [2022-12-06 06:41:32,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:41:32,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:41:32,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:41:32,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:41:32,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:41:30" (1/3) ... [2022-12-06 06:41:32,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee272d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:41:32, skipping insertion in model container [2022-12-06 06:41:32,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:31" (2/3) ... [2022-12-06 06:41:32,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee272d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:41:32, skipping insertion in model container [2022-12-06 06:41:32,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:41:32" (3/3) ... [2022-12-06 06:41:32,320 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i [2022-12-06 06:41:32,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:41:32,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:41:32,338 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:41:32,417 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:41:32,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2022-12-06 06:41:32,604 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2022-12-06 06:41:32,604 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:32,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 06:41:32,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2022-12-06 06:41:32,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2022-12-06 06:41:32,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:32,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-06 06:41:32,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2022-12-06 06:41:32,698 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2022-12-06 06:41:32,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:32,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 46 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:41:32,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-06 06:41:32,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-06 06:41:41,365 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 06:41:41,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:41:41,380 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;@28544a8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:41:41,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:41:41,385 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 06:41:41,385 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:41,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:41,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:41,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1618426206, now seen corresponding path program 1 times [2022-12-06 06:41:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351728518] [2022-12-06 06:41:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:41,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351728518] [2022-12-06 06:41:41,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351728518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:41,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:41,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962346368] [2022-12-06 06:41:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:41,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:41:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:41:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:41:41,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:41:41,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 06:41:41,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:41,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:41:41,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:42,045 INFO L130 PetriNetUnfolder]: 1667/2351 cut-off events. [2022-12-06 06:41:42,045 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:41:42,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 2351 events. 1667/2351 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10177 event pairs, 1667 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 4783. Up to 2341 conditions per place. [2022-12-06 06:41:42,077 INFO L137 encePairwiseOnDemand]: 23/24 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-12-06 06:41:42,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 100 flow [2022-12-06 06:41:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:41:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:41:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-12-06 06:41:42,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:41:42,102 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 26 transitions. [2022-12-06 06:41:42,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 100 flow [2022-12-06 06:41:42,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:41:42,121 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2022-12-06 06:41:42,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 06:41:42,126 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:41:42,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:42,127 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 54 flow [2022-12-06 06:41:42,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:42,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:42,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 54 flow [2022-12-06 06:41:42,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 54 flow [2022-12-06 06:41:42,153 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:41:42,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:42,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:41:42,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 54 flow [2022-12-06 06:41:42,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 06:41:42,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:42,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 06:41:42,288 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 54 flow [2022-12-06 06:41:42,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 06:41:42,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:42,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:42,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:41:42,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash 529444057, now seen corresponding path program 1 times [2022-12-06 06:41:42,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:42,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226534789] [2022-12-06 06:41:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:42,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226534789] [2022-12-06 06:41:42,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226534789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:42,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:42,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846046035] [2022-12-06 06:41:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:42,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:41:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:41:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:41:42,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:41:42,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:42,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:42,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:41:42,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:43,134 INFO L130 PetriNetUnfolder]: 1556/2321 cut-off events. [2022-12-06 06:41:43,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:43,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 2321 events. 1556/2321 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11388 event pairs, 314 based on Foata normal form. 36/2356 useless extension candidates. Maximal degree in co-relation 4606. Up to 1801 conditions per place. [2022-12-06 06:41:43,151 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 30 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 06:41:43,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2022-12-06 06:41:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:41:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:41:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:41:43,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 06:41:43,152 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 54 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:41:43,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2022-12-06 06:41:43,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:41:43,155 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 06:41:43,155 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-06 06:41:43,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:43,156 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:43,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:43,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,163 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:41:43,163 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:43,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:41:43,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:43,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:41:43,166 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 62 flow [2022-12-06 06:41:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:43,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:43,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:41:43,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash -767104959, now seen corresponding path program 1 times [2022-12-06 06:41:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624464230] [2022-12-06 06:41:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624464230] [2022-12-06 06:41:43,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624464230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:43,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:43,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:41:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081156446] [2022-12-06 06:41:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:43,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:41:43,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:43,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:43,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:41:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:43,897 INFO L130 PetriNetUnfolder]: 2757/4014 cut-off events. [2022-12-06 06:41:43,898 INFO L131 PetriNetUnfolder]: For 356/356 co-relation queries the response was YES. [2022-12-06 06:41:43,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8523 conditions, 4014 events. 2757/4014 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20546 event pairs, 493 based on Foata normal form. 144/4154 useless extension candidates. Maximal degree in co-relation 8512. Up to 1660 conditions per place. [2022-12-06 06:41:43,910 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 42 selfloop transitions, 3 changer transitions 5/51 dead transitions. [2022-12-06 06:41:43,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 227 flow [2022-12-06 06:41:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 06:41:43,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-06 06:41:43,911 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 62 flow. Second operand 4 states and 56 transitions. [2022-12-06 06:41:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 227 flow [2022-12-06 06:41:43,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:43,912 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 06:41:43,913 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 06:41:43,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:43,913 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:43,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:43,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,918 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:41:43,918 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 06:41:43,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 23 events. 0/23 cut-off events. For 4/5 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/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:43,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:41:43,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:43,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:41:43,993 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2022-12-06 06:41:43,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:43,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:43,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:43,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:41:43,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1989568686, now seen corresponding path program 1 times [2022-12-06 06:41:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:43,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43745699] [2022-12-06 06:41:43,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43745699] [2022-12-06 06:41:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43745699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:44,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:44,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442128248] [2022-12-06 06:41:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:44,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:41:44,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 06:41:44,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:44,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:41:44,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:45,058 INFO L130 PetriNetUnfolder]: 1250/1834 cut-off events. [2022-12-06 06:41:45,059 INFO L131 PetriNetUnfolder]: For 794/794 co-relation queries the response was YES. [2022-12-06 06:41:45,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 1834 events. 1250/1834 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7840 event pairs, 426 based on Foata normal form. 32/1866 useless extension candidates. Maximal degree in co-relation 4261. Up to 1383 conditions per place. [2022-12-06 06:41:45,073 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 44 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-06 06:41:45,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 248 flow [2022-12-06 06:41:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:41:45,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2022-12-06 06:41:45,076 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:41:45,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 248 flow [2022-12-06 06:41:45,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 226 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:41:45,079 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 91 flow [2022-12-06 06:41:45,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 06:41:45,080 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 06:41:45,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:45,080 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 91 flow [2022-12-06 06:41:45,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:45,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:45,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 91 flow [2022-12-06 06:41:45,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 91 flow [2022-12-06 06:41:45,092 INFO L130 PetriNetUnfolder]: 8/52 cut-off events. [2022-12-06 06:41:45,092 INFO L131 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-12-06 06:41:45,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 8/52 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 5 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 90. Up to 18 conditions per place. [2022-12-06 06:41:45,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 91 flow [2022-12-06 06:41:45,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:41:45,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:45,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 06:41:45,244 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 93 flow [2022-12-06 06:41:45,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 06:41:45,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:45,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:41:45,245 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -530065477, now seen corresponding path program 1 times [2022-12-06 06:41:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:45,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080186274] [2022-12-06 06:41:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:46,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080186274] [2022-12-06 06:41:46,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080186274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:46,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:46,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823431063] [2022-12-06 06:41:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:46,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:41:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:41:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:41:46,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:41:46,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 93 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:46,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:46,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:41:46,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:46,708 INFO L130 PetriNetUnfolder]: 1238/1838 cut-off events. [2022-12-06 06:41:46,708 INFO L131 PetriNetUnfolder]: For 734/734 co-relation queries the response was YES. [2022-12-06 06:41:46,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 1838 events. 1238/1838 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8068 event pairs, 381 based on Foata normal form. 4/1842 useless extension candidates. Maximal degree in co-relation 4587. Up to 1547 conditions per place. [2022-12-06 06:41:46,718 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 40 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2022-12-06 06:41:46,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 245 flow [2022-12-06 06:41:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:41:46,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-06 06:41:46,720 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 93 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:41:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 245 flow [2022-12-06 06:41:46,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:41:46,722 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 119 flow [2022-12-06 06:41:46,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-06 06:41:46,723 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:41:46,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:46,723 INFO L89 Accepts]: Start accepts. Operand has 42 places, 28 transitions, 119 flow [2022-12-06 06:41:46,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:46,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:46,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 119 flow [2022-12-06 06:41:46,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 119 flow [2022-12-06 06:41:46,731 INFO L130 PetriNetUnfolder]: 6/45 cut-off events. [2022-12-06 06:41:46,731 INFO L131 PetriNetUnfolder]: For 42/59 co-relation queries the response was YES. [2022-12-06 06:41:46,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 45 events. 6/45 cut-off events. For 42/59 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 1 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 94. Up to 15 conditions per place. [2022-12-06 06:41:46,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 119 flow [2022-12-06 06:41:46,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 06:41:46,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:46,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 06:41:46,816 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 121 flow [2022-12-06 06:41:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:46,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:46,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:46,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:41:46,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -980012404, now seen corresponding path program 1 times [2022-12-06 06:41:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:46,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584392558] [2022-12-06 06:41:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:47,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584392558] [2022-12-06 06:41:47,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584392558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:47,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:47,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439564052] [2022-12-06 06:41:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:47,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:41:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:41:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:41:47,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:41:47,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 06:41:47,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:47,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:41:47,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:48,015 INFO L130 PetriNetUnfolder]: 1589/2312 cut-off events. [2022-12-06 06:41:48,015 INFO L131 PetriNetUnfolder]: For 1703/1703 co-relation queries the response was YES. [2022-12-06 06:41:48,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5887 conditions, 2312 events. 1589/2312 cut-off events. For 1703/1703 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10427 event pairs, 940 based on Foata normal form. 32/2343 useless extension candidates. Maximal degree in co-relation 5872. Up to 1936 conditions per place. [2022-12-06 06:41:48,031 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 33 selfloop transitions, 15 changer transitions 0/49 dead transitions. [2022-12-06 06:41:48,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 273 flow [2022-12-06 06:41:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:41:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:41:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:41:48,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.416 [2022-12-06 06:41:48,036 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 121 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:41:48,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 273 flow [2022-12-06 06:41:48,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:48,043 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 201 flow [2022-12-06 06:41:48,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-06 06:41:48,046 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 06:41:48,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:48,046 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 201 flow [2022-12-06 06:41:48,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:48,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:48,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 201 flow [2022-12-06 06:41:48,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 201 flow [2022-12-06 06:41:48,085 INFO L130 PetriNetUnfolder]: 70/187 cut-off events. [2022-12-06 06:41:48,085 INFO L131 PetriNetUnfolder]: For 228/239 co-relation queries the response was YES. [2022-12-06 06:41:48,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 187 events. 70/187 cut-off events. For 228/239 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 856 event pairs, 22 based on Foata normal form. 3/184 useless extension candidates. Maximal degree in co-relation 485. Up to 102 conditions per place. [2022-12-06 06:41:48,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 201 flow [2022-12-06 06:41:48,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:41:48,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] $Ultimate##0-->L782: Formula: (let ((.cse7 (= (mod v_~y$w_buff1_used~0_260 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd1~0_68 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd1~0_61 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_262 256) 0))) (let ((.cse4 (= (mod v_~weak$$choice2~0_106 256) 0)) (.cse0 (select |v_#memory_int_303| |v_~#y~0.base_170|)) (.cse8 (not .cse16)) (.cse6 (not .cse14)) (.cse11 (and .cse9 .cse14)) (.cse12 (and .cse7 .cse14))) (let ((.cse2 (or .cse11 .cse16 .cse12)) (.cse3 (and .cse8 .cse6)) (.cse5 (select .cse0 |v_~#y~0.offset_170|)) (.cse1 (not .cse4)) (.cse10 (= (mod v_~y$w_buff0_used~0_261 256) 0)) (.cse13 (= (mod v_~y$w_buff1_used~0_259 256) 0))) (and (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54 |v_~#y~0.offset_170|) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$w_buff1~0_146 v_~y$w_buff1~0_145) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_44) (= 0 v_~y$flush_delayed~0_82) (= (store |v_#memory_int_303| |v_~#y~0.base_170| (store .cse0 |v_~#y~0.offset_170| |v_P0_#t~ite10_32|)) |v_#memory_int_302|) (= v_~y$w_buff0~0_134 v_~y$w_buff0~0_133) (= v_~y$w_buff0_used~0_261 (ite .cse1 v_~y$w_buff0_used~0_262 (ite .cse2 v_~y$w_buff0_used~0_262 (ite .cse3 0 v_~y$w_buff0_used~0_262)))) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (or (and (= v_~__unbuffered_p0_EAX~0_77 |v_P0_#t~mem9_31|) .cse4 (= |v_P0_#t~ite10_32| |v_P0_#t~mem9_31|)) (and (= |v_P0_#t~ite10_32| v_~y$mem_tmp~0_56) (= |v_P0Thread1of1ForFork1_#t~mem9_10| |v_P0_#t~mem9_31|) .cse1)) (or (and (= v_~__unbuffered_p0_EAX~0_77 |v_P0_#t~mem6_49|) (= .cse5 |v_P0_#t~mem6_49|) .cse2) (and (or .cse6 (not .cse7)) .cse8 (or (not .cse9) .cse6) (= |v_P0Thread1of1ForFork1_#t~mem6_10| |v_P0_#t~mem6_49|) (= (ite .cse3 v_~y$w_buff0~0_134 v_~y$w_buff1~0_146) v_~__unbuffered_p0_EAX~0_77))) (= |v_~#y~0.base_170| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54) (= v_~__unbuffered_p0_EAX$read_delayed~0_51 1) (= v_~y$mem_tmp~0_56 .cse5) (= v_~y$w_buff1_used~0_259 (ite .cse1 v_~y$w_buff1_used~0_260 (ite (or .cse10 .cse11 .cse12) v_~y$w_buff1_used~0_260 0))) (= (ite .cse1 v_~y$r_buff0_thd1~0_61 (ite (or .cse10 (and .cse13 .cse14) .cse11) v_~y$r_buff0_thd1~0_61 (ite (and (not .cse10) .cse6) 0 v_~y$r_buff0_thd1~0_61))) v_~y$r_buff0_thd1~0_60) (= (ite .cse1 v_~y$r_buff1_thd1~0_68 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd1~0_60 256) 0))) (or .cse10 (and .cse15 .cse13) (and .cse15 .cse9))) v_~y$r_buff1_thd1~0_68 0)) v_~y$r_buff1_thd1~0_67) (= v_~weak$$choice2~0_106 |v_P0Thread1of1ForFork1_#t~nondet4_10|))))) InVars {~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_262, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_10|, ~#y~0.base=|v_~#y~0.base_170|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_68, ~y$w_buff1~0=v_~y$w_buff1~0_146, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, #memory_int=|v_#memory_int_303|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_260} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_7|, ~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_261, ~#y~0.base=|v_~#y~0.base_170|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_7|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_67, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_133, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54, ~weak$$choice0~0=v_~weak$$choice0~0_44, ~y$w_buff1~0=v_~y$w_buff1~0_145, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_7|, #memory_int=|v_#memory_int_302|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_259} AuxVars[|v_P0_#t~mem9_31|, |v_P0_#t~ite10_32|, |v_P0_#t~mem6_49|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem9, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p0_EAX$read_delayed~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [614] L811-->L819: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_36 256) 0))) (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_32 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_212 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_213 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_214 256) 0))) (let ((.cse1 (not .cse10)) (.cse2 (select |v_#memory_int_219| |v_~#y~0.base_142|)) (.cse3 (and .cse0 .cse11)) (.cse5 (not .cse8)) (.cse6 (not .cse7))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_214) v_~y$w_buff0_used~0_213) (= (store |v_#memory_int_219| |v_~#y~0.base_142| (store .cse2 |v_~#y~0.offset_142| |v_P2_#t~ite13_23|)) |v_#memory_int_218|) (= (ite .cse3 0 v_~y$r_buff0_thd3~0_36) v_~y$r_buff0_thd3~0_35) (let ((.cse4 (= |v_P2Thread1of1ForFork0_#t~mem11_1| |v_P2_#t~mem11_36|))) (or (and (= |v_P2_#t~ite12_29| |v_P2Thread1of1ForFork0_#t~ite12_1|) .cse0 (= |v_P2_#t~ite13_23| v_~y$w_buff0~0_91) .cse4 .cse1) (and (= |v_P2_#t~ite12_29| |v_P2_#t~ite13_23|) (or (and .cse4 .cse5 .cse6 (= v_~y$w_buff1~0_103 |v_P2_#t~ite12_29|)) (and (= |v_P2_#t~ite12_29| |v_P2_#t~mem11_36|) (= (select .cse2 |v_~#y~0.offset_142|) |v_P2_#t~mem11_36|) (or .cse7 .cse8))) (or .cse9 .cse10)))) (= (ite (or .cse3 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_212) v_~y$w_buff1_used~0_211) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_35 256) 0)) .cse11) (and (not (= (mod v_~y$w_buff1_used~0_211 256) 0)) .cse6)) 0 v_~y$r_buff1_thd3~0_32) v_~y$r_buff1_thd3~0_31))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_32, ~#y~0.offset=|v_~#y~0.offset_142|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_103, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_91, #memory_int=|v_#memory_int_219|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_1|, ~#y~0.base=|v_~#y~0.base_142|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~#y~0.offset=|v_~#y~0.offset_142|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_213, ~y$w_buff1~0=v_~y$w_buff1~0_103, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_#t~ite13=|v_P2Thread1of1ForFork0_#t~ite13_1|, #memory_int=|v_#memory_int_218|, ~#y~0.base=|v_~#y~0.base_142|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_211} AuxVars[|v_P2_#t~ite12_29|, |v_P2_#t~ite13_23|, |v_P2_#t~mem11_36|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite12, P2Thread1of1ForFork0_#t~ite13, #memory_int, P2Thread1of1ForFork0_#t~mem11, ~y$w_buff1_used~0] [2022-12-06 06:41:49,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:49,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1926 [2022-12-06 06:41:49,972 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 207 flow [2022-12-06 06:41:49,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 06:41:49,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:49,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:49,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:41:49,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1504559201, now seen corresponding path program 1 times [2022-12-06 06:41:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:49,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198153552] [2022-12-06 06:41:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:50,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198153552] [2022-12-06 06:41:50,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198153552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:50,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:50,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:41:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460050266] [2022-12-06 06:41:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:50,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:50,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:41:50,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:50,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:50,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:41:50,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:50,808 INFO L130 PetriNetUnfolder]: 1607/2353 cut-off events. [2022-12-06 06:41:50,808 INFO L131 PetriNetUnfolder]: For 3095/3095 co-relation queries the response was YES. [2022-12-06 06:41:50,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 2353 events. 1607/2353 cut-off events. For 3095/3095 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10887 event pairs, 990 based on Foata normal form. 16/2368 useless extension candidates. Maximal degree in co-relation 7287. Up to 2044 conditions per place. [2022-12-06 06:41:50,831 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 33 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2022-12-06 06:41:50,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 335 flow [2022-12-06 06:41:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:41:50,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-06 06:41:50,833 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 207 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:41:50,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 335 flow [2022-12-06 06:41:50,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 324 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:41:50,842 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-06 06:41:50,843 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-06 06:41:50,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:50,843 INFO L89 Accepts]: Start accepts. Operand has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:50,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:50,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,903 INFO L130 PetriNetUnfolder]: 96/223 cut-off events. [2022-12-06 06:41:50,903 INFO L131 PetriNetUnfolder]: For 537/548 co-relation queries the response was YES. [2022-12-06 06:41:50,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 223 events. 96/223 cut-off events. For 537/548 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 974 event pairs, 18 based on Foata normal form. 3/224 useless extension candidates. Maximal degree in co-relation 783. Up to 118 conditions per place. [2022-12-06 06:41:50,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 06:41:50,913 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:50,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 06:41:50,918 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 269 flow [2022-12-06 06:41:50,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:50,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:50,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:50,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:41:50,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash 209781933, now seen corresponding path program 2 times [2022-12-06 06:41:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:50,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085254796] [2022-12-06 06:41:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085254796] [2022-12-06 06:41:51,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085254796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:51,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356974423] [2022-12-06 06:41:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:41:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:41:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:41:51,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:41:51,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:51,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:51,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:41:51,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:52,197 INFO L130 PetriNetUnfolder]: 1615/2373 cut-off events. [2022-12-06 06:41:52,197 INFO L131 PetriNetUnfolder]: For 4624/4624 co-relation queries the response was YES. [2022-12-06 06:41:52,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2373 events. 1615/2373 cut-off events. For 4624/4624 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11013 event pairs, 912 based on Foata normal form. 16/2388 useless extension candidates. Maximal degree in co-relation 8257. Up to 1848 conditions per place. [2022-12-06 06:41:52,210 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 36 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2022-12-06 06:41:52,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 419 flow [2022-12-06 06:41:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:41:52,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-06 06:41:52,212 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 269 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:41:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 419 flow [2022-12-06 06:41:52,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 394 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:52,220 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-06 06:41:52,220 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-06 06:41:52,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:52,221 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:52,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:52,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,252 INFO L130 PetriNetUnfolder]: 95/223 cut-off events. [2022-12-06 06:41:52,253 INFO L131 PetriNetUnfolder]: For 614/625 co-relation queries the response was YES. [2022-12-06 06:41:52,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 223 events. 95/223 cut-off events. For 614/625 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 990 event pairs, 18 based on Foata normal form. 3/224 useless extension candidates. Maximal degree in co-relation 863. Up to 118 conditions per place. [2022-12-06 06:41:52,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 06:41:52,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:52,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:41:52,257 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 323 flow [2022-12-06 06:41:52,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:52,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:52,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:41:52,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2060271082, now seen corresponding path program 1 times [2022-12-06 06:41:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505387956] [2022-12-06 06:41:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:52,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505387956] [2022-12-06 06:41:52,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505387956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:52,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:52,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022430461] [2022-12-06 06:41:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:52,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:41:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:41:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:41:52,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:41:52,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 06:41:52,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:52,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:41:52,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:53,389 INFO L130 PetriNetUnfolder]: 1971/2937 cut-off events. [2022-12-06 06:41:53,389 INFO L131 PetriNetUnfolder]: For 6750/6750 co-relation queries the response was YES. [2022-12-06 06:41:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10413 conditions, 2937 events. 1971/2937 cut-off events. For 6750/6750 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14679 event pairs, 820 based on Foata normal form. 32/2968 useless extension candidates. Maximal degree in co-relation 10393. Up to 1808 conditions per place. [2022-12-06 06:41:53,402 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 41 selfloop transitions, 17 changer transitions 0/59 dead transitions. [2022-12-06 06:41:53,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 509 flow [2022-12-06 06:41:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:41:53,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 06:41:53,403 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 323 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:41:53,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 509 flow [2022-12-06 06:41:53,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 475 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 06:41:53,414 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-12-06 06:41:53,414 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-06 06:41:53,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:53,415 INFO L89 Accepts]: Start accepts. Operand has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:53,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:53,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,450 INFO L130 PetriNetUnfolder]: 101/266 cut-off events. [2022-12-06 06:41:53,450 INFO L131 PetriNetUnfolder]: For 787/800 co-relation queries the response was YES. [2022-12-06 06:41:53,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 266 events. 101/266 cut-off events. For 787/800 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1370 event pairs, 20 based on Foata normal form. 3/267 useless extension candidates. Maximal degree in co-relation 999. Up to 135 conditions per place. [2022-12-06 06:41:53,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 06:41:53,455 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:53,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 06:41:53,456 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 387 flow [2022-12-06 06:41:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 06:41:53,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:53,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:53,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:41:53,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 123121874, now seen corresponding path program 2 times [2022-12-06 06:41:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:53,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284439645] [2022-12-06 06:41:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:54,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284439645] [2022-12-06 06:41:54,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284439645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:54,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:54,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940369921] [2022-12-06 06:41:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:54,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:41:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:41:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:41:54,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:41:54,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:54,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:54,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:41:54,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:54,837 INFO L130 PetriNetUnfolder]: 1951/2909 cut-off events. [2022-12-06 06:41:54,837 INFO L131 PetriNetUnfolder]: For 7196/7196 co-relation queries the response was YES. [2022-12-06 06:41:54,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10535 conditions, 2909 events. 1951/2909 cut-off events. For 7196/7196 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14458 event pairs, 796 based on Foata normal form. 8/2916 useless extension candidates. Maximal degree in co-relation 10515. Up to 1572 conditions per place. [2022-12-06 06:41:54,848 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 41 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2022-12-06 06:41:54,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 525 flow [2022-12-06 06:41:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:41:54,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 06:41:54,850 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 387 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:41:54,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 525 flow [2022-12-06 06:41:54,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 503 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:54,856 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2022-12-06 06:41:54,858 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-06 06:41:54,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:54,858 INFO L89 Accepts]: Start accepts. Operand has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:54,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:54,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,894 INFO L130 PetriNetUnfolder]: 100/264 cut-off events. [2022-12-06 06:41:54,895 INFO L131 PetriNetUnfolder]: For 959/968 co-relation queries the response was YES. [2022-12-06 06:41:54,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 264 events. 100/264 cut-off events. For 959/968 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1337 event pairs, 19 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 1037. Up to 134 conditions per place. [2022-12-06 06:41:54,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 06:41:54,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:54,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:41:54,902 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 414 flow [2022-12-06 06:41:54,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:54,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:54,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:54,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:41:54,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2099717712, now seen corresponding path program 1 times [2022-12-06 06:41:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:54,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760662613] [2022-12-06 06:41:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760662613] [2022-12-06 06:41:55,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760662613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:55,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:55,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837871435] [2022-12-06 06:41:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:55,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:55,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:41:55,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 414 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 06:41:55,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:55,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:41:55,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:55,435 INFO L130 PetriNetUnfolder]: 1838/2810 cut-off events. [2022-12-06 06:41:55,436 INFO L131 PetriNetUnfolder]: For 10451/10627 co-relation queries the response was YES. [2022-12-06 06:41:55,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10610 conditions, 2810 events. 1838/2810 cut-off events. For 10451/10627 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14959 event pairs, 344 based on Foata normal form. 388/3193 useless extension candidates. Maximal degree in co-relation 10589. Up to 2031 conditions per place. [2022-12-06 06:41:55,446 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 78 selfloop transitions, 5 changer transitions 53/138 dead transitions. [2022-12-06 06:41:55,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 138 transitions, 1445 flow [2022-12-06 06:41:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:41:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:41:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 06:41:55,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2022-12-06 06:41:55,448 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 414 flow. Second operand 5 states and 82 transitions. [2022-12-06 06:41:55,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 138 transitions, 1445 flow [2022-12-06 06:41:55,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 138 transitions, 1382 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:55,456 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 446 flow [2022-12-06 06:41:55,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=446, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-06 06:41:55,456 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-06 06:41:55,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:55,456 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 446 flow [2022-12-06 06:41:55,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:55,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:55,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 446 flow [2022-12-06 06:41:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 446 flow [2022-12-06 06:41:55,559 INFO L130 PetriNetUnfolder]: 571/1035 cut-off events. [2022-12-06 06:41:55,560 INFO L131 PetriNetUnfolder]: For 2853/2965 co-relation queries the response was YES. [2022-12-06 06:41:55,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 1035 events. 571/1035 cut-off events. For 2853/2965 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 6228 event pairs, 235 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 4013. Up to 572 conditions per place. [2022-12-06 06:41:55,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 446 flow [2022-12-06 06:41:55,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 06:41:55,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:55,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 06:41:55,572 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 446 flow [2022-12-06 06:41:55,572 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 06:41:55,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:55,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:55,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:41:55,572 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 646131801, now seen corresponding path program 1 times [2022-12-06 06:41:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:55,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921589836] [2022-12-06 06:41:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921589836] [2022-12-06 06:41:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921589836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:55,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18400770] [2022-12-06 06:41:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:41:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:41:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:41:55,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:41:55,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 446 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:55,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:55,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:41:55,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:56,041 INFO L130 PetriNetUnfolder]: 1161/1869 cut-off events. [2022-12-06 06:41:56,041 INFO L131 PetriNetUnfolder]: For 7544/7660 co-relation queries the response was YES. [2022-12-06 06:41:56,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 1869 events. 1161/1869 cut-off events. For 7544/7660 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9717 event pairs, 99 based on Foata normal form. 289/2153 useless extension candidates. Maximal degree in co-relation 8534. Up to 875 conditions per place. [2022-12-06 06:41:56,049 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 101 selfloop transitions, 9 changer transitions 53/165 dead transitions. [2022-12-06 06:41:56,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 165 transitions, 1730 flow [2022-12-06 06:41:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:41:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:41:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 06:41:56,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2022-12-06 06:41:56,051 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 446 flow. Second operand 6 states and 99 transitions. [2022-12-06 06:41:56,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 165 transitions, 1730 flow [2022-12-06 06:41:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 165 transitions, 1719 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:56,060 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 507 flow [2022-12-06 06:41:56,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2022-12-06 06:41:56,061 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-06 06:41:56,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:56,061 INFO L89 Accepts]: Start accepts. Operand has 63 places, 57 transitions, 507 flow [2022-12-06 06:41:56,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:56,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:56,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 57 transitions, 507 flow [2022-12-06 06:41:56,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 57 transitions, 507 flow [2022-12-06 06:41:56,140 INFO L130 PetriNetUnfolder]: 287/599 cut-off events. [2022-12-06 06:41:56,140 INFO L131 PetriNetUnfolder]: For 2383/2635 co-relation queries the response was YES. [2022-12-06 06:41:56,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 599 events. 287/599 cut-off events. For 2383/2635 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3437 event pairs, 63 based on Foata normal form. 18/587 useless extension candidates. Maximal degree in co-relation 2889. Up to 321 conditions per place. [2022-12-06 06:41:56,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 57 transitions, 507 flow [2022-12-06 06:41:56,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 06:41:56,148 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:56,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 06:41:56,149 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 507 flow [2022-12-06 06:41:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:56,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:56,149 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 06:41:56,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:41:56,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1799633844, now seen corresponding path program 1 times [2022-12-06 06:41:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:56,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385628318] [2022-12-06 06:41:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:56,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385628318] [2022-12-06 06:41:56,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385628318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:56,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:56,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066587086] [2022-12-06 06:41:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:56,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:56,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:56,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:56,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:41:56,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 06:41:56,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:56,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:41:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:56,540 INFO L130 PetriNetUnfolder]: 692/1158 cut-off events. [2022-12-06 06:41:56,540 INFO L131 PetriNetUnfolder]: For 5348/5402 co-relation queries the response was YES. [2022-12-06 06:41:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 1158 events. 692/1158 cut-off events. For 5348/5402 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5626 event pairs, 44 based on Foata normal form. 139/1292 useless extension candidates. Maximal degree in co-relation 5917. Up to 532 conditions per place. [2022-12-06 06:41:56,546 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 104 selfloop transitions, 13 changer transitions 42/161 dead transitions. [2022-12-06 06:41:56,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 161 transitions, 1733 flow [2022-12-06 06:41:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:41:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:41:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-06 06:41:56,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5934065934065934 [2022-12-06 06:41:56,548 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 507 flow. Second operand 7 states and 108 transitions. [2022-12-06 06:41:56,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 161 transitions, 1733 flow [2022-12-06 06:41:56,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 161 transitions, 1630 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 06:41:56,559 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 471 flow [2022-12-06 06:41:56,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-12-06 06:41:56,561 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-06 06:41:56,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:56,561 INFO L89 Accepts]: Start accepts. Operand has 65 places, 54 transitions, 471 flow [2022-12-06 06:41:56,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:56,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:56,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 54 transitions, 471 flow [2022-12-06 06:41:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions, 471 flow [2022-12-06 06:41:56,593 INFO L130 PetriNetUnfolder]: 128/311 cut-off events. [2022-12-06 06:41:56,593 INFO L131 PetriNetUnfolder]: For 1336/1471 co-relation queries the response was YES. [2022-12-06 06:41:56,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 311 events. 128/311 cut-off events. For 1336/1471 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1541 event pairs, 7 based on Foata normal form. 29/327 useless extension candidates. Maximal degree in co-relation 1384. Up to 160 conditions per place. [2022-12-06 06:41:56,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 54 transitions, 471 flow [2022-12-06 06:41:56,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-06 06:41:56,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:56,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:41:56,600 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 471 flow [2022-12-06 06:41:56,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 06:41:56,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:56,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:56,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:41:56,600 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 920647629, now seen corresponding path program 1 times [2022-12-06 06:41:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:56,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795888570] [2022-12-06 06:41:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795888570] [2022-12-06 06:41:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795888570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:56,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:56,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382066348] [2022-12-06 06:41:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:56,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:41:56,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 471 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 06:41:56,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:56,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:41:56,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:57,039 INFO L130 PetriNetUnfolder]: 1103/1818 cut-off events. [2022-12-06 06:41:57,040 INFO L131 PetriNetUnfolder]: For 8051/8081 co-relation queries the response was YES. [2022-12-06 06:41:57,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8833 conditions, 1818 events. 1103/1818 cut-off events. For 8051/8081 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9076 event pairs, 173 based on Foata normal form. 38/1853 useless extension candidates. Maximal degree in co-relation 8806. Up to 1063 conditions per place. [2022-12-06 06:41:57,051 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 66 selfloop transitions, 2 changer transitions 39/108 dead transitions. [2022-12-06 06:41:57,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 1121 flow [2022-12-06 06:41:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:41:57,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 06:41:57,054 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 471 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:41:57,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 1121 flow [2022-12-06 06:41:57,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 995 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-12-06 06:41:57,080 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2022-12-06 06:41:57,081 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-06 06:41:57,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:57,081 INFO L89 Accepts]: Start accepts. Operand has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:57,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:57,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,144 INFO L130 PetriNetUnfolder]: 202/475 cut-off events. [2022-12-06 06:41:57,144 INFO L131 PetriNetUnfolder]: For 1436/1611 co-relation queries the response was YES. [2022-12-06 06:41:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 475 events. 202/475 cut-off events. For 1436/1611 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2661 event pairs, 14 based on Foata normal form. 36/474 useless extension candidates. Maximal degree in co-relation 1725. Up to 187 conditions per place. [2022-12-06 06:41:57,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-06 06:41:57,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:57,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 06:41:57,153 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 421 flow [2022-12-06 06:41:57,153 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 06:41:57,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:57,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:57,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:41:57,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:41:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 453653166, now seen corresponding path program 1 times [2022-12-06 06:41:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:57,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267357782] [2022-12-06 06:41:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:57,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:57,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267357782] [2022-12-06 06:41:57,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267357782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:57,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:57,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:41:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788067538] [2022-12-06 06:41:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:57,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:41:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:57,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:41:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:41:57,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:41:57,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:57,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:57,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:41:57,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:57,665 INFO L130 PetriNetUnfolder]: 850/1409 cut-off events. [2022-12-06 06:41:57,666 INFO L131 PetriNetUnfolder]: For 4873/4952 co-relation queries the response was YES. [2022-12-06 06:41:57,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1409 events. 850/1409 cut-off events. For 4873/4952 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7210 event pairs, 51 based on Foata normal form. 113/1504 useless extension candidates. Maximal degree in co-relation 6224. Up to 517 conditions per place. [2022-12-06 06:41:57,672 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 77 selfloop transitions, 17 changer transitions 39/135 dead transitions. [2022-12-06 06:41:57,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 135 transitions, 1342 flow [2022-12-06 06:41:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:41:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:41:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-06 06:41:57,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2022-12-06 06:41:57,674 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 421 flow. Second operand 8 states and 98 transitions. [2022-12-06 06:41:57,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 135 transitions, 1342 flow [2022-12-06 06:41:57,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 135 transitions, 1285 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 06:41:57,692 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 376 flow [2022-12-06 06:41:57,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2022-12-06 06:41:57,692 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-12-06 06:41:57,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:57,692 INFO L89 Accepts]: Start accepts. Operand has 69 places, 48 transitions, 376 flow [2022-12-06 06:41:57,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:57,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:57,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 48 transitions, 376 flow [2022-12-06 06:41:57,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 48 transitions, 376 flow [2022-12-06 06:41:57,712 INFO L130 PetriNetUnfolder]: 90/222 cut-off events. [2022-12-06 06:41:57,713 INFO L131 PetriNetUnfolder]: For 597/703 co-relation queries the response was YES. [2022-12-06 06:41:57,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 222 events. 90/222 cut-off events. For 597/703 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1013 event pairs, 0 based on Foata normal form. 6/205 useless extension candidates. Maximal degree in co-relation 877. Up to 77 conditions per place. [2022-12-06 06:41:57,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 48 transitions, 376 flow [2022-12-06 06:41:57,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 06:42:29,096 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:42:29,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31405 [2022-12-06 06:42:29,097 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 370 flow [2022-12-06 06:42:29,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:29,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:29,097 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 06:42:29,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:42:29,097 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:42:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -293602376, now seen corresponding path program 1 times [2022-12-06 06:42:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95304176] [2022-12-06 06:42:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:42:29,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:42:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:42:29,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:42:29,240 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:42:29,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:42:29,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 06:42:29,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:42:29,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:42:29,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 06:42:29,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:42:29,246 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:29,250 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:42:29,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:42:29,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:42:29 BasicIcfg [2022-12-06 06:42:29,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:42:29,347 INFO L158 Benchmark]: Toolchain (without parser) took 58411.43ms. Allocated memory was 219.2MB in the beginning and 936.4MB in the end (delta: 717.2MB). Free memory was 193.7MB in the beginning and 512.1MB in the end (delta: -318.4MB). Peak memory consumption was 399.4MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,347 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory was 195.6MB in the beginning and 195.5MB in the end (delta: 101.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:42:29,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.58ms. Allocated memory is still 219.2MB. Free memory was 193.7MB in the beginning and 165.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.02ms. Allocated memory is still 219.2MB. Free memory was 165.4MB in the beginning and 162.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,347 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 219.2MB. Free memory was 162.8MB in the beginning and 160.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,347 INFO L158 Benchmark]: RCFGBuilder took 790.82ms. Allocated memory is still 219.2MB. Free memory was 160.2MB in the beginning and 92.6MB in the end (delta: 67.6MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,348 INFO L158 Benchmark]: TraceAbstraction took 57031.30ms. Allocated memory was 219.2MB in the beginning and 936.4MB in the end (delta: 717.2MB). Free memory was 92.0MB in the beginning and 512.1MB in the end (delta: -420.1MB). Peak memory consumption was 297.7MB. Max. memory is 8.0GB. [2022-12-06 06:42:29,348 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 219.2MB. Free memory was 195.6MB in the beginning and 195.5MB in the end (delta: 101.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.58ms. Allocated memory is still 219.2MB. Free memory was 193.7MB in the beginning and 165.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.02ms. Allocated memory is still 219.2MB. Free memory was 165.4MB in the beginning and 162.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 219.2MB. Free memory was 162.8MB in the beginning and 160.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 790.82ms. Allocated memory is still 219.2MB. Free memory was 160.2MB in the beginning and 92.6MB in the end (delta: 67.6MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * TraceAbstraction took 57031.30ms. Allocated memory was 219.2MB in the beginning and 936.4MB in the end (delta: 717.2MB). Free memory was 92.0MB in the beginning and 512.1MB in the end (delta: -420.1MB). Peak memory consumption was 297.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 137 PlacesBefore, 36 PlacesAfterwards, 125 TransitionsBefore, 24 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1118, independent: 1067, independent conditional: 1067, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1118, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1118, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1118, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 996, independent: 953, independent conditional: 0, independent unconditional: 953, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 996, independent: 927, independent conditional: 0, independent unconditional: 927, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 416, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 382, dependent conditional: 0, dependent unconditional: 382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1118, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 996, unknown conditional: 0, unknown unconditional: 996] , Statistics on independence cache: Total cache size (in pairs): 1424, Positive cache size: 1381, Positive conditional cache size: 0, Positive unconditional cache size: 1381, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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.0s, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 40, 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: 58, independent: 40, independent conditional: 2, independent unconditional: 38, 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: 58, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 58, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 58, independent: 40, independent conditional: 0, independent unconditional: 40, 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): 60, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 5, independent unconditional: 44, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 70, dependent conditional: 1, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 24, unknown conditional: 2, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 95, independent conditional: 39, independent unconditional: 56, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 95, independent conditional: 10, independent unconditional: 85, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 95, independent conditional: 10, independent unconditional: 85, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 81, independent conditional: 7, independent unconditional: 74, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 18, unknown conditional: 3, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 75, Positive conditional cache size: 3, Positive unconditional cache size: 72, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 49, independent unconditional: 60, dependent: 32, dependent conditional: 14, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 109, independent conditional: 16, independent unconditional: 93, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 16, independent unconditional: 93, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 4, independent unconditional: 9, 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: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 96, independent conditional: 12, independent unconditional: 84, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 15, unknown conditional: 4, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 91, Positive conditional cache size: 7, Positive unconditional cache size: 84, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 184, independent conditional: 184, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 184, independent conditional: 104, independent unconditional: 80, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 184, independent conditional: 69, independent unconditional: 115, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 184, independent conditional: 69, independent unconditional: 115, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 176, independent conditional: 62, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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, 49 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 84, independent conditional: 84, 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: 99, independent: 84, independent conditional: 46, independent unconditional: 38, 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: 99, independent: 84, independent conditional: 28, independent unconditional: 56, 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: 99, independent: 84, independent conditional: 28, independent unconditional: 56, 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: 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: 99, independent: 84, independent conditional: 28, independent unconditional: 56, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 102, independent conditional: 102, 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: 118, independent: 102, independent conditional: 56, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 102, independent conditional: 45, independent unconditional: 57, 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: 118, independent: 102, independent conditional: 45, independent unconditional: 57, 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: 118, independent: 102, independent conditional: 45, independent unconditional: 57, 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): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 142, independent conditional: 142, 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: 158, independent: 142, independent conditional: 78, independent unconditional: 64, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 142, independent conditional: 50, independent unconditional: 92, 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: 158, independent: 142, independent conditional: 50, independent unconditional: 92, 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: 158, independent: 142, independent conditional: 50, independent unconditional: 92, 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): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 140, independent conditional: 140, 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: 156, independent: 140, independent conditional: 76, independent unconditional: 64, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 140, independent conditional: 61, independent unconditional: 79, 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: 156, independent: 140, independent conditional: 61, independent unconditional: 79, 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: 156, independent: 140, independent conditional: 61, independent unconditional: 79, 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): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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.0s, 61 PlacesBefore, 61 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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.0s, 63 PlacesBefore, 63 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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.0s, 62 PlacesBefore, 62 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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: 31.4s, 65 PlacesBefore, 62 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 6, independent unconditional: 10, 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: 16, independent: 16, independent conditional: 6, independent unconditional: 10, 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: 16, independent: 16, independent conditional: 6, independent unconditional: 10, 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): 140, Positive cache size: 107, Positive conditional cache size: 14, Positive unconditional cache size: 93, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2241; [L854] FCALL, FORK 0 pthread_create(&t2241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2241, ((void *)0), P0, ((void *)0))=-1, t2241={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L770] EXPR 1 \read(y) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L770] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L771] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L772] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L773] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L774] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L776] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L778] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L779] EXPR 1 \read(y) [L779] 1 __unbuffered_p0_EAX = y [L780] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L780] 1 y = y$flush_delayed ? y$mem_tmp : y [L781] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2242; [L856] FCALL, FORK 0 pthread_create(&t2242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2242, ((void *)0), P1, ((void *)0))=0, t2241={7:0}, t2242={5:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2243; [L858] FCALL, FORK 0 pthread_create(&t2243, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2243, ((void *)0), P2, ((void *)0))=1, t2241={7:0}, t2242={5:0}, t2243={6:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L859] 0 pthread_t t2244; [L860] FCALL, FORK 0 pthread_create(&t2244, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2244, ((void *)0), P3, ((void *)0))=2, t2241={7:0}, t2242={5:0}, t2243={6:0}, t2244={8:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = x [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L814] EXPR 3 \read(y) [L814] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L831] EXPR 4 \read(y) [L831] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L866] EXPR 0 \read(y) [L866] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 y$flush_delayed = weak$$choice2 [L876] EXPR 0 \read(y) [L876] 0 y$mem_tmp = y [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 \read(y) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L879] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L880] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L881] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L883] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 \read(y) [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L887] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L887] 0 y = y$flush_delayed ? y$mem_tmp : y [L888] 0 y$flush_delayed = (_Bool)0 [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 5 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: 56.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 4 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=12, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:42:29,391 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...