/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:10:58,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:10:58,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:10:58,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:10:58,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:10:58,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:10:58,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:10:58,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:10:58,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:10:58,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:10:58,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:10:58,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:10:58,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:10:58,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:10:58,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:10:58,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:10:58,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:10:58,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:10:58,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:10:58,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:10:58,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:10:58,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:10:58,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:10:58,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:10:58,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:10:58,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:10:58,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:10:58,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:10:58,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:10:58,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:10:58,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:10:58,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:10:58,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:10:58,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:10:58,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:10:58,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:10:58,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:10:58,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:10:58,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:10:58,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:10:58,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:10:58,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:10:58,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:10:58,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:10:58,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:10:58,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:10:58,324 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:10:58,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:10:58,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:10:58,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:10:58,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:10:58,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:10:58,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:10:58,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:58,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:10:58,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:10:58,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:10:58,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:10:58,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:10:58,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:10:58,600 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:10:58,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-06 04:10:59,651 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:10:59,912 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:10:59,913 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-06 04:10:59,927 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29747d9bd/d454a373f6a94c84b914823182af6f1c/FLAG2d4431317 [2022-12-06 04:10:59,939 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29747d9bd/d454a373f6a94c84b914823182af6f1c [2022-12-06 04:10:59,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:10:59,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:10:59,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:59,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:10:59,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:10:59,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:59" (1/1) ... [2022-12-06 04:10:59,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257025b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:59, skipping insertion in model container [2022-12-06 04:10:59,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:59" (1/1) ... [2022-12-06 04:10:59,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:11:00,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:11:00,162 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/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-06 04:11:00,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:00,365 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:11:00,376 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/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-06 04:11:00,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:00,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:00,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:00,474 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:11:00,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00 WrapperNode [2022-12-06 04:11:00,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:11:00,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:00,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:11:00,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:11:00,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,536 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:11:00,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:00,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:11:00,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:11:00,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:11:00,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:11:00,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:11:00,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:11:00,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:11:00,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (1/1) ... [2022-12-06 04:11:00,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:11:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:11:00,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:11:00,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:11:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:11:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:11:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:11:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:11:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:11:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:11:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:11:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:11:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:11:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:11:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:11:00,662 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:11:00,782 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:11:00,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:11:01,072 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:11:01,175 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:11:01,175 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:11:01,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:01 BoogieIcfgContainer [2022-12-06 04:11:01,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:11:01,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:11:01,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:11:01,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:11:01,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:59" (1/3) ... [2022-12-06 04:11:01,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad5813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:01, skipping insertion in model container [2022-12-06 04:11:01,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:00" (2/3) ... [2022-12-06 04:11:01,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad5813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:01, skipping insertion in model container [2022-12-06 04:11:01,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:01" (3/3) ... [2022-12-06 04:11:01,185 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-12-06 04:11:01,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:11:01,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:11:01,199 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:11:01,245 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:11:01,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:11:01,337 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:11:01,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:01,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:11:01,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:11:01,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 04:11:01,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:01,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:11:01,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 04:11:01,444 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:11:01,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:01,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:11:01,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:11:01,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 3000 [2022-12-06 04:11:05,712 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:11:05,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:11:05,733 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;@55c56ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:11:05,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:11:05,740 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:11:05,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:05,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:05,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:11:05,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 513024378, now seen corresponding path program 1 times [2022-12-06 04:11:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070690107] [2022-12-06 04:11:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070690107] [2022-12-06 04:11:06,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070690107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:06,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:06,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850869288] [2022-12-06 04:11:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:06,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:06,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 04:11:06,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 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 04:11:06,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:06,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 04:11:06,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:06,892 INFO L130 PetriNetUnfolder]: 5631/7904 cut-off events. [2022-12-06 04:11:06,892 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:11:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15752 conditions, 7904 events. 5631/7904 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 40682 event pairs, 2088 based on Foata normal form. 0/7260 useless extension candidates. Maximal degree in co-relation 15740. Up to 6124 conditions per place. [2022-12-06 04:11:06,928 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2022-12-06 04:11:06,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 222 flow [2022-12-06 04:11:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 04:11:06,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 04:11:06,938 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 66 transitions. [2022-12-06 04:11:06,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 222 flow [2022-12-06 04:11:06,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:11:06,942 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-06 04:11:06,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 04:11:06,945 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:11:06,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:06,946 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 68 flow [2022-12-06 04:11:06,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:06,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:06,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 68 flow [2022-12-06 04:11:06,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:11:06,953 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:11:06,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:06,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:11:06,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:11:06,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-06 04:11:07,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:11:07,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 04:11:07,083 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:11:07,083 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 04:11:07,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:07,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:07,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:11:07,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -269496721, now seen corresponding path program 1 times [2022-12-06 04:11:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:07,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291260721] [2022-12-06 04:11:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:07,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291260721] [2022-12-06 04:11:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291260721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372749794] [2022-12-06 04:11:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:07,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:11:07,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:07,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:07,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:11:07,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:08,483 INFO L130 PetriNetUnfolder]: 11225/15342 cut-off events. [2022-12-06 04:11:08,483 INFO L131 PetriNetUnfolder]: For 792/792 co-relation queries the response was YES. [2022-12-06 04:11:08,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31828 conditions, 15342 events. 11225/15342 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 77099 event pairs, 3963 based on Foata normal form. 368/15710 useless extension candidates. Maximal degree in co-relation 31818. Up to 10655 conditions per place. [2022-12-06 04:11:08,561 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2022-12-06 04:11:08,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 224 flow [2022-12-06 04:11:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:11:08,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-06 04:11:08,563 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:11:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 224 flow [2022-12-06 04:11:08,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:08,565 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-06 04:11:08,566 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 04:11:08,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:08,566 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:08,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:08,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,590 INFO L130 PetriNetUnfolder]: 126/345 cut-off events. [2022-12-06 04:11:08,591 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-06 04:11:08,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 345 events. 126/345 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2090 event pairs, 56 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 652. Up to 187 conditions per place. [2022-12-06 04:11:08,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 04:11:08,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:08,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 04:11:08,605 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2022-12-06 04:11:08,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:08,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:08,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:08,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:11:08,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash 235535855, now seen corresponding path program 1 times [2022-12-06 04:11:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:08,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052098009] [2022-12-06 04:11:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052098009] [2022-12-06 04:11:08,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052098009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:08,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:08,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630831595] [2022-12-06 04:11:08,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:08,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:08,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:11:08,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:08,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:08,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:11:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:10,006 INFO L130 PetriNetUnfolder]: 10397/14226 cut-off events. [2022-12-06 04:11:10,006 INFO L131 PetriNetUnfolder]: For 4696/4696 co-relation queries the response was YES. [2022-12-06 04:11:10,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34718 conditions, 14226 events. 10397/14226 cut-off events. For 4696/4696 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 69552 event pairs, 2875 based on Foata normal form. 180/14406 useless extension candidates. Maximal degree in co-relation 34706. Up to 6993 conditions per place. [2022-12-06 04:11:10,088 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 52 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-12-06 04:11:10,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 302 flow [2022-12-06 04:11:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 04:11:10,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2022-12-06 04:11:10,091 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 55 transitions. [2022-12-06 04:11:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 302 flow [2022-12-06 04:11:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:10,116 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-06 04:11:10,117 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-06 04:11:10,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:10,118 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:10,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:10,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,140 INFO L130 PetriNetUnfolder]: 87/250 cut-off events. [2022-12-06 04:11:10,141 INFO L131 PetriNetUnfolder]: For 85/92 co-relation queries the response was YES. [2022-12-06 04:11:10,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 250 events. 87/250 cut-off events. For 85/92 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1293 event pairs, 25 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 548. Up to 134 conditions per place. [2022-12-06 04:11:10,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-06 04:11:10,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:10,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:11:10,172 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 150 flow [2022-12-06 04:11:10,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:10,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:10,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:10,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:11:10,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1296744778, now seen corresponding path program 1 times [2022-12-06 04:11:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:10,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626508389] [2022-12-06 04:11:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626508389] [2022-12-06 04:11:10,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626508389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:10,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:10,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895046546] [2022-12-06 04:11:10,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:10,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:10,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:10,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:10,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:10,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:10,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:10,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:10,798 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [130#L3-1true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 32#L770true, P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true, 163#true]) [2022-12-06 04:11:10,799 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 04:11:10,799 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:11:10,799 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:11:10,799 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:11:10,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [130#L3-1true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 112#P0EXITtrue, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true, 163#true]) [2022-12-06 04:11:10,858 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,858 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,858 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,858 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 32#L770true, P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 34#L880true, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true, 163#true]) [2022-12-06 04:11:10,859 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([513] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_60) (= v_~__unbuffered_p1_EAX~0_60 0) (= v_~z~0_81 2) (= v_~__unbuffered_p0_EAX~0_97 0) (= 2 v_~__unbuffered_p3_EAX~0_54))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_54, ~z~0=v_~z~0_81, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_54, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z~0=v_~z~0_81, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 32#L770true, P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 125#L838true, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 163#true]) [2022-12-06 04:11:10,859 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:11:10,900 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 34#L880true, 112#P0EXITtrue, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true, 163#true]) [2022-12-06 04:11:10,900 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,900 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,900 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,901 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,901 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([513] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_60) (= v_~__unbuffered_p1_EAX~0_60 0) (= v_~z~0_81 2) (= v_~__unbuffered_p0_EAX~0_97 0) (= 2 v_~__unbuffered_p3_EAX~0_54))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_54, ~z~0=v_~z~0_81, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_54, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z~0=v_~z~0_81, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 47#L795true, P3Thread1of1ForFork0InUse, 43#P2EXITtrue, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 125#L838true, 112#P0EXITtrue, 156#true, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 163#true]) [2022-12-06 04:11:10,901 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,902 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,902 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,902 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:11:10,942 INFO L130 PetriNetUnfolder]: 5006/7431 cut-off events. [2022-12-06 04:11:10,943 INFO L131 PetriNetUnfolder]: For 2583/2745 co-relation queries the response was YES. [2022-12-06 04:11:10,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17540 conditions, 7431 events. 5006/7431 cut-off events. For 2583/2745 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 42578 event pairs, 1111 based on Foata normal form. 221/7362 useless extension candidates. Maximal degree in co-relation 17525. Up to 6185 conditions per place. [2022-12-06 04:11:10,982 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 42 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2022-12-06 04:11:10,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 308 flow [2022-12-06 04:11:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:11:10,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:11:10,984 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 150 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:11:10,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 308 flow [2022-12-06 04:11:10,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:10,989 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:10,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-06 04:11:10,990 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2022-12-06 04:11:10,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:10,991 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:10,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:10,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:10,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:11,050 INFO L130 PetriNetUnfolder]: 369/847 cut-off events. [2022-12-06 04:11:11,052 INFO L131 PetriNetUnfolder]: For 149/196 co-relation queries the response was YES. [2022-12-06 04:11:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 847 events. 369/847 cut-off events. For 149/196 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5855 event pairs, 152 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 1789. Up to 447 conditions per place. [2022-12-06 04:11:11,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:11,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 04:11:11,091 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:11,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 04:11:11,099 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 180 flow [2022-12-06 04:11:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:11,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:11,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:11,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:11:11,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -950756234, now seen corresponding path program 1 times [2022-12-06 04:11:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:11,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779313531] [2022-12-06 04:11:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779313531] [2022-12-06 04:11:11,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779313531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:11,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:11,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265797855] [2022-12-06 04:11:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:11,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:11,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:11,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:11,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:11,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:11,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:11,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:11,645 INFO L130 PetriNetUnfolder]: 2725/4306 cut-off events. [2022-12-06 04:11:11,645 INFO L131 PetriNetUnfolder]: For 1686/1745 co-relation queries the response was YES. [2022-12-06 04:11:11,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11928 conditions, 4306 events. 2725/4306 cut-off events. For 1686/1745 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24100 event pairs, 535 based on Foata normal form. 303/4503 useless extension candidates. Maximal degree in co-relation 11911. Up to 1959 conditions per place. [2022-12-06 04:11:11,668 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 57 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2022-12-06 04:11:11,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 434 flow [2022-12-06 04:11:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 04:11:11,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-06 04:11:11,670 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 180 flow. Second operand 4 states and 74 transitions. [2022-12-06 04:11:11,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 434 flow [2022-12-06 04:11:11,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:11,673 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 04:11:11,674 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2022-12-06 04:11:11,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:11,674 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:11,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:11,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,709 INFO L130 PetriNetUnfolder]: 220/565 cut-off events. [2022-12-06 04:11:11,709 INFO L131 PetriNetUnfolder]: For 248/444 co-relation queries the response was YES. [2022-12-06 04:11:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 565 events. 220/565 cut-off events. For 248/444 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3570 event pairs, 45 based on Foata normal form. 17/553 useless extension candidates. Maximal degree in co-relation 1542. Up to 302 conditions per place. [2022-12-06 04:11:11,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 04:11:11,717 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:11,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 04:11:11,718 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 227 flow [2022-12-06 04:11:11,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:11,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:11,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:11,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:11:11,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2090882154, now seen corresponding path program 1 times [2022-12-06 04:11:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:11,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971450774] [2022-12-06 04:11:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971450774] [2022-12-06 04:11:11,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971450774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730479362] [2022-12-06 04:11:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:11,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:11,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:11:11,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 227 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:11,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:11,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:11:11,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:12,549 INFO L130 PetriNetUnfolder]: 4346/6544 cut-off events. [2022-12-06 04:11:12,550 INFO L131 PetriNetUnfolder]: For 8054/8054 co-relation queries the response was YES. [2022-12-06 04:11:12,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21192 conditions, 6544 events. 4346/6544 cut-off events. For 8054/8054 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 34602 event pairs, 480 based on Foata normal form. 65/6609 useless extension candidates. Maximal degree in co-relation 21173. Up to 3130 conditions per place. [2022-12-06 04:11:12,576 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 107 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2022-12-06 04:11:12,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 128 transitions, 879 flow [2022-12-06 04:11:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 04:11:12,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-06 04:11:12,578 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 227 flow. Second operand 5 states and 93 transitions. [2022-12-06 04:11:12,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 128 transitions, 879 flow [2022-12-06 04:11:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 128 transitions, 821 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:12,585 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2022-12-06 04:11:12,585 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2022-12-06 04:11:12,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:12,586 INFO L89 Accepts]: Start accepts. Operand has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:12,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:12,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,647 INFO L130 PetriNetUnfolder]: 308/792 cut-off events. [2022-12-06 04:11:12,647 INFO L131 PetriNetUnfolder]: For 593/726 co-relation queries the response was YES. [2022-12-06 04:11:12,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 792 events. 308/792 cut-off events. For 593/726 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5520 event pairs, 42 based on Foata normal form. 28/790 useless extension candidates. Maximal degree in co-relation 2228. Up to 394 conditions per place. [2022-12-06 04:11:12,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 04:11:12,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:12,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 04:11:12,668 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 365 flow [2022-12-06 04:11:12,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:12,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:12,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:12,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:11:12,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 878608684, now seen corresponding path program 2 times [2022-12-06 04:11:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:12,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659472587] [2022-12-06 04:11:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:12,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659472587] [2022-12-06 04:11:12,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659472587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:12,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:12,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954749800] [2022-12-06 04:11:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:12,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:11:12,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:12,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:12,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:11:12,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:13,542 INFO L130 PetriNetUnfolder]: 4379/6950 cut-off events. [2022-12-06 04:11:13,543 INFO L131 PetriNetUnfolder]: For 10189/10330 co-relation queries the response was YES. [2022-12-06 04:11:13,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23072 conditions, 6950 events. 4379/6950 cut-off events. For 10189/10330 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 41844 event pairs, 785 based on Foata normal form. 95/6925 useless extension candidates. Maximal degree in co-relation 23050. Up to 3486 conditions per place. [2022-12-06 04:11:13,584 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 70 selfloop transitions, 4 changer transitions 12/101 dead transitions. [2022-12-06 04:11:13,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 733 flow [2022-12-06 04:11:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:11:13,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:11:13,585 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 365 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:11:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 733 flow [2022-12-06 04:11:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 733 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:11:13,600 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-06 04:11:13,600 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-06 04:11:13,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:13,601 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:13,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:13,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,671 INFO L130 PetriNetUnfolder]: 393/976 cut-off events. [2022-12-06 04:11:13,671 INFO L131 PetriNetUnfolder]: For 998/1199 co-relation queries the response was YES. [2022-12-06 04:11:13,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 976 events. 393/976 cut-off events. For 998/1199 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7129 event pairs, 61 based on Foata normal form. 31/959 useless extension candidates. Maximal degree in co-relation 2797. Up to 540 conditions per place. [2022-12-06 04:11:13,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 04:11:13,687 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:13,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 04:11:13,688 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 377 flow [2022-12-06 04:11:13,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:13,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:13,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:13,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:11:13,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1598410072, now seen corresponding path program 3 times [2022-12-06 04:11:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232007989] [2022-12-06 04:11:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232007989] [2022-12-06 04:11:13,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232007989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:13,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:13,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:11:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074413517] [2022-12-06 04:11:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:11:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:11:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:11:13,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:13,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:13,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:13,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:13,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:14,321 INFO L130 PetriNetUnfolder]: 3039/4822 cut-off events. [2022-12-06 04:11:14,321 INFO L131 PetriNetUnfolder]: For 7974/8063 co-relation queries the response was YES. [2022-12-06 04:11:14,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15813 conditions, 4822 events. 3039/4822 cut-off events. For 7974/8063 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28036 event pairs, 553 based on Foata normal form. 304/5021 useless extension candidates. Maximal degree in co-relation 15789. Up to 1794 conditions per place. [2022-12-06 04:11:14,344 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 79 selfloop transitions, 13 changer transitions 1/112 dead transitions. [2022-12-06 04:11:14,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 846 flow [2022-12-06 04:11:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 04:11:14,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2022-12-06 04:11:14,345 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 377 flow. Second operand 5 states and 92 transitions. [2022-12-06 04:11:14,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 846 flow [2022-12-06 04:11:14,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 822 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:14,354 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2022-12-06 04:11:14,355 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2022-12-06 04:11:14,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:14,355 INFO L89 Accepts]: Start accepts. Operand has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:14,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:14,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,395 INFO L130 PetriNetUnfolder]: 262/655 cut-off events. [2022-12-06 04:11:14,395 INFO L131 PetriNetUnfolder]: For 1029/1300 co-relation queries the response was YES. [2022-12-06 04:11:14,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 655 events. 262/655 cut-off events. For 1029/1300 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4213 event pairs, 8 based on Foata normal form. 44/666 useless extension candidates. Maximal degree in co-relation 2341. Up to 332 conditions per place. [2022-12-06 04:11:14,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 04:11:14,413 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:14,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 04:11:14,413 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 432 flow [2022-12-06 04:11:14,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:14,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:14,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:14,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:11:14,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1734492780, now seen corresponding path program 1 times [2022-12-06 04:11:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001164275] [2022-12-06 04:11:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001164275] [2022-12-06 04:11:14,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001164275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:14,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:14,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967894456] [2022-12-06 04:11:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:14,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:14,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:14,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:11:14,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:14,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:14,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:11:14,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:15,221 INFO L130 PetriNetUnfolder]: 4709/7588 cut-off events. [2022-12-06 04:11:15,222 INFO L131 PetriNetUnfolder]: For 19097/19139 co-relation queries the response was YES. [2022-12-06 04:11:15,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28904 conditions, 7588 events. 4709/7588 cut-off events. For 19097/19139 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47449 event pairs, 852 based on Foata normal form. 35/7537 useless extension candidates. Maximal degree in co-relation 28879. Up to 3596 conditions per place. [2022-12-06 04:11:15,260 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 71 selfloop transitions, 2 changer transitions 35/121 dead transitions. [2022-12-06 04:11:15,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 1054 flow [2022-12-06 04:11:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:11:15,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:11:15,262 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 432 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:11:15,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 1054 flow [2022-12-06 04:11:15,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 964 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 04:11:15,382 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 399 flow [2022-12-06 04:11:15,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-06 04:11:15,383 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-06 04:11:15,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:15,383 INFO L89 Accepts]: Start accepts. Operand has 63 places, 59 transitions, 399 flow [2022-12-06 04:11:15,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:15,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:15,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 399 flow [2022-12-06 04:11:15,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 399 flow [2022-12-06 04:11:15,456 INFO L130 PetriNetUnfolder]: 389/986 cut-off events. [2022-12-06 04:11:15,456 INFO L131 PetriNetUnfolder]: For 1332/1530 co-relation queries the response was YES. [2022-12-06 04:11:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 986 events. 389/986 cut-off events. For 1332/1530 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7131 event pairs, 27 based on Foata normal form. 63/1003 useless extension candidates. Maximal degree in co-relation 2982. Up to 378 conditions per place. [2022-12-06 04:11:15,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 399 flow [2022-12-06 04:11:15,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-06 04:11:15,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:11:15,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 04:11:15,509 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 402 flow [2022-12-06 04:11:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:15,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:15,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:11:15,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -357773004, now seen corresponding path program 2 times [2022-12-06 04:11:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:15,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11925738] [2022-12-06 04:11:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:16,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11925738] [2022-12-06 04:11:16,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11925738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:16,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:16,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532353042] [2022-12-06 04:11:16,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:16,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:11:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:11:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:11:16,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:11:16,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 402 flow. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:16,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:16,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:11:16,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:17,419 INFO L130 PetriNetUnfolder]: 8650/13675 cut-off events. [2022-12-06 04:11:17,420 INFO L131 PetriNetUnfolder]: For 35140/35140 co-relation queries the response was YES. [2022-12-06 04:11:17,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51443 conditions, 13675 events. 8650/13675 cut-off events. For 35140/35140 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 90417 event pairs, 919 based on Foata normal form. 10/13685 useless extension candidates. Maximal degree in co-relation 51417. Up to 4210 conditions per place. [2022-12-06 04:11:17,509 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 183 selfloop transitions, 55 changer transitions 45/283 dead transitions. [2022-12-06 04:11:17,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 283 transitions, 2318 flow [2022-12-06 04:11:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:11:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:11:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2022-12-06 04:11:17,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-06 04:11:17,510 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 402 flow. Second operand 9 states and 164 transitions. [2022-12-06 04:11:17,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 283 transitions, 2318 flow [2022-12-06 04:11:17,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 283 transitions, 2309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:17,822 INFO L231 Difference]: Finished difference. Result has 74 places, 97 transitions, 889 flow [2022-12-06 04:11:17,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=74, PETRI_TRANSITIONS=97} [2022-12-06 04:11:17,824 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2022-12-06 04:11:17,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:17,825 INFO L89 Accepts]: Start accepts. Operand has 74 places, 97 transitions, 889 flow [2022-12-06 04:11:17,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:17,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:17,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 97 transitions, 889 flow [2022-12-06 04:11:17,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 97 transitions, 889 flow [2022-12-06 04:11:18,049 INFO L130 PetriNetUnfolder]: 1184/2859 cut-off events. [2022-12-06 04:11:18,062 INFO L131 PetriNetUnfolder]: For 5548/6066 co-relation queries the response was YES. [2022-12-06 04:11:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9850 conditions, 2859 events. 1184/2859 cut-off events. For 5548/6066 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 25065 event pairs, 187 based on Foata normal form. 209/2912 useless extension candidates. Maximal degree in co-relation 9822. Up to 942 conditions per place. [2022-12-06 04:11:18,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 97 transitions, 889 flow [2022-12-06 04:11:18,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-06 04:11:18,283 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:18,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-06 04:11:18,285 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 96 transitions, 885 flow [2022-12-06 04:11:18,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:18,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:18,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:18,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:11:18,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 480606711, now seen corresponding path program 1 times [2022-12-06 04:11:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:18,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190904396] [2022-12-06 04:11:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190904396] [2022-12-06 04:11:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190904396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:18,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:18,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943443062] [2022-12-06 04:11:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:18,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:11:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:11:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:11:18,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:11:18,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 885 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:18,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:18,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:11:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:19,371 INFO L130 PetriNetUnfolder]: 4896/8043 cut-off events. [2022-12-06 04:11:19,371 INFO L131 PetriNetUnfolder]: For 22461/22995 co-relation queries the response was YES. [2022-12-06 04:11:19,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33216 conditions, 8043 events. 4896/8043 cut-off events. For 22461/22995 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 55466 event pairs, 566 based on Foata normal form. 213/8073 useless extension candidates. Maximal degree in co-relation 33185. Up to 3133 conditions per place. [2022-12-06 04:11:19,412 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 62 selfloop transitions, 17 changer transitions 92/184 dead transitions. [2022-12-06 04:11:19,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 184 transitions, 1857 flow [2022-12-06 04:11:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:11:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:11:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 04:11:19,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2022-12-06 04:11:19,414 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 885 flow. Second operand 6 states and 101 transitions. [2022-12-06 04:11:19,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 184 transitions, 1857 flow [2022-12-06 04:11:19,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 184 transitions, 1829 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 04:11:19,690 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 488 flow [2022-12-06 04:11:19,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2022-12-06 04:11:19,690 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2022-12-06 04:11:19,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:19,691 INFO L89 Accepts]: Start accepts. Operand has 77 places, 60 transitions, 488 flow [2022-12-06 04:11:19,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:19,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:19,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 60 transitions, 488 flow [2022-12-06 04:11:19,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 488 flow [2022-12-06 04:11:19,731 INFO L130 PetriNetUnfolder]: 218/566 cut-off events. [2022-12-06 04:11:19,731 INFO L131 PetriNetUnfolder]: For 1484/1526 co-relation queries the response was YES. [2022-12-06 04:11:19,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 566 events. 218/566 cut-off events. For 1484/1526 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3654 event pairs, 24 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 2210. Up to 153 conditions per place. [2022-12-06 04:11:19,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 60 transitions, 488 flow [2022-12-06 04:11:19,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 04:11:20,089 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:20,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-06 04:11:20,089 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 490 flow [2022-12-06 04:11:20,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:20,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:20,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:20,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:11:20,090 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1346614791, now seen corresponding path program 1 times [2022-12-06 04:11:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:20,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575857675] [2022-12-06 04:11:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:20,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575857675] [2022-12-06 04:11:20,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575857675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:20,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:20,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860137093] [2022-12-06 04:11:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:20,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:20,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:11:20,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:20,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:20,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:11:20,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:20,410 INFO L130 PetriNetUnfolder]: 1132/1927 cut-off events. [2022-12-06 04:11:20,411 INFO L131 PetriNetUnfolder]: For 8238/8260 co-relation queries the response was YES. [2022-12-06 04:11:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 1927 events. 1132/1927 cut-off events. For 8238/8260 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10042 event pairs, 406 based on Foata normal form. 4/1924 useless extension candidates. Maximal degree in co-relation 9005. Up to 1136 conditions per place. [2022-12-06 04:11:20,418 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 43 selfloop transitions, 3 changer transitions 37/85 dead transitions. [2022-12-06 04:11:20,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 859 flow [2022-12-06 04:11:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:11:20,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:11:20,420 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 490 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:11:20,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 859 flow [2022-12-06 04:11:20,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 704 flow, removed 37 selfloop flow, removed 10 redundant places. [2022-12-06 04:11:20,439 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 252 flow [2022-12-06 04:11:20,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-06 04:11:20,440 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-06 04:11:20,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:20,441 INFO L89 Accepts]: Start accepts. Operand has 63 places, 41 transitions, 252 flow [2022-12-06 04:11:20,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:20,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:20,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 41 transitions, 252 flow [2022-12-06 04:11:20,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 41 transitions, 252 flow [2022-12-06 04:11:20,454 INFO L130 PetriNetUnfolder]: 66/169 cut-off events. [2022-12-06 04:11:20,454 INFO L131 PetriNetUnfolder]: For 207/224 co-relation queries the response was YES. [2022-12-06 04:11:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 169 events. 66/169 cut-off events. For 207/224 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 699 event pairs, 9 based on Foata normal form. 5/164 useless extension candidates. Maximal degree in co-relation 507. Up to 52 conditions per place. [2022-12-06 04:11:20,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 41 transitions, 252 flow [2022-12-06 04:11:20,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 04:11:20,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [521] $Ultimate##0-->L815: Formula: (and (= v_~y~0_55 1) (= |v_P2Thread1of1ForFork2_#in~arg.base_25| v_P2Thread1of1ForFork2_~arg.base_25) (= v_P2Thread1of1ForFork2_~arg.offset_25 |v_P2Thread1of1ForFork2_#in~arg.offset_25|) (= v_~z~0_95 1)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_25|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_25|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_25|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_25, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_25, ~z~0=v_~z~0_95, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_25|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0] and [484] $Ultimate##0-->L832: Formula: (and (= v_~z~0_43 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_43, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] [2022-12-06 04:11:21,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L832: Formula: (and (= |v_P3Thread1of1ForFork0_#in~arg.base_17| v_P3Thread1of1ForFork0_~arg.base_17) (= v_P2Thread1of1ForFork2_~arg.offset_33 |v_P2Thread1of1ForFork2_#in~arg.offset_33|) (= v_~y~0_63 1) (= |v_P2Thread1of1ForFork2_#in~arg.base_33| v_P2Thread1of1ForFork2_~arg.base_33) (= v_~z~0_111 2) (= |v_P3Thread1of1ForFork0_#in~arg.offset_17| v_P3Thread1of1ForFork0_~arg.offset_17)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_33|, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_33|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_33|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_33, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_33, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_17|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_17, ~z~0=v_~z~0_111, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_33|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_17|, ~y~0=v_~y~0_63, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0, P3Thread1of1ForFork0_~arg.base] and [383] L815-->L822: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_24) v_~x$r_buff1_thd3~0_23) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_26) v_~x$r_buff0_thd3~0_25) (= (ite .cse4 v_~x$w_buff0~0_49 (ite .cse0 v_~x$w_buff1~0_40 v_~x~0_57)) v_~x~0_56)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:11:21,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L822: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_114 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_108 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_455 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_456 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_421 256) 0)) .cse1))) (and (= (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd3~0_107 256))) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_420 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_114) v_~x$r_buff1_thd3~0_113) (= (ite .cse2 0 v_~x$w_buff0_used~0_456) v_~x$w_buff0_used~0_455) (= v_~y~0_69 1) (= |v_P3Thread1of1ForFork0_#in~arg.offset_19| v_P3Thread1of1ForFork0_~arg.offset_19) (= |v_P2Thread1of1ForFork2_#in~arg.base_37| v_P2Thread1of1ForFork2_~arg.base_37) (= (ite .cse3 0 v_~x$r_buff0_thd3~0_108) v_~x$r_buff0_thd3~0_107) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_421) v_~x$w_buff1_used~0_420) (= v_P2Thread1of1ForFork2_~arg.offset_37 |v_P2Thread1of1ForFork2_#in~arg.offset_37|) (= (ite .cse2 v_~x$w_buff0~0_281 (ite .cse4 v_~x$w_buff1~0_245 v_~x~0_340)) v_~x~0_339) (= v_~z~0_117 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_19| v_P3Thread1of1ForFork0_~arg.base_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_281, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_245, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_19|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_421, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_108, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_37|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_19|, ~x~0=v_~x~0_340, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_456} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_281, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_37|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_37, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_420, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_455, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_37, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_19|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_19, ~z~0=v_~z~0_117, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_37|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_339} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P3Thread1of1ForFork0_~arg.offset, ~x$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0, ~x$w_buff0_used~0, P3Thread1of1ForFork0_~arg.base] and [529] L832-->L838: Formula: (and (= v_~z~0_107 v_~__unbuffered_p3_EAX~0_62) (= v_~a~0_45 v_~__unbuffered_p3_EBX~0_66)) InVars {~a~0=v_~a~0_45, ~z~0=v_~z~0_107} OutVars{~a~0=v_~a~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_66, ~z~0=v_~z~0_107} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0, ~__unbuffered_p3_EBX~0] [2022-12-06 04:11:21,417 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 04:11:21,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 977 [2022-12-06 04:11:21,418 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 271 flow [2022-12-06 04:11:21,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:21,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:21,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:21,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:11:21,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1140597056, now seen corresponding path program 1 times [2022-12-06 04:11:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:21,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947329897] [2022-12-06 04:11:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:21,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:11:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:21,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:11:21,510 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:11:21,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:11:21,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:11:21,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:11:21,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:11:21,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:11:21,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:11:21,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:11:21,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:11:21,514 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:21,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:11:21,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:11:21,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:11:21 BasicIcfg [2022-12-06 04:11:21,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:11:21,611 INFO L158 Benchmark]: Toolchain (without parser) took 21668.62ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 184.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 309.3MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,611 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:11:21,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.13ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 157.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 209.7MB. Free memory was 157.1MB in the beginning and 154.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,611 INFO L158 Benchmark]: Boogie Preprocessor took 42.35ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,612 INFO L158 Benchmark]: RCFGBuilder took 597.58ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 117.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,612 INFO L158 Benchmark]: TraceAbstraction took 20430.63ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 116.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 241.2MB. Max. memory is 8.0GB. [2022-12-06 04:11:21,613 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.10ms. Allocated memory is still 209.7MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.13ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 157.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 209.7MB. Free memory was 157.1MB in the beginning and 154.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.35ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 597.58ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 117.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20430.63ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 116.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 241.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 137 PlacesBefore, 47 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 2431, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1953, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1953, independent: 1876, independent conditional: 0, independent unconditional: 1876, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2500, independent: 526, independent conditional: 0, independent unconditional: 526, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1953, unknown conditional: 0, unknown unconditional: 1953] , Statistics on independence cache: Total cache size (in pairs): 3192, Positive cache size: 3144, Positive conditional cache size: 0, Positive unconditional cache size: 3144, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 341, independent: 284, independent conditional: 284, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 341, independent: 284, independent conditional: 25, independent unconditional: 259, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 341, independent: 284, independent conditional: 25, independent unconditional: 259, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 341, independent: 284, independent conditional: 25, independent unconditional: 259, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 163, independent: 138, independent conditional: 13, independent unconditional: 125, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 163, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 93, dependent conditional: 11, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, independent: 146, independent conditional: 12, independent unconditional: 134, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 163, unknown conditional: 15, unknown unconditional: 148] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 139, Positive conditional cache size: 13, Positive unconditional cache size: 126, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 121, independent conditional: 14, independent unconditional: 107, dependent: 19, dependent conditional: 14, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 121, independent conditional: 2, independent unconditional: 119, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 121, independent conditional: 2, independent unconditional: 119, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 13, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 109, independent conditional: 2, independent unconditional: 107, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 151, Positive conditional cache size: 13, Positive unconditional cache size: 138, 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: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 159, independent conditional: 14, independent unconditional: 145, dependent: 24, dependent conditional: 9, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 162, Positive conditional cache size: 13, Positive unconditional cache size: 149, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 104, independent conditional: 12, independent unconditional: 92, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 104, independent conditional: 12, independent unconditional: 92, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 104, independent conditional: 12, independent unconditional: 92, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 103, independent conditional: 12, independent unconditional: 91, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 163, Positive conditional cache size: 13, Positive unconditional cache size: 150, 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: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 98, independent conditional: 15, independent unconditional: 83, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 165, Positive conditional cache size: 14, Positive unconditional cache size: 151, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 82, independent conditional: 82, 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: 114, independent: 82, independent conditional: 44, independent unconditional: 38, dependent: 32, dependent conditional: 26, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 82, independent conditional: 6, independent unconditional: 76, 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: 114, independent: 82, independent conditional: 6, independent unconditional: 76, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 82, independent conditional: 6, independent unconditional: 76, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 165, Positive conditional cache size: 14, Positive unconditional cache size: 151, 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: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 51, independent conditional: 45, independent unconditional: 6, dependent: 33, dependent conditional: 27, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 84, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 165, Positive conditional cache size: 14, Positive unconditional cache size: 151, 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: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 55, independent conditional: 49, independent unconditional: 6, dependent: 37, dependent conditional: 28, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 55, independent conditional: 6, independent unconditional: 49, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 55, independent conditional: 6, independent unconditional: 49, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, independent: 55, independent conditional: 6, independent unconditional: 49, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 165, Positive conditional cache size: 14, Positive unconditional cache size: 151, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 86, independent conditional: 73, independent unconditional: 13, dependent: 54, dependent conditional: 38, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 86, independent conditional: 12, independent unconditional: 74, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 86, independent conditional: 12, independent unconditional: 74, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 78, independent conditional: 11, independent unconditional: 67, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 185, Positive conditional cache size: 16, Positive unconditional cache size: 169, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 74 PlacesBefore, 74 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 154, independent conditional: 154, 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: 154, independent: 154, independent conditional: 110, independent unconditional: 44, 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: 154, independent: 154, independent conditional: 82, independent unconditional: 72, 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: 154, independent: 154, independent conditional: 82, independent unconditional: 72, 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: 24, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 154, independent: 130, independent conditional: 64, independent unconditional: 66, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 18, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 253, Positive conditional cache size: 38, Positive unconditional cache size: 215, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, 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.4s, 73 PlacesBefore, 70 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 125, independent conditional: 125, 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: 125, independent: 125, independent conditional: 80, independent unconditional: 45, 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: 125, independent: 125, independent conditional: 65, independent unconditional: 60, 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: 125, independent: 125, independent conditional: 65, independent unconditional: 60, 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: 125, independent: 125, independent conditional: 65, independent unconditional: 60, 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): 360, Positive cache size: 326, Positive conditional cache size: 45, Positive unconditional cache size: 281, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, 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: 1.0s, 60 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 37 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 83, independent conditional: 83, 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: 83, independent: 83, independent conditional: 60, independent unconditional: 23, 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: 83, independent: 83, independent conditional: 56, independent unconditional: 27, 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: 83, independent: 83, independent conditional: 56, independent unconditional: 27, 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: 27, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 83, independent: 56, independent conditional: 32, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27, unknown conditional: 24, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 452, Positive conditional cache size: 76, Positive unconditional cache size: 376, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, 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; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-2, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-1, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=1, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 [L814] 3 z = 1 [L831] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 869]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 35 mSDtfsCounter, 1169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=889occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:11:21,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...