/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:06:46,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:06:46,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:06:46,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:06:46,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:06:46,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:06:46,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:06:46,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:06:46,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:06:46,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:06:46,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:06:46,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:06:46,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:06:46,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:06:46,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:06:46,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:06:46,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:06:46,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:06:46,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:06:46,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:06:46,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:06:46,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:06:46,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:06:46,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:06:46,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:06:46,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:06:46,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:06:46,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:06:46,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:06:46,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:06:46,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:06:46,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:06:46,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:06:46,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:06:46,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:06:46,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:06:46,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:06:46,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:06:46,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:06:46,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:06:46,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:06:46,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:06:46,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:06:46,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:06:46,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:06:46,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:06:46,410 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:06:46,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:06:46,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:06:46,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:06:46,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:06:46,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:06:46,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:06:46,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:46,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:06:46,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:06:46,413 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-05 23:06:46,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:06:46,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:06:46,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:06:46,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:06:46,671 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:06:46,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:47,601 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:06:47,866 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:06:47,867 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:47,884 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2194ac425/214416944bec403499bad1232ae258dd/FLAGd58e9798f [2022-12-05 23:06:48,163 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2194ac425/214416944bec403499bad1232ae258dd [2022-12-05 23:06:48,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:06:48,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:06:48,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:48,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:06:48,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:06:48,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223228e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48, skipping insertion in model container [2022-12-05 23:06:48,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:06:48,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:06:48,305 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/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:06:48,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:48,441 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:06:48,449 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/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:06:48,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:48,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:48,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:48,509 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:06:48,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48 WrapperNode [2022-12-05 23:06:48,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:48,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:48,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:06:48,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:06:48,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,568 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 23:06:48,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:48,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:06:48,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:06:48,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:06:48,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:06:48,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:06:48,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:06:48,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:06:48,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (1/1) ... [2022-12-05 23:06:48,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:06:48,652 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-05 23:06:48,679 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-05 23:06:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:06:48,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:06:48,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:06:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:06:48,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:06:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:06:48,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:06:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:06:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:06:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:06:48,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:06:48,691 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:06:48,850 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:06:48,851 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:06:49,172 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:06:49,337 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:06:49,337 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:06:49,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:49 BoogieIcfgContainer [2022-12-05 23:06:49,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:06:49,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:06:49,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:06:49,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:06:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:06:48" (1/3) ... [2022-12-05 23:06:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f257dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:49, skipping insertion in model container [2022-12-05 23:06:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:48" (2/3) ... [2022-12-05 23:06:49,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f257dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:49, skipping insertion in model container [2022-12-05 23:06:49,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:49" (3/3) ... [2022-12-05 23:06:49,344 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:49,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:06:49,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:06:49,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:06:49,404 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:06:49,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 23:06:49,495 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 23:06:49,496 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:06:49,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 23:06:49,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-05 23:06:49,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:49,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 23:06:49,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-05 23:06:49,577 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 23:06:49,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:49,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:06:49,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 23:06:49,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-05 23:06:53,509 INFO L203 LiptonReduction]: Total number of compositions: 94 [2022-12-05 23:06:53,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:06:53,523 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;@68d4b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:06:53,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:06:53,525 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:06:53,525 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:53,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:53,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:06:53,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 532952, now seen corresponding path program 1 times [2022-12-05 23:06:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877243720] [2022-12-05 23:06:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:53,813 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-05 23:06:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877243720] [2022-12-05 23:06:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877243720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:53,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:06:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886419982] [2022-12-05 23:06:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:53,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:53,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 23:06:53,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 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-05 23:06:53,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:53,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 23:06:53,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:54,635 INFO L130 PetriNetUnfolder]: 6050/8374 cut-off events. [2022-12-05 23:06:54,636 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-05 23:06:54,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16773 conditions, 8374 events. 6050/8374 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 42659 event pairs, 2306 based on Foata normal form. 0/7642 useless extension candidates. Maximal degree in co-relation 16761. Up to 6574 conditions per place. [2022-12-05 23:06:54,670 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 41 selfloop transitions, 2 changer transitions 10/56 dead transitions. [2022-12-05 23:06:54,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 239 flow [2022-12-05 23:06:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-05 23:06:54,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-05 23:06:54,680 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-05 23:06:54,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 239 flow [2022-12-05 23:06:54,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:06:54,684 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:54,685 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=66, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-05 23:06:54,687 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-05 23:06:54,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:54,688 INFO L89 Accepts]: Start accepts. Operand has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:54,689 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:54,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:54,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:54,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:54,694 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-05 23:06:54,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:54,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 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/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:06:54,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:54,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-05 23:06:54,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:54,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-05 23:06:54,783 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-05 23:06:54,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:54,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:54,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:06:54,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1787877241, now seen corresponding path program 1 times [2022-12-05 23:06:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:54,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656231294] [2022-12-05 23:06:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:54,994 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-05 23:06:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656231294] [2022-12-05 23:06:54,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656231294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:54,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:54,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:06:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137586997] [2022-12-05 23:06:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:54,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:54,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:54,997 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-05 23:06:54,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:54,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:54,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:56,446 INFO L130 PetriNetUnfolder]: 13530/18448 cut-off events. [2022-12-05 23:06:56,446 INFO L131 PetriNetUnfolder]: For 932/932 co-relation queries the response was YES. [2022-12-05 23:06:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38229 conditions, 18448 events. 13530/18448 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 95840 event pairs, 5412 based on Foata normal form. 587/19035 useless extension candidates. Maximal degree in co-relation 38219. Up to 9251 conditions per place. [2022-12-05 23:06:56,534 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-12-05 23:06:56,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-05 23:06:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 23:06:56,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-05 23:06:56,536 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-05 23:06:56,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-05 23:06:56,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:56,538 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,538 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-05 23:06:56,539 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-05 23:06:56,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:56,539 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,540 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:56,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:56,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,587 INFO L130 PetriNetUnfolder]: 284/708 cut-off events. [2022-12-05 23:06:56,588 INFO L131 PetriNetUnfolder]: For 91/104 co-relation queries the response was YES. [2022-12-05 23:06:56,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 708 events. 284/708 cut-off events. For 91/104 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4844 event pairs, 114 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 1393. Up to 263 conditions per place. [2022-12-05 23:06:56,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-05 23:06:56,630 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:56,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-05 23:06:56,633 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow [2022-12-05 23:06:56,633 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-05 23:06:56,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:56,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:56,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:06:56,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 410378506, now seen corresponding path program 1 times [2022-12-05 23:06:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:56,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704194479] [2022-12-05 23:06:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:56,797 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-05 23:06:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704194479] [2022-12-05 23:06:56,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704194479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:56,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:56,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478889209] [2022-12-05 23:06:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:56,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:56,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:56,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 124 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-05 23:06:56,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:56,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:56,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:58,264 INFO L130 PetriNetUnfolder]: 13208/18015 cut-off events. [2022-12-05 23:06:58,265 INFO L131 PetriNetUnfolder]: For 6940/6940 co-relation queries the response was YES. [2022-12-05 23:06:58,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46391 conditions, 18015 events. 13208/18015 cut-off events. For 6940/6940 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 94133 event pairs, 1386 based on Foata normal form. 45/18060 useless extension candidates. Maximal degree in co-relation 46379. Up to 8772 conditions per place. [2022-12-05 23:06:58,344 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 58 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2022-12-05 23:06:58,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 378 flow [2022-12-05 23:06:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-05 23:06:58,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2022-12-05 23:06:58,346 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 124 flow. Second operand 4 states and 65 transitions. [2022-12-05 23:06:58,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 378 flow [2022-12-05 23:06:58,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:58,366 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2022-12-05 23:06:58,367 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-05 23:06:58,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:58,367 INFO L89 Accepts]: Start accepts. Operand has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,368 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:58,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:58,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,403 INFO L130 PetriNetUnfolder]: 239/614 cut-off events. [2022-12-05 23:06:58,404 INFO L131 PetriNetUnfolder]: For 413/506 co-relation queries the response was YES. [2022-12-05 23:06:58,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 614 events. 239/614 cut-off events. For 413/506 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4017 event pairs, 67 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 1475. Up to 216 conditions per place. [2022-12-05 23:06:58,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-05 23:06:58,425 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:58,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:06:58,426 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 202 flow [2022-12-05 23:06:58,427 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-05 23:06:58,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:58,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:06:58,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 410380428, now seen corresponding path program 1 times [2022-12-05 23:06:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:58,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11233926] [2022-12-05 23:06:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:58,549 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-05 23:06:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11233926] [2022-12-05 23:06:58,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11233926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:58,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:58,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750232078] [2022-12-05 23:06:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:58,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:58,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:58,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 202 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-05 23:06:58,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:58,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:58,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:59,751 INFO L130 PetriNetUnfolder]: 12977/17705 cut-off events. [2022-12-05 23:06:59,751 INFO L131 PetriNetUnfolder]: For 15812/15812 co-relation queries the response was YES. [2022-12-05 23:06:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50069 conditions, 17705 events. 12977/17705 cut-off events. For 15812/15812 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 91943 event pairs, 2500 based on Foata normal form. 34/17739 useless extension candidates. Maximal degree in co-relation 50054. Up to 8637 conditions per place. [2022-12-05 23:06:59,831 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2022-12-05 23:06:59,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 526 flow [2022-12-05 23:06:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 23:06:59,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-05 23:06:59,833 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 202 flow. Second operand 4 states and 69 transitions. [2022-12-05 23:06:59,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 526 flow [2022-12-05 23:06:59,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:06:59,949 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 372 flow [2022-12-05 23:06:59,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2022-12-05 23:06:59,951 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-05 23:06:59,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:59,951 INFO L89 Accepts]: Start accepts. Operand has 50 places, 53 transitions, 372 flow [2022-12-05 23:06:59,952 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:59,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:59,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 53 transitions, 372 flow [2022-12-05 23:06:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 372 flow [2022-12-05 23:06:59,996 INFO L130 PetriNetUnfolder]: 213/545 cut-off events. [2022-12-05 23:06:59,996 INFO L131 PetriNetUnfolder]: For 1005/1254 co-relation queries the response was YES. [2022-12-05 23:06:59,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 545 events. 213/545 cut-off events. For 1005/1254 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3421 event pairs, 29 based on Foata normal form. 1/537 useless extension candidates. Maximal degree in co-relation 1759. Up to 193 conditions per place. [2022-12-05 23:07:00,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 372 flow [2022-12-05 23:07:00,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-05 23:07:00,031 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:00,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-05 23:07:00,034 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 372 flow [2022-12-05 23:07:00,035 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-05 23:07:00,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:00,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:00,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:07:00,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -163168151, now seen corresponding path program 1 times [2022-12-05 23:07:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:00,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79319595] [2022-12-05 23:07:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:00,148 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-05 23:07:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79319595] [2022-12-05 23:07:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79319595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:00,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583619458] [2022-12-05 23:07:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:00,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:00,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:00,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:07:00,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 372 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:00,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:00,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:07:00,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:01,579 INFO L130 PetriNetUnfolder]: 12813/17485 cut-off events. [2022-12-05 23:07:01,580 INFO L131 PetriNetUnfolder]: For 38848/38848 co-relation queries the response was YES. [2022-12-05 23:07:01,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56953 conditions, 17485 events. 12813/17485 cut-off events. For 38848/38848 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 89522 event pairs, 965 based on Foata normal form. 23/17508 useless extension candidates. Maximal degree in co-relation 56933. Up to 8175 conditions per place. [2022-12-05 23:07:01,661 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 70 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2022-12-05 23:07:01,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 808 flow [2022-12-05 23:07:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 23:07:01,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:07:01,662 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 372 flow. Second operand 4 states and 63 transitions. [2022-12-05 23:07:01,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 808 flow [2022-12-05 23:07:01,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 808 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:01,731 INFO L231 Difference]: Finished difference. Result has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=646, PETRI_PLACES=56, PETRI_TRANSITIONS=67} [2022-12-05 23:07:01,732 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2022-12-05 23:07:01,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:01,732 INFO L89 Accepts]: Start accepts. Operand has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,733 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:01,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:01,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,770 INFO L130 PetriNetUnfolder]: 190/502 cut-off events. [2022-12-05 23:07:01,770 INFO L131 PetriNetUnfolder]: For 2080/2482 co-relation queries the response was YES. [2022-12-05 23:07:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 502 events. 190/502 cut-off events. For 2080/2482 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3101 event pairs, 17 based on Foata normal form. 3/500 useless extension candidates. Maximal degree in co-relation 1980. Up to 176 conditions per place. [2022-12-05 23:07:01,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-05 23:07:01,808 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:01,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-05 23:07:01,811 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 67 transitions, 646 flow [2022-12-05 23:07:01,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:01,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:01,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:07:01,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1956535813, now seen corresponding path program 1 times [2022-12-05 23:07:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627759535] [2022-12-05 23:07:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:01,916 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-05 23:07:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:01,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627759535] [2022-12-05 23:07:01,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627759535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:01,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:01,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913737389] [2022-12-05 23:07:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:01,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:01,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:07:01,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 646 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:01,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:01,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:07:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:03,934 INFO L130 PetriNetUnfolder]: 17657/24312 cut-off events. [2022-12-05 23:07:03,935 INFO L131 PetriNetUnfolder]: For 89927/89927 co-relation queries the response was YES. [2022-12-05 23:07:03,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83746 conditions, 24312 events. 17657/24312 cut-off events. For 89927/89927 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 135738 event pairs, 3230 based on Foata normal form. 300/24612 useless extension candidates. Maximal degree in co-relation 83721. Up to 10131 conditions per place. [2022-12-05 23:07:04,029 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 67 selfloop transitions, 37 changer transitions 2/106 dead transitions. [2022-12-05 23:07:04,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 1030 flow [2022-12-05 23:07:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-05 23:07:04,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 23:07:04,031 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 646 flow. Second operand 4 states and 70 transitions. [2022-12-05 23:07:04,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 1030 flow [2022-12-05 23:07:04,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 1030 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:04,133 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=872, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2022-12-05 23:07:04,133 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2022-12-05 23:07:04,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:04,134 INFO L89 Accepts]: Start accepts. Operand has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,134 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:04,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:04,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,174 INFO L130 PetriNetUnfolder]: 184/565 cut-off events. [2022-12-05 23:07:04,174 INFO L131 PetriNetUnfolder]: For 3429/3938 co-relation queries the response was YES. [2022-12-05 23:07:04,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 565 events. 184/565 cut-off events. For 3429/3938 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3907 event pairs, 15 based on Foata normal form. 5/565 useless extension candidates. Maximal degree in co-relation 2508. Up to 176 conditions per place. [2022-12-05 23:07:04,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 944 [2022-12-05 23:07:04,208 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:04,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-05 23:07:04,209 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 872 flow [2022-12-05 23:07:04,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:04,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:04,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:04,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:07:04,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash -763247039, now seen corresponding path program 1 times [2022-12-05 23:07:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392546617] [2022-12-05 23:07:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:04,283 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-05 23:07:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:04,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392546617] [2022-12-05 23:07:04,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392546617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:04,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278444604] [2022-12-05 23:07:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:07:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:07:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:07:04,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:07:04,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:04,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:04,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:07:04,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:05,595 INFO L130 PetriNetUnfolder]: 8643/12996 cut-off events. [2022-12-05 23:07:05,595 INFO L131 PetriNetUnfolder]: For 72087/73621 co-relation queries the response was YES. [2022-12-05 23:07:05,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44444 conditions, 12996 events. 8643/12996 cut-off events. For 72087/73621 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 81046 event pairs, 1789 based on Foata normal form. 898/13815 useless extension candidates. Maximal degree in co-relation 44414. Up to 10950 conditions per place. [2022-12-05 23:07:05,675 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 85 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2022-12-05 23:07:05,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 1492 flow [2022-12-05 23:07:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:07:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:07:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 23:07:05,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-05 23:07:05,676 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 872 flow. Second operand 3 states and 53 transitions. [2022-12-05 23:07:05,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 1492 flow [2022-12-05 23:07:05,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 1488 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:05,701 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2022-12-05 23:07:05,701 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2022-12-05 23:07:05,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:05,701 INFO L89 Accepts]: Start accepts. Operand has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,702 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:05,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:05,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,846 INFO L130 PetriNetUnfolder]: 711/1726 cut-off events. [2022-12-05 23:07:05,847 INFO L131 PetriNetUnfolder]: For 5104/5686 co-relation queries the response was YES. [2022-12-05 23:07:05,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5322 conditions, 1726 events. 711/1726 cut-off events. For 5104/5686 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 14525 event pairs, 264 based on Foata normal form. 10/1604 useless extension candidates. Maximal degree in co-relation 5292. Up to 928 conditions per place. [2022-12-05 23:07:05,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 1116 [2022-12-05 23:07:05,880 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:05,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-05 23:07:05,881 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 903 flow [2022-12-05 23:07:05,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:05,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:05,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:05,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:07:05,881 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1956660181, now seen corresponding path program 1 times [2022-12-05 23:07:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:05,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627057351] [2022-12-05 23:07:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:06,009 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-05 23:07:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:06,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627057351] [2022-12-05 23:07:06,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627057351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:06,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:06,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396929724] [2022-12-05 23:07:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:06,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:06,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:07:06,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 903 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:06,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:06,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:07:06,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:08,122 INFO L130 PetriNetUnfolder]: 15448/22350 cut-off events. [2022-12-05 23:07:08,122 INFO L131 PetriNetUnfolder]: For 118843/118843 co-relation queries the response was YES. [2022-12-05 23:07:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88335 conditions, 22350 events. 15448/22350 cut-off events. For 118843/118843 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 136855 event pairs, 2530 based on Foata normal form. 165/22515 useless extension candidates. Maximal degree in co-relation 88302. Up to 10040 conditions per place. [2022-12-05 23:07:08,214 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 79 selfloop transitions, 38 changer transitions 7/124 dead transitions. [2022-12-05 23:07:08,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 1451 flow [2022-12-05 23:07:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:07:08,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-05 23:07:08,216 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 903 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:07:08,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 1451 flow [2022-12-05 23:07:08,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 124 transitions, 1438 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:08,287 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1106, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2022-12-05 23:07:08,288 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2022-12-05 23:07:08,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:08,288 INFO L89 Accepts]: Start accepts. Operand has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,289 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:08,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:08,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,431 INFO L130 PetriNetUnfolder]: 934/2150 cut-off events. [2022-12-05 23:07:08,431 INFO L131 PetriNetUnfolder]: For 6828/7435 co-relation queries the response was YES. [2022-12-05 23:07:08,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 2150 events. 934/2150 cut-off events. For 6828/7435 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 18395 event pairs, 400 based on Foata normal form. 11/1984 useless extension candidates. Maximal degree in co-relation 6524. Up to 1370 conditions per place. [2022-12-05 23:07:08,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-05 23:07:08,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:08,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-05 23:07:08,467 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 1106 flow [2022-12-05 23:07:08,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:08,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:08,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:08,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:07:08,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1299450553, now seen corresponding path program 1 times [2022-12-05 23:07:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:08,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114074570] [2022-12-05 23:07:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:08,563 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-05 23:07:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:08,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114074570] [2022-12-05 23:07:08,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114074570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:08,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:08,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392108530] [2022-12-05 23:07:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:08,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:08,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:07:08,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 1106 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-05 23:07:08,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:08,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:07:08,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:11,493 INFO L130 PetriNetUnfolder]: 21026/30730 cut-off events. [2022-12-05 23:07:11,493 INFO L131 PetriNetUnfolder]: For 201825/201825 co-relation queries the response was YES. [2022-12-05 23:07:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121705 conditions, 30730 events. 21026/30730 cut-off events. For 201825/201825 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 201289 event pairs, 6690 based on Foata normal form. 168/30898 useless extension candidates. Maximal degree in co-relation 121668. Up to 13920 conditions per place. [2022-12-05 23:07:11,599 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 87 selfloop transitions, 35 changer transitions 13/135 dead transitions. [2022-12-05 23:07:11,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 1844 flow [2022-12-05 23:07:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 23:07:11,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 23:07:11,600 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 1106 flow. Second operand 4 states and 72 transitions. [2022-12-05 23:07:11,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 1844 flow [2022-12-05 23:07:11,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 1842 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:11,719 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1322, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2022-12-05 23:07:11,720 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2022-12-05 23:07:11,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:11,720 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,725 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:11,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:11,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,897 INFO L130 PetriNetUnfolder]: 1253/2802 cut-off events. [2022-12-05 23:07:11,897 INFO L131 PetriNetUnfolder]: For 9104/9508 co-relation queries the response was YES. [2022-12-05 23:07:11,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 2802 events. 1253/2802 cut-off events. For 9104/9508 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 25026 event pairs, 599 based on Foata normal form. 10/2552 useless extension candidates. Maximal degree in co-relation 8071. Up to 1982 conditions per place. [2022-12-05 23:07:11,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-05 23:07:11,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:11,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-05 23:07:11,945 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 1322 flow [2022-12-05 23:07:11,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-05 23:07:11,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:11,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:11,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:07:11,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 110736689, now seen corresponding path program 1 times [2022-12-05 23:07:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:11,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142062458] [2022-12-05 23:07:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:12,041 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-05 23:07:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:12,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142062458] [2022-12-05 23:07:12,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142062458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070129289] [2022-12-05 23:07:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:12,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:12,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:07:12,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 1322 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:12,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:12,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:07:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:13,570 INFO L130 PetriNetUnfolder]: 8464/13513 cut-off events. [2022-12-05 23:07:13,570 INFO L131 PetriNetUnfolder]: For 84484/84848 co-relation queries the response was YES. [2022-12-05 23:07:13,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49600 conditions, 13513 events. 8464/13513 cut-off events. For 84484/84848 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 94562 event pairs, 1528 based on Foata normal form. 1245/14574 useless extension candidates. Maximal degree in co-relation 49558. Up to 7379 conditions per place. [2022-12-05 23:07:13,631 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 119 selfloop transitions, 9 changer transitions 5/155 dead transitions. [2022-12-05 23:07:13,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 155 transitions, 2724 flow [2022-12-05 23:07:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 23:07:13,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-05 23:07:13,633 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 1322 flow. Second operand 4 states and 73 transitions. [2022-12-05 23:07:13,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 155 transitions, 2724 flow [2022-12-05 23:07:13,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 2718 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:13,667 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1348, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2022-12-05 23:07:13,668 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2022-12-05 23:07:13,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:13,668 INFO L89 Accepts]: Start accepts. Operand has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,669 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:13,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:13,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,832 INFO L130 PetriNetUnfolder]: 762/1972 cut-off events. [2022-12-05 23:07:13,833 INFO L131 PetriNetUnfolder]: For 6435/7087 co-relation queries the response was YES. [2022-12-05 23:07:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7258 conditions, 1972 events. 762/1972 cut-off events. For 6435/7087 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 17380 event pairs, 147 based on Foata normal form. 73/1947 useless extension candidates. Maximal degree in co-relation 7216. Up to 1287 conditions per place. [2022-12-05 23:07:13,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-05 23:07:13,871 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:13,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-05 23:07:13,872 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 1348 flow [2022-12-05 23:07:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:13,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:13,872 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-05 23:07:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:07:13,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2086096785, now seen corresponding path program 1 times [2022-12-05 23:07:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916414649] [2022-12-05 23:07:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:14,016 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-05 23:07:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916414649] [2022-12-05 23:07:14,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916414649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:14,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:14,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:07:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428164185] [2022-12-05 23:07:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:14,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:07:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:07:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:07:14,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:07:14,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 1348 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:14,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:14,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:07:14,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:15,066 INFO L130 PetriNetUnfolder]: 5681/9123 cut-off events. [2022-12-05 23:07:15,066 INFO L131 PetriNetUnfolder]: For 65255/65537 co-relation queries the response was YES. [2022-12-05 23:07:15,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39355 conditions, 9123 events. 5681/9123 cut-off events. For 65255/65537 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 61138 event pairs, 1076 based on Foata normal form. 693/9646 useless extension candidates. Maximal degree in co-relation 39310. Up to 3425 conditions per place. [2022-12-05 23:07:15,116 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 114 selfloop transitions, 13 changer transitions 33/176 dead transitions. [2022-12-05 23:07:15,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 176 transitions, 3044 flow [2022-12-05 23:07:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:07:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:07:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-05 23:07:15,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-05 23:07:15,117 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 1348 flow. Second operand 5 states and 91 transitions. [2022-12-05 23:07:15,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 176 transitions, 3044 flow [2022-12-05 23:07:15,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 176 transitions, 3026 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:15,155 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1104, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2022-12-05 23:07:15,156 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2022-12-05 23:07:15,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:15,156 INFO L89 Accepts]: Start accepts. Operand has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,157 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:15,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:15,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,228 INFO L130 PetriNetUnfolder]: 373/1051 cut-off events. [2022-12-05 23:07:15,228 INFO L131 PetriNetUnfolder]: For 4576/5040 co-relation queries the response was YES. [2022-12-05 23:07:15,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1051 events. 373/1051 cut-off events. For 4576/5040 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8272 event pairs, 19 based on Foata normal form. 74/1071 useless extension candidates. Maximal degree in co-relation 4477. Up to 601 conditions per place. [2022-12-05 23:07:15,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 954 [2022-12-05 23:07:15,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:15,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-05 23:07:15,244 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 1104 flow [2022-12-05 23:07:15,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:15,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:15,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:15,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:07:15,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1660866165, now seen corresponding path program 1 times [2022-12-05 23:07:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:15,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196653317] [2022-12-05 23:07:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:15,402 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-05 23:07:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196653317] [2022-12-05 23:07:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196653317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:07:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426767026] [2022-12-05 23:07:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:15,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:07:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:07:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:07:15,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:07:15,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 1104 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 23:07:15,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:15,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:07:15,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:16,129 INFO L130 PetriNetUnfolder]: 4221/6813 cut-off events. [2022-12-05 23:07:16,129 INFO L131 PetriNetUnfolder]: For 48834/49064 co-relation queries the response was YES. [2022-12-05 23:07:16,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29552 conditions, 6813 events. 4221/6813 cut-off events. For 48834/49064 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 45195 event pairs, 875 based on Foata normal form. 211/6869 useless extension candidates. Maximal degree in co-relation 29506. Up to 2755 conditions per place. [2022-12-05 23:07:16,162 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 52 selfloop transitions, 17 changer transitions 75/147 dead transitions. [2022-12-05 23:07:16,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 2370 flow [2022-12-05 23:07:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:07:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:07:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-05 23:07:16,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-05 23:07:16,163 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 1104 flow. Second operand 6 states and 94 transitions. [2022-12-05 23:07:16,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 2370 flow [2022-12-05 23:07:16,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 147 transitions, 2255 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 23:07:16,378 INFO L231 Difference]: Finished difference. Result has 84 places, 39 transitions, 362 flow [2022-12-05 23:07:16,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=84, PETRI_TRANSITIONS=39} [2022-12-05 23:07:16,378 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2022-12-05 23:07:16,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:16,378 INFO L89 Accepts]: Start accepts. Operand has 84 places, 39 transitions, 362 flow [2022-12-05 23:07:16,379 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:16,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:16,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 39 transitions, 362 flow [2022-12-05 23:07:16,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 39 transitions, 362 flow [2022-12-05 23:07:16,385 INFO L130 PetriNetUnfolder]: 17/55 cut-off events. [2022-12-05 23:07:16,385 INFO L131 PetriNetUnfolder]: For 126/145 co-relation queries the response was YES. [2022-12-05 23:07:16,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 55 events. 17/55 cut-off events. For 126/145 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 95 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 223. Up to 18 conditions per place. [2022-12-05 23:07:16,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 39 transitions, 362 flow [2022-12-05 23:07:16,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-05 23:07:17,120 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:07:17,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 743 [2022-12-05 23:07:17,121 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 33 transitions, 312 flow [2022-12-05 23:07:17,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 23:07:17,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:17,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:17,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:07:17,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash -164942897, now seen corresponding path program 1 times [2022-12-05 23:07:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:17,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505636962] [2022-12-05 23:07:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:18,151 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-05 23:07:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505636962] [2022-12-05 23:07:18,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505636962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:18,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:18,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:07:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104315059] [2022-12-05 23:07:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:18,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:07:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:07:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:07:18,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:07:18,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 33 transitions, 312 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:18,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:18,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:07:18,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:18,363 INFO L130 PetriNetUnfolder]: 489/780 cut-off events. [2022-12-05 23:07:18,363 INFO L131 PetriNetUnfolder]: For 6931/6931 co-relation queries the response was YES. [2022-12-05 23:07:18,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 780 events. 489/780 cut-off events. For 6931/6931 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3076 event pairs, 43 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 3508. Up to 453 conditions per place. [2022-12-05 23:07:18,367 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 48 selfloop transitions, 3 changer transitions 28/79 dead transitions. [2022-12-05 23:07:18,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 809 flow [2022-12-05 23:07:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:07:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:07:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-05 23:07:18,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2022-12-05 23:07:18,372 INFO L175 Difference]: Start difference. First operand has 78 places, 33 transitions, 312 flow. Second operand 6 states and 50 transitions. [2022-12-05 23:07:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 809 flow [2022-12-05 23:07:18,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 510 flow, removed 60 selfloop flow, removed 36 redundant places. [2022-12-05 23:07:18,378 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 161 flow [2022-12-05 23:07:18,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2022-12-05 23:07:18,379 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2022-12-05 23:07:18,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:18,379 INFO L89 Accepts]: Start accepts. Operand has 49 places, 33 transitions, 161 flow [2022-12-05 23:07:18,379 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:18,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:18,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 161 flow [2022-12-05 23:07:18,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 33 transitions, 161 flow [2022-12-05 23:07:18,385 INFO L130 PetriNetUnfolder]: 21/58 cut-off events. [2022-12-05 23:07:18,385 INFO L131 PetriNetUnfolder]: For 56/60 co-relation queries the response was YES. [2022-12-05 23:07:18,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 58 events. 21/58 cut-off events. For 56/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 152. Up to 18 conditions per place. [2022-12-05 23:07:18,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 161 flow [2022-12-05 23:07:18,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:07:18,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:18,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 508 [2022-12-05 23:07:18,887 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 168 flow [2022-12-05 23:07:18,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:18,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:18,887 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-05 23:07:18,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:07:18,887 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:07:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2010682974, now seen corresponding path program 1 times [2022-12-05 23:07:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368579866] [2022-12-05 23:07:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:07:18,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:07:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:07:19,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:07:19,006 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:07:19,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:07:19,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:07:19,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:07:19,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:07:19,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:07:19,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:07:19,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:07:19,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:07:19,009 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:19,013 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:07:19,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:07:19,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:07:19 BasicIcfg [2022-12-05 23:07:19,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:07:19,091 INFO L158 Benchmark]: Toolchain (without parser) took 30925.56ms. Allocated memory was 209.7MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 184.7MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-05 23:07:19,091 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:07:19,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.12ms. Allocated memory is still 209.7MB. Free memory was 184.7MB in the beginning and 156.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:07:19,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.24ms. Allocated memory is still 209.7MB. Free memory was 156.9MB in the beginning and 154.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:07:19,092 INFO L158 Benchmark]: Boogie Preprocessor took 47.64ms. Allocated memory is still 209.7MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:07:19,092 INFO L158 Benchmark]: RCFGBuilder took 722.19ms. Allocated memory is still 209.7MB. Free memory was 152.2MB in the beginning and 113.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-05 23:07:19,092 INFO L158 Benchmark]: TraceAbstraction took 29750.25ms. Allocated memory was 209.7MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 112.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-05 23:07:19,093 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.12ms. Allocated memory is still 209.7MB. Free memory was 184.7MB in the beginning and 156.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.24ms. Allocated memory is still 209.7MB. Free memory was 156.9MB in the beginning and 154.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.64ms. Allocated memory is still 209.7MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 722.19ms. Allocated memory is still 209.7MB. Free memory was 152.2MB in the beginning and 113.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 29750.25ms. Allocated memory was 209.7MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 112.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 134 PlacesBefore, 47 PlacesAfterwards, 123 TransitionsBefore, 35 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2188, independent: 2114, independent conditional: 2114, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2188, independent: 2114, independent conditional: 0, independent unconditional: 2114, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2188, independent: 2114, independent conditional: 0, independent unconditional: 2114, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2188, independent: 2114, independent conditional: 0, independent unconditional: 2114, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1844, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1844, independent: 1756, independent conditional: 0, independent unconditional: 1756, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2188, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1844, unknown conditional: 0, unknown unconditional: 1844] , Statistics on independence cache: Total cache size (in pairs): 2833, Positive cache size: 2773, Positive conditional cache size: 0, Positive unconditional cache size: 2773, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 122, independent conditional: 18, independent unconditional: 104, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 122, independent conditional: 18, independent unconditional: 104, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 122, independent conditional: 18, independent unconditional: 104, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 137, independent: 114, independent conditional: 17, independent unconditional: 97, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 137, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 77, dependent conditional: 48, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 137, unknown conditional: 27, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 114, Positive conditional cache size: 17, Positive unconditional cache size: 97, Negative cache size: 23, Negative conditional cache size: 10, Negative unconditional cache size: 13, 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, 34 TransitionsBefore, 34 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 14, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 136, Positive conditional cache size: 17, Positive unconditional cache size: 119, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 139, independent conditional: 29, independent unconditional: 110, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 150, Positive conditional cache size: 17, Positive unconditional cache size: 133, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 148, independent conditional: 55, independent unconditional: 93, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 150, Positive conditional cache size: 17, Positive unconditional cache size: 133, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 163, independent conditional: 163, 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: 196, independent: 163, independent conditional: 61, independent unconditional: 102, dependent: 33, dependent conditional: 13, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 156, Positive conditional cache size: 17, Positive unconditional cache size: 139, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 74, independent conditional: 74, 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: 111, independent: 74, independent conditional: 27, independent unconditional: 47, dependent: 37, dependent conditional: 25, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 157, Positive conditional cache size: 17, Positive unconditional cache size: 140, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 127, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 73, independent conditional: 21, independent unconditional: 52, dependent: 35, dependent conditional: 16, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 72, independent conditional: 3, independent unconditional: 69, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 158, Positive conditional cache size: 17, Positive unconditional cache size: 141, Negative cache size: 40, Negative conditional cache size: 10, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 66, independent conditional: 22, independent unconditional: 44, dependent: 38, dependent conditional: 20, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 78, dependent conditional: 0, dependent unconditional: 78, 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: 144, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 158, Positive conditional cache size: 17, Positive unconditional cache size: 141, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 154, independent conditional: 52, independent unconditional: 102, dependent: 38, dependent conditional: 8, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 154, independent conditional: 24, independent unconditional: 130, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 154, independent conditional: 24, independent unconditional: 130, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 1, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 139, independent conditional: 23, independent unconditional: 116, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 15, unknown conditional: 1, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 173, Positive conditional cache size: 18, Positive unconditional cache size: 155, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 141, independent conditional: 30, independent unconditional: 111, dependent: 41, dependent conditional: 8, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 214, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 177, Positive conditional cache size: 18, Positive unconditional cache size: 159, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 126, independent conditional: 73, independent unconditional: 53, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 126, independent conditional: 52, independent unconditional: 74, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 126, independent conditional: 52, independent unconditional: 74, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 119, independent conditional: 46, independent unconditional: 73, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 184, Positive conditional cache size: 24, Positive unconditional cache size: 160, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 84 PlacesBefore, 78 PlacesAfterwards, 39 TransitionsBefore, 33 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324, independent: 282, independent conditional: 282, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 324, independent: 282, independent conditional: 236, independent unconditional: 46, dependent: 42, dependent conditional: 18, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 414, independent: 282, independent conditional: 211, independent unconditional: 71, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 414, independent: 282, independent conditional: 211, independent unconditional: 71, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 17, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 414, independent: 256, independent conditional: 194, independent unconditional: 62, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 33, unknown conditional: 17, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 249, Positive conditional cache size: 44, Positive unconditional cache size: 205, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 133, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 48 PlacesBefore, 47 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 214, independent conditional: 214, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 214, independent conditional: 174, independent unconditional: 40, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 214, independent conditional: 156, independent unconditional: 58, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 214, independent conditional: 156, independent unconditional: 58, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 38, independent conditional: 28, independent unconditional: 10, 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: 39, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 179, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 244, independent: 176, independent conditional: 128, independent unconditional: 48, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 39, unknown conditional: 28, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 359, Positive conditional cache size: 72, Positive unconditional cache size: 287, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-3, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=-2, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=1, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=1, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 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: 29.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 35 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1348occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:07:19,139 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...