/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:16:20,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:16:20,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:16:20,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:16:20,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:16:20,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:16:20,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:16:20,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:16:20,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:16:20,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:16:20,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:16:20,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:16:20,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:16:20,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:16:20,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:16:20,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:16:20,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:16:20,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:16:20,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:16:20,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:16:20,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:16:20,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:16:20,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:16:20,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:16:20,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:16:20,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:16:20,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:16:20,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:16:20,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:16:20,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:16:20,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:16:20,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:16:20,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:16:20,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:16:20,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:16:20,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:16:20,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:16:20,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:16:20,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:16:20,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:16:20,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:16:20,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:16:21,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:16:21,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:16:21,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:16:21,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:16:21,035 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:16:21,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:16:21,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:16:21,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:16:21,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:16:21,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:16:21,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:16:21,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:16:21,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:16:21,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:16:21,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:16:21,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:16:21,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:21,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:16:21,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:16:21,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:16:21,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:16:21,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:16:21,040 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:16:21,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:16:21,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:16:21,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:16:21,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:16:21,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:16:21,456 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:16:21,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-12-06 04:16:22,624 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:16:22,913 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:16:22,914 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-12-06 04:16:22,928 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0d63f92/39451a6ce9e44152a90b3efbfdb2410a/FLAGbf400fa1b [2022-12-06 04:16:22,945 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0d63f92/39451a6ce9e44152a90b3efbfdb2410a [2022-12-06 04:16:22,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:16:22,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:16:22,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:22,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:16:22,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:16:22,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:22" (1/1) ... [2022-12-06 04:16:22,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c37547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:22, skipping insertion in model container [2022-12-06 04:16:22,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:22" (1/1) ... [2022-12-06 04:16:22,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:16:23,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:16:23,138 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/mix040_tso.oepc.i[949,962] [2022-12-06 04:16:23,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:23,335 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:16:23,342 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/mix040_tso.oepc.i[949,962] [2022-12-06 04:16:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:23,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:23,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:23,423 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:16:23,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23 WrapperNode [2022-12-06 04:16:23,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:23,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:23,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:16:23,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:16:23,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,478 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-06 04:16:23,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:23,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:16:23,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:16:23,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:16:23,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:16:23,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:16:23,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:16:23,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:16:23,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (1/1) ... [2022-12-06 04:16:23,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:16:23,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:16:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:16:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:16:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:16:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:16:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:16:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:16:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:16:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:16:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:16:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:16:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:16:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:16:23,626 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:16:23,770 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:16:23,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:16:24,025 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:16:24,142 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:16:24,143 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:16:24,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:24 BoogieIcfgContainer [2022-12-06 04:16:24,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:16:24,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:16:24,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:16:24,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:16:24,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:16:22" (1/3) ... [2022-12-06 04:16:24,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dcc5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:24, skipping insertion in model container [2022-12-06 04:16:24,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:23" (2/3) ... [2022-12-06 04:16:24,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dcc5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:24, skipping insertion in model container [2022-12-06 04:16:24,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:24" (3/3) ... [2022-12-06 04:16:24,152 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-12-06 04:16:24,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:16:24,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:16:24,165 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:16:24,214 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:16:24,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:16:24,318 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:16:24,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:24,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:16:24,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:16:24,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-06 04:16:24,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:24,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:16:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-06 04:16:24,399 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:16:24,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:24,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:16:24,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:16:24,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 3090 [2022-12-06 04:16:29,516 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:16:29,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:16:29,531 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;@49f24778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:16:29,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:16:29,541 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:16:29,541 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:29,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:29,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:29,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1837258033, now seen corresponding path program 1 times [2022-12-06 04:16:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:29,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895912376] [2022-12-06 04:16:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:29,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895912376] [2022-12-06 04:16:29,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895912376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185819456] [2022-12-06 04:16:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:29,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:29,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:16:29,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:29,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:29,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:16:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:30,596 INFO L130 PetriNetUnfolder]: 4383/6305 cut-off events. [2022-12-06 04:16:30,596 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:16:30,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 6305 events. 4383/6305 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34041 event pairs, 1116 based on Foata normal form. 0/5749 useless extension candidates. Maximal degree in co-relation 12425. Up to 4744 conditions per place. [2022-12-06 04:16:30,635 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 35 selfloop transitions, 2 changer transitions 6/47 dead transitions. [2022-12-06 04:16:30,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 195 flow [2022-12-06 04:16:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 04:16:30,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 04:16:30,645 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 60 transitions. [2022-12-06 04:16:30,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 195 flow [2022-12-06 04:16:30,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:16:30,651 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-06 04:16:30,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:16:30,657 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-06 04:16:30,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:30,658 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 66 flow [2022-12-06 04:16:30,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:30,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:30,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 66 flow [2022-12-06 04:16:30,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:16:30,679 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:16:30,679 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:30,679 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 38 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-06 04:16:30,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:16:30,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:16:30,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:30,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 04:16:30,763 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 04:16:30,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:30,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:30,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:30,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:16:30,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1891007607, now seen corresponding path program 1 times [2022-12-06 04:16:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:30,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825631742] [2022-12-06 04:16:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:31,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825631742] [2022-12-06 04:16:31,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825631742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:31,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:31,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165774286] [2022-12-06 04:16:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:31,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:31,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:16:31,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:31,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:31,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:16:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:32,401 INFO L130 PetriNetUnfolder]: 8660/11917 cut-off events. [2022-12-06 04:16:32,401 INFO L131 PetriNetUnfolder]: For 630/630 co-relation queries the response was YES. [2022-12-06 04:16:32,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24832 conditions, 11917 events. 8660/11917 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 61460 event pairs, 606 based on Foata normal form. 300/12217 useless extension candidates. Maximal degree in co-relation 24822. Up to 9147 conditions per place. [2022-12-06 04:16:32,451 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 51 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-06 04:16:32,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 282 flow [2022-12-06 04:16:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:16:32,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2022-12-06 04:16:32,454 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:16:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 282 flow [2022-12-06 04:16:32,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:32,455 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2022-12-06 04:16:32,456 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2022-12-06 04:16:32,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:32,456 INFO L89 Accepts]: Start accepts. Operand has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:32,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:32,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,592 INFO L130 PetriNetUnfolder]: 701/1279 cut-off events. [2022-12-06 04:16:32,592 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-06 04:16:32,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1279 events. 701/1279 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7683 event pairs, 374 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 2784. Up to 934 conditions per place. [2022-12-06 04:16:32,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 04:16:32,620 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:32,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 04:16:32,623 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 144 flow [2022-12-06 04:16:32,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:32,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:32,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:16:32,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1508306341, now seen corresponding path program 1 times [2022-12-06 04:16:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:32,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890152015] [2022-12-06 04:16:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890152015] [2022-12-06 04:16:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890152015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:32,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:32,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830772319] [2022-12-06 04:16:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:32,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:32,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:16:32,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:32,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:32,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:16:32,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:33,654 INFO L130 PetriNetUnfolder]: 5392/7739 cut-off events. [2022-12-06 04:16:33,655 INFO L131 PetriNetUnfolder]: For 3178/3236 co-relation queries the response was YES. [2022-12-06 04:16:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21345 conditions, 7739 events. 5392/7739 cut-off events. For 3178/3236 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 42004 event pairs, 1324 based on Foata normal form. 78/7686 useless extension candidates. Maximal degree in co-relation 21333. Up to 5251 conditions per place. [2022-12-06 04:16:33,728 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 43 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-06 04:16:33,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 296 flow [2022-12-06 04:16:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 04:16:33,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 04:16:33,730 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 144 flow. Second operand 3 states and 45 transitions. [2022-12-06 04:16:33,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 296 flow [2022-12-06 04:16:33,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:33,733 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 04:16:33,734 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2022-12-06 04:16:33,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:33,734 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:33,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:33,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,875 INFO L130 PetriNetUnfolder]: 652/1194 cut-off events. [2022-12-06 04:16:33,875 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-12-06 04:16:33,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1194 events. 652/1194 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7156 event pairs, 363 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2770. Up to 853 conditions per place. [2022-12-06 04:16:33,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 04:16:33,894 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:33,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 04:16:33,895 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 155 flow [2022-12-06 04:16:33,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:33,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:33,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:16:33,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash 788546687, now seen corresponding path program 1 times [2022-12-06 04:16:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:33,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951902767] [2022-12-06 04:16:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:34,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951902767] [2022-12-06 04:16:34,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951902767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:34,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:34,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741647436] [2022-12-06 04:16:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:34,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:34,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 04:16:34,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:34,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:34,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 04:16:34,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:35,000 INFO L130 PetriNetUnfolder]: 6595/9525 cut-off events. [2022-12-06 04:16:35,001 INFO L131 PetriNetUnfolder]: For 5529/5627 co-relation queries the response was YES. [2022-12-06 04:16:35,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27208 conditions, 9525 events. 6595/9525 cut-off events. For 5529/5627 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 53019 event pairs, 1568 based on Foata normal form. 66/9442 useless extension candidates. Maximal degree in co-relation 27193. Up to 7828 conditions per place. [2022-12-06 04:16:35,047 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 47 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2022-12-06 04:16:35,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 335 flow [2022-12-06 04:16:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 04:16:35,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-06 04:16:35,050 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 155 flow. Second operand 3 states and 47 transitions. [2022-12-06 04:16:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 335 flow [2022-12-06 04:16:35,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:35,056 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2022-12-06 04:16:35,058 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-06 04:16:35,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:35,058 INFO L89 Accepts]: Start accepts. Operand has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:35,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:35,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,189 INFO L130 PetriNetUnfolder]: 824/1514 cut-off events. [2022-12-06 04:16:35,190 INFO L131 PetriNetUnfolder]: For 645/646 co-relation queries the response was YES. [2022-12-06 04:16:35,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3649 conditions, 1514 events. 824/1514 cut-off events. For 645/646 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9320 event pairs, 440 based on Foata normal form. 1/1501 useless extension candidates. Maximal degree in co-relation 3636. Up to 1061 conditions per place. [2022-12-06 04:16:35,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 04:16:35,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:35,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 04:16:35,216 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 180 flow [2022-12-06 04:16:35,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:35,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:35,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:16:35,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1324311423, now seen corresponding path program 1 times [2022-12-06 04:16:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:35,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633320304] [2022-12-06 04:16:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:35,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633320304] [2022-12-06 04:16:35,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633320304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:35,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:35,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614005324] [2022-12-06 04:16:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:35,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 04:16:35,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:35,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:35,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 04:16:35,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:36,387 INFO L130 PetriNetUnfolder]: 6715/9681 cut-off events. [2022-12-06 04:16:36,388 INFO L131 PetriNetUnfolder]: For 7095/7277 co-relation queries the response was YES. [2022-12-06 04:16:36,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28965 conditions, 9681 events. 6715/9681 cut-off events. For 7095/7277 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 53951 event pairs, 1124 based on Foata normal form. 91/9592 useless extension candidates. Maximal degree in co-relation 28949. Up to 6867 conditions per place. [2022-12-06 04:16:36,454 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 57 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2022-12-06 04:16:36,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 471 flow [2022-12-06 04:16:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 04:16:36,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 04:16:36,456 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 180 flow. Second operand 4 states and 63 transitions. [2022-12-06 04:16:36,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 471 flow [2022-12-06 04:16:36,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:36,459 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 267 flow [2022-12-06 04:16:36,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2022-12-06 04:16:36,459 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-06 04:16:36,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:36,460 INFO L89 Accepts]: Start accepts. Operand has 47 places, 48 transitions, 267 flow [2022-12-06 04:16:36,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:36,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:36,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 48 transitions, 267 flow [2022-12-06 04:16:36,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 48 transitions, 267 flow [2022-12-06 04:16:36,599 INFO L130 PetriNetUnfolder]: 871/1584 cut-off events. [2022-12-06 04:16:36,599 INFO L131 PetriNetUnfolder]: For 1377/1472 co-relation queries the response was YES. [2022-12-06 04:16:36,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4505 conditions, 1584 events. 871/1584 cut-off events. For 1377/1472 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9764 event pairs, 372 based on Foata normal form. 34/1599 useless extension candidates. Maximal degree in co-relation 4490. Up to 1121 conditions per place. [2022-12-06 04:16:36,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 48 transitions, 267 flow [2022-12-06 04:16:36,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 04:16:36,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [497] L861-->L869: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_147 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_156 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_254 256) 0)) .cse5)) (.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse0))) (and (= v_~y$r_buff1_thd0~0_146 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_229 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd0~0_155 256) 0)) .cse1)) 0 v_~y$r_buff1_thd0~0_147)) (= v_~y$w_buff1_used~0_229 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_230)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_28 256)) (= v_~y$w_buff0_used~0_253 (ite .cse4 0 v_~y$w_buff0_used~0_254)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~y$r_buff0_thd0~0_155 (ite .cse2 0 v_~y$r_buff0_thd0~0_156)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y~0_192 (ite .cse4 v_~y$w_buff0~0_141 (ite .cse3 v_~y$w_buff1~0_133 v_~y~0_193)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$w_buff1~0=v_~y$w_buff1~0_133, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_193, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$w_buff1~0=v_~y$w_buff1~0_133, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_141, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_192, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_229, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:16:36,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [466] $Ultimate##0-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_48 1) (= 2 v_~y$w_buff0~0_103) (= v_~y$w_buff0_used~0_198 v_~y$w_buff1_used~0_175) (= v_~y$w_buff0_used~0_197 1) (= v_~y$r_buff0_thd1~0_21 v_~y$r_buff1_thd1~0_19) (= v_~y$r_buff0_thd0~0_111 v_~y$r_buff1_thd0~0_106) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_197 256) 0)) (not (= (mod v_~y$w_buff1_used~0_175 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff1~0_97 v_~y$w_buff0~0_104) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~y$r_buff0_thd4~0_37 v_~y$r_buff1_thd4~0_35) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_45) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (not (= |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_37)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_37, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_104, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_103, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:16:36,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [497] L861-->L869: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_147 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_156 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_254 256) 0)) .cse5)) (.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse0))) (and (= v_~y$r_buff1_thd0~0_146 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_229 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd0~0_155 256) 0)) .cse1)) 0 v_~y$r_buff1_thd0~0_147)) (= v_~y$w_buff1_used~0_229 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_230)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_28 256)) (= v_~y$w_buff0_used~0_253 (ite .cse4 0 v_~y$w_buff0_used~0_254)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~y$r_buff0_thd0~0_155 (ite .cse2 0 v_~y$r_buff0_thd0~0_156)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y~0_192 (ite .cse4 v_~y$w_buff0~0_141 (ite .cse3 v_~y$w_buff1~0_133 v_~y~0_193)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$w_buff1~0=v_~y$w_buff1~0_133, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_193, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$w_buff1~0=v_~y$w_buff1~0_133, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_141, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_192, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_229, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:16:37,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:16:37,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:16:37,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [466] $Ultimate##0-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_48 1) (= 2 v_~y$w_buff0~0_103) (= v_~y$w_buff0_used~0_198 v_~y$w_buff1_used~0_175) (= v_~y$w_buff0_used~0_197 1) (= v_~y$r_buff0_thd1~0_21 v_~y$r_buff1_thd1~0_19) (= v_~y$r_buff0_thd0~0_111 v_~y$r_buff1_thd0~0_106) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_197 256) 0)) (not (= (mod v_~y$w_buff1_used~0_175 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff1~0_97 v_~y$w_buff0~0_104) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~y$r_buff0_thd4~0_37 v_~y$r_buff1_thd4~0_35) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_45) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (not (= |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_37)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_37, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_104, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_103, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:16:37,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:37,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 859 [2022-12-06 04:16:37,319 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 292 flow [2022-12-06 04:16:37,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:37,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:37,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:16:37,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 789689378, now seen corresponding path program 1 times [2022-12-06 04:16:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:37,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012086898] [2022-12-06 04:16:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012086898] [2022-12-06 04:16:37,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012086898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:37,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:37,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9485237] [2022-12-06 04:16:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:37,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 04:16:37,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:37,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 04:16:37,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:38,430 INFO L130 PetriNetUnfolder]: 6432/9251 cut-off events. [2022-12-06 04:16:38,430 INFO L131 PetriNetUnfolder]: For 14796/14831 co-relation queries the response was YES. [2022-12-06 04:16:38,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30844 conditions, 9251 events. 6432/9251 cut-off events. For 14796/14831 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 51117 event pairs, 1149 based on Foata normal form. 53/9068 useless extension candidates. Maximal degree in co-relation 30826. Up to 6816 conditions per place. [2022-12-06 04:16:38,508 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 52 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2022-12-06 04:16:38,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 490 flow [2022-12-06 04:16:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:16:38,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2022-12-06 04:16:38,510 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 292 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:16:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 490 flow [2022-12-06 04:16:38,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 429 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:38,568 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2022-12-06 04:16:38,569 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-06 04:16:38,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:38,569 INFO L89 Accepts]: Start accepts. Operand has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:38,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:38,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,720 INFO L130 PetriNetUnfolder]: 831/1510 cut-off events. [2022-12-06 04:16:38,721 INFO L131 PetriNetUnfolder]: For 1450/1474 co-relation queries the response was YES. [2022-12-06 04:16:38,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1510 events. 831/1510 cut-off events. For 1450/1474 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9206 event pairs, 357 based on Foata normal form. 2/1488 useless extension candidates. Maximal degree in co-relation 3911. Up to 1070 conditions per place. [2022-12-06 04:16:38,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 04:16:38,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:38,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 04:16:38,743 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 266 flow [2022-12-06 04:16:38,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:38,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:38,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:38,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:16:38,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1289453163, now seen corresponding path program 1 times [2022-12-06 04:16:38,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:38,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327483554] [2022-12-06 04:16:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:38,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327483554] [2022-12-06 04:16:39,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327483554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:39,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989259318] [2022-12-06 04:16:39,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:39,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:39,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 04:16:39,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:39,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:39,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 04:16:39,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:40,148 INFO L130 PetriNetUnfolder]: 6652/9564 cut-off events. [2022-12-06 04:16:40,148 INFO L131 PetriNetUnfolder]: For 12467/12560 co-relation queries the response was YES. [2022-12-06 04:16:40,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29766 conditions, 9564 events. 6652/9564 cut-off events. For 12467/12560 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 53222 event pairs, 1143 based on Foata normal form. 69/9446 useless extension candidates. Maximal degree in co-relation 29747. Up to 7109 conditions per place. [2022-12-06 04:16:40,210 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 60 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2022-12-06 04:16:40,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 551 flow [2022-12-06 04:16:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:16:40,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2022-12-06 04:16:40,212 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 266 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:16:40,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 551 flow [2022-12-06 04:16:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 530 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:16:40,218 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2022-12-06 04:16:40,219 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-06 04:16:40,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:40,219 INFO L89 Accepts]: Start accepts. Operand has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:40,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:40,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,361 INFO L130 PetriNetUnfolder]: 838/1531 cut-off events. [2022-12-06 04:16:40,362 INFO L131 PetriNetUnfolder]: For 1417/1440 co-relation queries the response was YES. [2022-12-06 04:16:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 1531 events. 838/1531 cut-off events. For 1417/1440 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9471 event pairs, 336 based on Foata normal form. 2/1511 useless extension candidates. Maximal degree in co-relation 4298. Up to 1060 conditions per place. [2022-12-06 04:16:40,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 04:16:40,385 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:40,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 04:16:40,386 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 318 flow [2022-12-06 04:16:40,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:40,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:40,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:16:40,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1289451520, now seen corresponding path program 1 times [2022-12-06 04:16:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:40,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447625453] [2022-12-06 04:16:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447625453] [2022-12-06 04:16:40,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447625453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:40,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:40,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856276174] [2022-12-06 04:16:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:40,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:40,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 04:16:40,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:40,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:40,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 04:16:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:42,000 INFO L130 PetriNetUnfolder]: 7231/10308 cut-off events. [2022-12-06 04:16:42,000 INFO L131 PetriNetUnfolder]: For 14458/14623 co-relation queries the response was YES. [2022-12-06 04:16:42,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34337 conditions, 10308 events. 7231/10308 cut-off events. For 14458/14623 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 56820 event pairs, 1255 based on Foata normal form. 45/10068 useless extension candidates. Maximal degree in co-relation 34318. Up to 7543 conditions per place. [2022-12-06 04:16:42,082 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 65 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2022-12-06 04:16:42,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 619 flow [2022-12-06 04:16:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 04:16:42,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2022-12-06 04:16:42,084 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 318 flow. Second operand 4 states and 67 transitions. [2022-12-06 04:16:42,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 619 flow [2022-12-06 04:16:42,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 592 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:42,097 INFO L231 Difference]: Finished difference. Result has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=50, PETRI_TRANSITIONS=60} [2022-12-06 04:16:42,097 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-06 04:16:42,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:42,098 INFO L89 Accepts]: Start accepts. Operand has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:42,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:42,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,210 INFO L130 PetriNetUnfolder]: 928/1663 cut-off events. [2022-12-06 04:16:42,210 INFO L131 PetriNetUnfolder]: For 2114/2161 co-relation queries the response was YES. [2022-12-06 04:16:42,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 1663 events. 928/1663 cut-off events. For 2114/2161 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10204 event pairs, 328 based on Foata normal form. 3/1638 useless extension candidates. Maximal degree in co-relation 5295. Up to 1177 conditions per place. [2022-12-06 04:16:42,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-06 04:16:42,229 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:42,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 04:16:42,230 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 393 flow [2022-12-06 04:16:42,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:42,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:42,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:42,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:16:42,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1289431060, now seen corresponding path program 2 times [2022-12-06 04:16:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:42,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761339019] [2022-12-06 04:16:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761339019] [2022-12-06 04:16:42,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761339019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:42,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:42,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462840020] [2022-12-06 04:16:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:42,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 04:16:42,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 393 flow. Second operand has 5 states, 4 states have (on average 3.5) 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-06 04:16:42,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:42,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 04:16:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:44,142 INFO L130 PetriNetUnfolder]: 9462/12963 cut-off events. [2022-12-06 04:16:44,142 INFO L131 PetriNetUnfolder]: For 17792/17792 co-relation queries the response was YES. [2022-12-06 04:16:44,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45948 conditions, 12963 events. 9462/12963 cut-off events. For 17792/17792 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 65567 event pairs, 885 based on Foata normal form. 56/13019 useless extension candidates. Maximal degree in co-relation 45928. Up to 10377 conditions per place. [2022-12-06 04:16:44,220 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 90 selfloop transitions, 47 changer transitions 0/137 dead transitions. [2022-12-06 04:16:44,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 137 transitions, 1018 flow [2022-12-06 04:16:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:16:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:16:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-06 04:16:44,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2022-12-06 04:16:44,223 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 393 flow. Second operand 6 states and 97 transitions. [2022-12-06 04:16:44,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 137 transitions, 1018 flow [2022-12-06 04:16:44,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 988 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:44,252 INFO L231 Difference]: Finished difference. Result has 57 places, 91 transitions, 774 flow [2022-12-06 04:16:44,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=57, PETRI_TRANSITIONS=91} [2022-12-06 04:16:44,253 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2022-12-06 04:16:44,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:44,253 INFO L89 Accepts]: Start accepts. Operand has 57 places, 91 transitions, 774 flow [2022-12-06 04:16:44,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:44,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:44,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 91 transitions, 774 flow [2022-12-06 04:16:44,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 91 transitions, 774 flow [2022-12-06 04:16:44,468 INFO L130 PetriNetUnfolder]: 1143/1984 cut-off events. [2022-12-06 04:16:44,469 INFO L131 PetriNetUnfolder]: For 4998/5374 co-relation queries the response was YES. [2022-12-06 04:16:44,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8460 conditions, 1984 events. 1143/1984 cut-off events. For 4998/5374 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11983 event pairs, 263 based on Foata normal form. 6/1965 useless extension candidates. Maximal degree in co-relation 8439. Up to 1420 conditions per place. [2022-12-06 04:16:44,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 91 transitions, 774 flow [2022-12-06 04:16:44,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-06 04:16:45,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:45,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1631 [2022-12-06 04:16:45,884 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 91 transitions, 814 flow [2022-12-06 04:16:45,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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-06 04:16:45,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:45,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:45,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:16:45,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2049540292, now seen corresponding path program 1 times [2022-12-06 04:16:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024409535] [2022-12-06 04:16:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:46,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024409535] [2022-12-06 04:16:46,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024409535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:46,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:46,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806109643] [2022-12-06 04:16:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:46,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:46,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 04:16:46,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 91 transitions, 814 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:46,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:46,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 04:16:46,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:47,473 INFO L130 PetriNetUnfolder]: 8059/11468 cut-off events. [2022-12-06 04:16:47,474 INFO L131 PetriNetUnfolder]: For 40717/41148 co-relation queries the response was YES. [2022-12-06 04:16:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50844 conditions, 11468 events. 8059/11468 cut-off events. For 40717/41148 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 63437 event pairs, 1278 based on Foata normal form. 76/11393 useless extension candidates. Maximal degree in co-relation 50820. Up to 8359 conditions per place. [2022-12-06 04:16:47,554 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 87 selfloop transitions, 30 changer transitions 0/129 dead transitions. [2022-12-06 04:16:47,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 129 transitions, 1267 flow [2022-12-06 04:16:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 04:16:47,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 04:16:47,556 INFO L175 Difference]: Start difference. First operand has 57 places, 91 transitions, 814 flow. Second operand 5 states and 76 transitions. [2022-12-06 04:16:47,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 129 transitions, 1267 flow [2022-12-06 04:16:47,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 129 transitions, 1233 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:47,626 INFO L231 Difference]: Finished difference. Result has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=973, PETRI_PLACES=63, PETRI_TRANSITIONS=102} [2022-12-06 04:16:47,627 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2022-12-06 04:16:47,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:47,627 INFO L89 Accepts]: Start accepts. Operand has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:47,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:47,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,827 INFO L130 PetriNetUnfolder]: 1149/2008 cut-off events. [2022-12-06 04:16:47,827 INFO L131 PetriNetUnfolder]: For 7098/7400 co-relation queries the response was YES. [2022-12-06 04:16:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 2008 events. 1149/2008 cut-off events. For 7098/7400 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 12233 event pairs, 290 based on Foata normal form. 4/1992 useless extension candidates. Maximal degree in co-relation 9325. Up to 1426 conditions per place. [2022-12-06 04:16:47,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 04:16:47,860 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:47,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 04:16:47,861 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 102 transitions, 973 flow [2022-12-06 04:16:47,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:47,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:47,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:47,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:16:47,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1493516319, now seen corresponding path program 1 times [2022-12-06 04:16:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:47,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165002684] [2022-12-06 04:16:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:48,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165002684] [2022-12-06 04:16:48,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165002684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:48,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:48,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365640266] [2022-12-06 04:16:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:48,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:48,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:48,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:16:48,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 102 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:48,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:48,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:16:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:49,854 INFO L130 PetriNetUnfolder]: 9078/12924 cut-off events. [2022-12-06 04:16:49,855 INFO L131 PetriNetUnfolder]: For 61569/61996 co-relation queries the response was YES. [2022-12-06 04:16:49,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60871 conditions, 12924 events. 9078/12924 cut-off events. For 61569/61996 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 73188 event pairs, 1272 based on Foata normal form. 104/12776 useless extension candidates. Maximal degree in co-relation 60843. Up to 8753 conditions per place. [2022-12-06 04:16:49,933 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 96 selfloop transitions, 42 changer transitions 0/150 dead transitions. [2022-12-06 04:16:49,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 150 transitions, 1576 flow [2022-12-06 04:16:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 04:16:49,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2022-12-06 04:16:49,936 INFO L175 Difference]: Start difference. First operand has 63 places, 102 transitions, 973 flow. Second operand 5 states and 84 transitions. [2022-12-06 04:16:49,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 150 transitions, 1576 flow [2022-12-06 04:16:50,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 150 transitions, 1529 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:50,021 INFO L231 Difference]: Finished difference. Result has 68 places, 114 transitions, 1216 flow [2022-12-06 04:16:50,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1216, PETRI_PLACES=68, PETRI_TRANSITIONS=114} [2022-12-06 04:16:50,022 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2022-12-06 04:16:50,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:50,022 INFO L89 Accepts]: Start accepts. Operand has 68 places, 114 transitions, 1216 flow [2022-12-06 04:16:50,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:50,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:50,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 114 transitions, 1216 flow [2022-12-06 04:16:50,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 114 transitions, 1216 flow [2022-12-06 04:16:50,194 INFO L130 PetriNetUnfolder]: 1231/2168 cut-off events. [2022-12-06 04:16:50,194 INFO L131 PetriNetUnfolder]: For 10899/11342 co-relation queries the response was YES. [2022-12-06 04:16:50,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10842 conditions, 2168 events. 1231/2168 cut-off events. For 10899/11342 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 13538 event pairs, 286 based on Foata normal form. 6/2148 useless extension candidates. Maximal degree in co-relation 10814. Up to 1546 conditions per place. [2022-12-06 04:16:50,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 114 transitions, 1216 flow [2022-12-06 04:16:50,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 940 [2022-12-06 04:16:51,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:51,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1282 [2022-12-06 04:16:51,304 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 114 transitions, 1248 flow [2022-12-06 04:16:51,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:51,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:51,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:51,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:16:51,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -47134859, now seen corresponding path program 2 times [2022-12-06 04:16:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:51,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245044962] [2022-12-06 04:16:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245044962] [2022-12-06 04:16:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245044962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:51,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:51,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135316659] [2022-12-06 04:16:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:51,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:51,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:16:51,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 114 transitions, 1248 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:51,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:51,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:16:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:53,549 INFO L130 PetriNetUnfolder]: 9618/13767 cut-off events. [2022-12-06 04:16:53,550 INFO L131 PetriNetUnfolder]: For 92810/93392 co-relation queries the response was YES. [2022-12-06 04:16:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68812 conditions, 13767 events. 9618/13767 cut-off events. For 92810/93392 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 80190 event pairs, 1041 based on Foata normal form. 349/13869 useless extension candidates. Maximal degree in co-relation 68781. Up to 7471 conditions per place. [2022-12-06 04:16:53,668 INFO L137 encePairwiseOnDemand]: 19/35 looper letters, 101 selfloop transitions, 63 changer transitions 0/176 dead transitions. [2022-12-06 04:16:53,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 2008 flow [2022-12-06 04:16:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:16:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:16:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 04:16:53,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-06 04:16:53,670 INFO L175 Difference]: Start difference. First operand has 68 places, 114 transitions, 1248 flow. Second operand 6 states and 101 transitions. [2022-12-06 04:16:53,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 2008 flow [2022-12-06 04:16:53,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 176 transitions, 1959 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:53,879 INFO L231 Difference]: Finished difference. Result has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:53,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1536, PETRI_PLACES=74, PETRI_TRANSITIONS=125} [2022-12-06 04:16:53,880 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2022-12-06 04:16:53,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:53,880 INFO L89 Accepts]: Start accepts. Operand has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:53,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:53,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:53,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:54,056 INFO L130 PetriNetUnfolder]: 1253/2252 cut-off events. [2022-12-06 04:16:54,057 INFO L131 PetriNetUnfolder]: For 15658/16154 co-relation queries the response was YES. [2022-12-06 04:16:54,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12158 conditions, 2252 events. 1253/2252 cut-off events. For 15658/16154 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 14671 event pairs, 308 based on Foata normal form. 86/2308 useless extension candidates. Maximal degree in co-relation 12127. Up to 1594 conditions per place. [2022-12-06 04:16:54,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:54,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 1030 [2022-12-06 04:16:54,105 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:54,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 04:16:54,106 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 125 transitions, 1536 flow [2022-12-06 04:16:54,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:54,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:54,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:54,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:16:54,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -47832421, now seen corresponding path program 1 times [2022-12-06 04:16:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409866103] [2022-12-06 04:16:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:54,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409866103] [2022-12-06 04:16:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409866103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:54,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:54,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457114545] [2022-12-06 04:16:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:54,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:16:54,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 125 transitions, 1536 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:54,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:54,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:16:54,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:56,496 INFO L130 PetriNetUnfolder]: 10411/14941 cut-off events. [2022-12-06 04:16:56,496 INFO L131 PetriNetUnfolder]: For 126207/127055 co-relation queries the response was YES. [2022-12-06 04:16:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80088 conditions, 14941 events. 10411/14941 cut-off events. For 126207/127055 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 88890 event pairs, 1633 based on Foata normal form. 242/14842 useless extension candidates. Maximal degree in co-relation 80054. Up to 10184 conditions per place. [2022-12-06 04:16:56,653 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 117 selfloop transitions, 24 changer transitions 0/153 dead transitions. [2022-12-06 04:16:56,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 2044 flow [2022-12-06 04:16:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 04:16:56,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2022-12-06 04:16:56,655 INFO L175 Difference]: Start difference. First operand has 74 places, 125 transitions, 1536 flow. Second operand 4 states and 67 transitions. [2022-12-06 04:16:56,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 2044 flow [2022-12-06 04:16:56,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 153 transitions, 1983 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:56,942 INFO L231 Difference]: Finished difference. Result has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:56,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1621, PETRI_PLACES=77, PETRI_TRANSITIONS=129} [2022-12-06 04:16:56,942 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2022-12-06 04:16:56,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:56,942 INFO L89 Accepts]: Start accepts. Operand has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:56,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:56,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:56,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:56,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:57,274 INFO L130 PetriNetUnfolder]: 1329/2416 cut-off events. [2022-12-06 04:16:57,274 INFO L131 PetriNetUnfolder]: For 16915/17411 co-relation queries the response was YES. [2022-12-06 04:16:57,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13096 conditions, 2416 events. 1329/2416 cut-off events. For 16915/17411 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 16301 event pairs, 358 based on Foata normal form. 86/2472 useless extension candidates. Maximal degree in co-relation 13063. Up to 1702 conditions per place. [2022-12-06 04:16:57,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:57,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 04:16:57,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:57,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-06 04:16:57,340 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 129 transitions, 1621 flow [2022-12-06 04:16:57,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:57,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:57,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:16:57,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash -47257743, now seen corresponding path program 1 times [2022-12-06 04:16:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:57,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427753477] [2022-12-06 04:16:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:57,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427753477] [2022-12-06 04:16:57,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427753477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:57,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:57,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058517601] [2022-12-06 04:16:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:57,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:57,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:57,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:16:57,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 129 transitions, 1621 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:57,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:16:57,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:59,976 INFO L130 PetriNetUnfolder]: 10554/15165 cut-off events. [2022-12-06 04:16:59,976 INFO L131 PetriNetUnfolder]: For 140406/141313 co-relation queries the response was YES. [2022-12-06 04:17:00,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82778 conditions, 15165 events. 10554/15165 cut-off events. For 140406/141313 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 90485 event pairs, 1385 based on Foata normal form. 247/15018 useless extension candidates. Maximal degree in co-relation 82742. Up to 9206 conditions per place. [2022-12-06 04:17:00,112 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 125 selfloop transitions, 69 changer transitions 0/206 dead transitions. [2022-12-06 04:17:00,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 206 transitions, 2653 flow [2022-12-06 04:17:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:17:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:17:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-06 04:17:00,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48917748917748916 [2022-12-06 04:17:00,114 INFO L175 Difference]: Start difference. First operand has 77 places, 129 transitions, 1621 flow. Second operand 7 states and 113 transitions. [2022-12-06 04:17:00,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 206 transitions, 2653 flow [2022-12-06 04:17:00,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 206 transitions, 2599 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 04:17:00,323 INFO L231 Difference]: Finished difference. Result has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2091, PETRI_PLACES=83, PETRI_TRANSITIONS=148} [2022-12-06 04:17:00,323 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2022-12-06 04:17:00,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:00,324 INFO L89 Accepts]: Start accepts. Operand has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:00,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:00,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,714 INFO L130 PetriNetUnfolder]: 1355/2480 cut-off events. [2022-12-06 04:17:00,714 INFO L131 PetriNetUnfolder]: For 20697/21205 co-relation queries the response was YES. [2022-12-06 04:17:00,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14188 conditions, 2480 events. 1355/2480 cut-off events. For 20697/21205 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 16933 event pairs, 366 based on Foata normal form. 79/2529 useless extension candidates. Maximal degree in co-relation 14153. Up to 1744 conditions per place. [2022-12-06 04:17:00,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 04:17:00,777 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:17:00,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-06 04:17:00,777 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 148 transitions, 2091 flow [2022-12-06 04:17:00,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:00,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:00,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:00,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:17:00,778 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1484379682, now seen corresponding path program 1 times [2022-12-06 04:17:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:00,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017786722] [2022-12-06 04:17:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:01,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017786722] [2022-12-06 04:17:01,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017786722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:01,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:01,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:17:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147726415] [2022-12-06 04:17:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:01,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:17:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:17:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:17:01,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 04:17:01,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 148 transitions, 2091 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:01,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:01,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 04:17:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:03,980 INFO L130 PetriNetUnfolder]: 16797/23320 cut-off events. [2022-12-06 04:17:03,980 INFO L131 PetriNetUnfolder]: For 195660/195660 co-relation queries the response was YES. [2022-12-06 04:17:04,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124014 conditions, 23320 events. 16797/23320 cut-off events. For 195660/195660 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 132599 event pairs, 1129 based on Foata normal form. 196/23516 useless extension candidates. Maximal degree in co-relation 123976. Up to 11283 conditions per place. [2022-12-06 04:17:04,252 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 148 selfloop transitions, 92 changer transitions 70/310 dead transitions. [2022-12-06 04:17:04,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 310 transitions, 4844 flow [2022-12-06 04:17:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 04:17:04,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2022-12-06 04:17:04,253 INFO L175 Difference]: Start difference. First operand has 83 places, 148 transitions, 2091 flow. Second operand 6 states and 98 transitions. [2022-12-06 04:17:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 310 transitions, 4844 flow [2022-12-06 04:17:04,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 310 transitions, 4637 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-06 04:17:04,592 INFO L231 Difference]: Finished difference. Result has 88 places, 173 transitions, 2636 flow [2022-12-06 04:17:04,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2636, PETRI_PLACES=88, PETRI_TRANSITIONS=173} [2022-12-06 04:17:04,593 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2022-12-06 04:17:04,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:04,593 INFO L89 Accepts]: Start accepts. Operand has 88 places, 173 transitions, 2636 flow [2022-12-06 04:17:04,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:04,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:04,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 173 transitions, 2636 flow [2022-12-06 04:17:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 173 transitions, 2636 flow [2022-12-06 04:17:04,899 INFO L130 PetriNetUnfolder]: 1460/2819 cut-off events. [2022-12-06 04:17:04,899 INFO L131 PetriNetUnfolder]: For 23686/24309 co-relation queries the response was YES. [2022-12-06 04:17:04,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17478 conditions, 2819 events. 1460/2819 cut-off events. For 23686/24309 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 20894 event pairs, 396 based on Foata normal form. 101/2891 useless extension candidates. Maximal degree in co-relation 17439. Up to 1919 conditions per place. [2022-12-06 04:17:04,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 173 transitions, 2636 flow [2022-12-06 04:17:04,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 1226 [2022-12-06 04:17:05,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:17:05,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 881 [2022-12-06 04:17:05,474 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 173 transitions, 2666 flow [2022-12-06 04:17:05,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:05,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:05,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:05,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:17:05,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1822011911, now seen corresponding path program 1 times [2022-12-06 04:17:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792191223] [2022-12-06 04:17:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:05,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792191223] [2022-12-06 04:17:05,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792191223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:05,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:05,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:17:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696748927] [2022-12-06 04:17:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:17:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:17:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:17:05,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 04:17:05,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 173 transitions, 2666 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:05,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:05,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 04:17:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:07,912 INFO L130 PetriNetUnfolder]: 9783/14748 cut-off events. [2022-12-06 04:17:07,912 INFO L131 PetriNetUnfolder]: For 205116/207352 co-relation queries the response was YES. [2022-12-06 04:17:08,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88704 conditions, 14748 events. 9783/14748 cut-off events. For 205116/207352 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 99630 event pairs, 1240 based on Foata normal form. 1804/15956 useless extension candidates. Maximal degree in co-relation 88662. Up to 7507 conditions per place. [2022-12-06 04:17:08,064 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 303 selfloop transitions, 6 changer transitions 8/339 dead transitions. [2022-12-06 04:17:08,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 339 transitions, 5880 flow [2022-12-06 04:17:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:17:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:17:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 04:17:08,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2022-12-06 04:17:08,081 INFO L175 Difference]: Start difference. First operand has 88 places, 173 transitions, 2666 flow. Second operand 4 states and 90 transitions. [2022-12-06 04:17:08,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 339 transitions, 5880 flow [2022-12-06 04:17:08,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 339 transitions, 5799 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 04:17:08,559 INFO L231 Difference]: Finished difference. Result has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:08,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2249, PETRI_PLACES=91, PETRI_TRANSITIONS=155} [2022-12-06 04:17:08,561 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2022-12-06 04:17:08,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:08,561 INFO L89 Accepts]: Start accepts. Operand has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:08,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:08,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:08,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:08,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:09,198 INFO L130 PetriNetUnfolder]: 2576/5035 cut-off events. [2022-12-06 04:17:09,198 INFO L131 PetriNetUnfolder]: For 43826/46512 co-relation queries the response was YES. [2022-12-06 04:17:09,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26686 conditions, 5035 events. 2576/5035 cut-off events. For 43826/46512 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 44538 event pairs, 819 based on Foata normal form. 188/4576 useless extension candidates. Maximal degree in co-relation 26645. Up to 2713 conditions per place. [2022-12-06 04:17:09,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:09,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-06 04:17:09,287 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:17:09,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 727 [2022-12-06 04:17:09,288 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 155 transitions, 2249 flow [2022-12-06 04:17:09,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:09,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:09,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:17:09,289 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1106247235, now seen corresponding path program 1 times [2022-12-06 04:17:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:09,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180290064] [2022-12-06 04:17:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180290064] [2022-12-06 04:17:09,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180290064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:09,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:09,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:17:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281916485] [2022-12-06 04:17:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:17:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:17:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:17:09,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:17:09,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 155 transitions, 2249 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:09,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:09,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:17:09,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:11,948 INFO L130 PetriNetUnfolder]: 12726/19597 cut-off events. [2022-12-06 04:17:11,948 INFO L131 PetriNetUnfolder]: For 247799/249988 co-relation queries the response was YES. [2022-12-06 04:17:12,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121943 conditions, 19597 events. 12726/19597 cut-off events. For 247799/249988 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 138707 event pairs, 1767 based on Foata normal form. 1208/20390 useless extension candidates. Maximal degree in co-relation 121899. Up to 9672 conditions per place. [2022-12-06 04:17:12,086 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 116 selfloop transitions, 57 changer transitions 23/216 dead transitions. [2022-12-06 04:17:12,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 216 transitions, 3213 flow [2022-12-06 04:17:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-06 04:17:12,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2022-12-06 04:17:12,088 INFO L175 Difference]: Start difference. First operand has 91 places, 155 transitions, 2249 flow. Second operand 6 states and 86 transitions. [2022-12-06 04:17:12,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 216 transitions, 3213 flow [2022-12-06 04:17:12,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 216 transitions, 3208 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:17:12,660 INFO L231 Difference]: Finished difference. Result has 96 places, 144 transitions, 2288 flow [2022-12-06 04:17:12,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2288, PETRI_PLACES=96, PETRI_TRANSITIONS=144} [2022-12-06 04:17:12,660 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2022-12-06 04:17:12,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:12,661 INFO L89 Accepts]: Start accepts. Operand has 96 places, 144 transitions, 2288 flow [2022-12-06 04:17:12,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:12,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:12,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 144 transitions, 2288 flow [2022-12-06 04:17:12,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 144 transitions, 2288 flow [2022-12-06 04:17:13,317 INFO L130 PetriNetUnfolder]: 2942/5685 cut-off events. [2022-12-06 04:17:13,317 INFO L131 PetriNetUnfolder]: For 51737/54594 co-relation queries the response was YES. [2022-12-06 04:17:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29834 conditions, 5685 events. 2942/5685 cut-off events. For 51737/54594 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 50800 event pairs, 1017 based on Foata normal form. 134/5025 useless extension candidates. Maximal degree in co-relation 29791. Up to 3338 conditions per place. [2022-12-06 04:17:13,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 144 transitions, 2288 flow [2022-12-06 04:17:13,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 1466 [2022-12-06 04:17:13,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [385] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [385] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [385] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:17:13,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:17:13,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1324 [2022-12-06 04:17:13,985 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 143 transitions, 2347 flow [2022-12-06 04:17:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:13,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:13,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:17:13,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -847707353, now seen corresponding path program 1 times [2022-12-06 04:17:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347738257] [2022-12-06 04:17:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:14,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347738257] [2022-12-06 04:17:14,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347738257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:14,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:14,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:17:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650201145] [2022-12-06 04:17:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:14,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:17:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:14,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:17:14,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:17:14,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2022-12-06 04:17:14,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 143 transitions, 2347 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:14,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:14,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2022-12-06 04:17:14,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:15,873 INFO L130 PetriNetUnfolder]: 9013/13879 cut-off events. [2022-12-06 04:17:15,874 INFO L131 PetriNetUnfolder]: For 259591/262370 co-relation queries the response was YES. [2022-12-06 04:17:15,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94049 conditions, 13879 events. 9013/13879 cut-off events. For 259591/262370 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 94968 event pairs, 1035 based on Foata normal form. 1364/14695 useless extension candidates. Maximal degree in co-relation 94003. Up to 6491 conditions per place. [2022-12-06 04:17:15,974 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 256 selfloop transitions, 10 changer transitions 11/298 dead transitions. [2022-12-06 04:17:15,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 298 transitions, 5664 flow [2022-12-06 04:17:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:17:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:17:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-06 04:17:15,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5756097560975609 [2022-12-06 04:17:15,975 INFO L175 Difference]: Start difference. First operand has 95 places, 143 transitions, 2347 flow. Second operand 5 states and 118 transitions. [2022-12-06 04:17:15,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 298 transitions, 5664 flow [2022-12-06 04:17:16,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 298 transitions, 4889 flow, removed 286 selfloop flow, removed 13 redundant places. [2022-12-06 04:17:16,593 INFO L231 Difference]: Finished difference. Result has 87 places, 130 transitions, 1804 flow [2022-12-06 04:17:16,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1804, PETRI_PLACES=87, PETRI_TRANSITIONS=130} [2022-12-06 04:17:16,593 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2022-12-06 04:17:16,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:16,593 INFO L89 Accepts]: Start accepts. Operand has 87 places, 130 transitions, 1804 flow [2022-12-06 04:17:16,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:16,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:16,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 130 transitions, 1804 flow [2022-12-06 04:17:16,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 130 transitions, 1804 flow [2022-12-06 04:17:16,936 INFO L130 PetriNetUnfolder]: 2054/4496 cut-off events. [2022-12-06 04:17:16,936 INFO L131 PetriNetUnfolder]: For 29318/34485 co-relation queries the response was YES. [2022-12-06 04:17:16,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22223 conditions, 4496 events. 2054/4496 cut-off events. For 29318/34485 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 43328 event pairs, 304 based on Foata normal form. 292/4125 useless extension candidates. Maximal degree in co-relation 22184. Up to 2916 conditions per place. [2022-12-06 04:17:16,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 130 transitions, 1804 flow [2022-12-06 04:17:16,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 1618 [2022-12-06 04:17:17,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:17:17,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1011 [2022-12-06 04:17:17,604 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 130 transitions, 1828 flow [2022-12-06 04:17:17,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:17,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:17,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:17:17,605 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -786896971, now seen corresponding path program 1 times [2022-12-06 04:17:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:17,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245569279] [2022-12-06 04:17:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245569279] [2022-12-06 04:17:17,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245569279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:17,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:17,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:17:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171282922] [2022-12-06 04:17:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:17,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:17:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:17:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:17:17,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 04:17:17,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 130 transitions, 1828 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:17,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:17,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 04:17:17,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:20,186 INFO L130 PetriNetUnfolder]: 12132/19340 cut-off events. [2022-12-06 04:17:20,186 INFO L131 PetriNetUnfolder]: For 174171/175201 co-relation queries the response was YES. [2022-12-06 04:17:20,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119831 conditions, 19340 events. 12132/19340 cut-off events. For 174171/175201 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 140911 event pairs, 3751 based on Foata normal form. 65/19035 useless extension candidates. Maximal degree in co-relation 119789. Up to 9144 conditions per place. [2022-12-06 04:17:20,302 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 99 selfloop transitions, 13 changer transitions 55/177 dead transitions. [2022-12-06 04:17:20,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 177 transitions, 2667 flow [2022-12-06 04:17:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:17:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:17:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 04:17:20,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2022-12-06 04:17:20,304 INFO L175 Difference]: Start difference. First operand has 87 places, 130 transitions, 1828 flow. Second operand 3 states and 70 transitions. [2022-12-06 04:17:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 177 transitions, 2667 flow [2022-12-06 04:17:20,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 177 transitions, 2639 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:17:20,595 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 1181 flow [2022-12-06 04:17:20,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2022-12-06 04:17:20,596 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2022-12-06 04:17:20,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:20,596 INFO L89 Accepts]: Start accepts. Operand has 88 places, 95 transitions, 1181 flow [2022-12-06 04:17:20,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:20,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:20,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 95 transitions, 1181 flow [2022-12-06 04:17:20,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 1181 flow [2022-12-06 04:17:21,222 INFO L130 PetriNetUnfolder]: 2509/5420 cut-off events. [2022-12-06 04:17:21,222 INFO L131 PetriNetUnfolder]: For 34330/38762 co-relation queries the response was YES. [2022-12-06 04:17:21,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24788 conditions, 5420 events. 2509/5420 cut-off events. For 34330/38762 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 53268 event pairs, 406 based on Foata normal form. 330/4939 useless extension candidates. Maximal degree in co-relation 24749. Up to 3278 conditions per place. [2022-12-06 04:17:21,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 95 transitions, 1181 flow [2022-12-06 04:17:21,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-06 04:17:22,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:17:22,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1655 [2022-12-06 04:17:22,252 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1203 flow [2022-12-06 04:17:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:22,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:22,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:22,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:17:22,252 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1969783292, now seen corresponding path program 1 times [2022-12-06 04:17:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356376523] [2022-12-06 04:17:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:22,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356376523] [2022-12-06 04:17:22,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356376523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:22,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:22,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:17:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413929746] [2022-12-06 04:17:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:22,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:17:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:17:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:17:22,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:17:22,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1203 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:22,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:22,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:17:22,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:23,978 INFO L130 PetriNetUnfolder]: 8768/14028 cut-off events. [2022-12-06 04:17:23,978 INFO L131 PetriNetUnfolder]: For 149666/152441 co-relation queries the response was YES. [2022-12-06 04:17:24,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84851 conditions, 14028 events. 8768/14028 cut-off events. For 149666/152441 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 103557 event pairs, 954 based on Foata normal form. 1228/14727 useless extension candidates. Maximal degree in co-relation 84809. Up to 5955 conditions per place. [2022-12-06 04:17:24,083 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 160 selfloop transitions, 14 changer transitions 15/204 dead transitions. [2022-12-06 04:17:24,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 204 transitions, 2957 flow [2022-12-06 04:17:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-06 04:17:24,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2022-12-06 04:17:24,084 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1203 flow. Second operand 6 states and 115 transitions. [2022-12-06 04:17:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 204 transitions, 2957 flow [2022-12-06 04:17:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 204 transitions, 2802 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 04:17:24,204 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1082, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2022-12-06 04:17:24,205 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2022-12-06 04:17:24,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:24,205 INFO L89 Accepts]: Start accepts. Operand has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:24,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:24,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,505 INFO L130 PetriNetUnfolder]: 1871/4197 cut-off events. [2022-12-06 04:17:24,505 INFO L131 PetriNetUnfolder]: For 33356/37823 co-relation queries the response was YES. [2022-12-06 04:17:24,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 4197 events. 1871/4197 cut-off events. For 33356/37823 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 40537 event pairs, 151 based on Foata normal form. 353/3892 useless extension candidates. Maximal degree in co-relation 20797. Up to 2559 conditions per place. [2022-12-06 04:17:24,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-06 04:17:24,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:17:24,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-06 04:17:24,592 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 1082 flow [2022-12-06 04:17:24,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:24,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:24,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:24,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:17:24,593 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash 376122674, now seen corresponding path program 1 times [2022-12-06 04:17:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:24,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211575034] [2022-12-06 04:17:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:24,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:24,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211575034] [2022-12-06 04:17:24,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211575034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:24,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:24,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:17:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133600499] [2022-12-06 04:17:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:24,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:17:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:24,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:17:24,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:17:24,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:17:24,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:24,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:24,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:17:24,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:26,112 INFO L130 PetriNetUnfolder]: 8398/13229 cut-off events. [2022-12-06 04:17:26,112 INFO L131 PetriNetUnfolder]: For 139434/141668 co-relation queries the response was YES. [2022-12-06 04:17:26,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84381 conditions, 13229 events. 8398/13229 cut-off events. For 139434/141668 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 93875 event pairs, 1064 based on Foata normal form. 648/13388 useless extension candidates. Maximal degree in co-relation 84339. Up to 5814 conditions per place. [2022-12-06 04:17:26,220 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 114 selfloop transitions, 18 changer transitions 40/181 dead transitions. [2022-12-06 04:17:26,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 181 transitions, 2500 flow [2022-12-06 04:17:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:17:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:17:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-06 04:17:26,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069124423963134 [2022-12-06 04:17:26,222 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 1082 flow. Second operand 7 states and 110 transitions. [2022-12-06 04:17:26,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 181 transitions, 2500 flow [2022-12-06 04:17:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 181 transitions, 2435 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 04:17:26,778 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 831 flow [2022-12-06 04:17:26,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=831, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2022-12-06 04:17:26,778 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2022-12-06 04:17:26,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:26,778 INFO L89 Accepts]: Start accepts. Operand has 94 places, 74 transitions, 831 flow [2022-12-06 04:17:26,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:26,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:26,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 74 transitions, 831 flow [2022-12-06 04:17:26,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 74 transitions, 831 flow [2022-12-06 04:17:26,841 INFO L130 PetriNetUnfolder]: 410/934 cut-off events. [2022-12-06 04:17:26,841 INFO L131 PetriNetUnfolder]: For 8079/9318 co-relation queries the response was YES. [2022-12-06 04:17:26,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 934 events. 410/934 cut-off events. For 8079/9318 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 6785 event pairs, 30 based on Foata normal form. 58/824 useless extension candidates. Maximal degree in co-relation 4579. Up to 347 conditions per place. [2022-12-06 04:17:26,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 74 transitions, 831 flow [2022-12-06 04:17:26,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 04:17:26,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] and [477] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:17:26,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L834-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_209 (+ v_~__unbuffered_cnt~0_210 1)) (= |v_P3Thread1of1ForFork0_#res.offset_9| 0) (= |v_P3Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_210} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_9|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_209} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [477] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:17:26,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L808-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_P2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P2Thread1of1ForFork2_#res#1.offset=|v_P2Thread1of1ForFork2_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P2Thread1of1ForFork2_#res#1.base=|v_P2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res#1.base] and [477] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:17:26,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L778-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_27| 0) (= |v_P1Thread1of1ForFork1_#res.offset_27| 0) (= v_~__unbuffered_cnt~0_201 (+ v_~__unbuffered_cnt~0_202 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_202} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_201, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [477] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:17:26,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [464] $Ultimate##0-->L768: Formula: (and (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-06 04:17:46,251 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:17:46,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19473 [2022-12-06 04:17:46,251 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 972 flow [2022-12-06 04:17:46,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:46,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:46,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:46,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:17:46,252 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -600649447, now seen corresponding path program 1 times [2022-12-06 04:17:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130252187] [2022-12-06 04:17:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130252187] [2022-12-06 04:17:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130252187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:17:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485911935] [2022-12-06 04:17:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:17:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:17:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:17:46,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 04:17:46,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 972 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:46,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:46,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 04:17:46,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:46,669 INFO L130 PetriNetUnfolder]: 1130/1873 cut-off events. [2022-12-06 04:17:46,670 INFO L131 PetriNetUnfolder]: For 15163/15203 co-relation queries the response was YES. [2022-12-06 04:17:46,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11822 conditions, 1873 events. 1130/1873 cut-off events. For 15163/15203 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9505 event pairs, 200 based on Foata normal form. 7/1866 useless extension candidates. Maximal degree in co-relation 11779. Up to 1184 conditions per place. [2022-12-06 04:17:46,680 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 45 selfloop transitions, 1 changer transitions 70/119 dead transitions. [2022-12-06 04:17:46,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 119 transitions, 1675 flow [2022-12-06 04:17:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:17:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:17:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 04:17:46,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-06 04:17:46,681 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 972 flow. Second operand 4 states and 74 transitions. [2022-12-06 04:17:46,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 119 transitions, 1675 flow [2022-12-06 04:17:46,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1371 flow, removed 43 selfloop flow, removed 19 redundant places. [2022-12-06 04:17:46,715 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 409 flow [2022-12-06 04:17:46,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2022-12-06 04:17:46,715 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-12-06 04:17:46,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:46,716 INFO L89 Accepts]: Start accepts. Operand has 76 places, 45 transitions, 409 flow [2022-12-06 04:17:46,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:46,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:46,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 45 transitions, 409 flow [2022-12-06 04:17:46,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 45 transitions, 409 flow [2022-12-06 04:17:46,733 INFO L130 PetriNetUnfolder]: 99/244 cut-off events. [2022-12-06 04:17:46,733 INFO L131 PetriNetUnfolder]: For 505/516 co-relation queries the response was YES. [2022-12-06 04:17:46,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 244 events. 99/244 cut-off events. For 505/516 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1219 event pairs, 6 based on Foata normal form. 2/230 useless extension candidates. Maximal degree in co-relation 802. Up to 82 conditions per place. [2022-12-06 04:17:46,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 45 transitions, 409 flow [2022-12-06 04:17:46,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 04:17:46,844 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:17:46,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 04:17:46,859 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 404 flow [2022-12-06 04:17:46,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:46,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:46,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 04:17:46,860 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:17:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 241982521, now seen corresponding path program 1 times [2022-12-06 04:17:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:46,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796783407] [2022-12-06 04:17:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:17:46,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:17:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:17:46,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:17:46,929 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:17:46,929 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:17:46,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:17:46,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:17:46,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:17:46,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:17:46,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:17:46,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:17:46,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 04:17:46,931 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:46,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:17:46,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:17:47,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:17:47 BasicIcfg [2022-12-06 04:17:47,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:17:47,008 INFO L158 Benchmark]: Toolchain (without parser) took 84059.42ms. Allocated memory was 169.9MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 142.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 04:17:47,008 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:17:47,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.58ms. Allocated memory is still 169.9MB. Free memory was 142.6MB in the beginning and 114.6MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:17:47,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.17ms. Allocated memory is still 169.9MB. Free memory was 114.6MB in the beginning and 144.5MB in the end (delta: -29.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 04:17:47,009 INFO L158 Benchmark]: Boogie Preprocessor took 63.11ms. Allocated memory is still 169.9MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:17:47,009 INFO L158 Benchmark]: RCFGBuilder took 603.79ms. Allocated memory is still 169.9MB. Free memory was 142.4MB in the beginning and 105.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-06 04:17:47,009 INFO L158 Benchmark]: TraceAbstraction took 82860.01ms. Allocated memory was 169.9MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 105.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 04:17:47,010 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 127.9MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.58ms. Allocated memory is still 169.9MB. Free memory was 142.6MB in the beginning and 114.6MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.17ms. Allocated memory is still 169.9MB. Free memory was 114.6MB in the beginning and 144.5MB in the end (delta: -29.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.11ms. Allocated memory is still 169.9MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 603.79ms. Allocated memory is still 169.9MB. Free memory was 142.4MB in the beginning and 105.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 82860.01ms. Allocated memory was 169.9MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 105.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 138 PlacesBefore, 45 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 3090 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2224, independent: 2159, independent conditional: 2159, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2224, independent: 2159, independent conditional: 0, independent unconditional: 2159, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2224, independent: 2159, independent conditional: 0, independent unconditional: 2159, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2224, independent: 2159, independent conditional: 0, independent unconditional: 2159, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1861, independent: 1818, independent conditional: 0, independent unconditional: 1818, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1861, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2224, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1861, unknown conditional: 0, unknown unconditional: 1861] , Statistics on independence cache: Total cache size (in pairs): 2810, Positive cache size: 2767, Positive conditional cache size: 0, Positive unconditional cache size: 2767, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 394, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 394, independent: 341, independent conditional: 28, independent unconditional: 313, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 394, independent: 341, independent conditional: 28, independent unconditional: 313, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 394, independent: 341, independent conditional: 28, independent unconditional: 313, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 188, independent: 166, independent conditional: 13, independent unconditional: 153, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 43, dependent conditional: 8, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 394, independent: 175, independent conditional: 15, independent unconditional: 160, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 188, unknown conditional: 15, unknown unconditional: 173] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 168, Positive conditional cache size: 13, Positive unconditional cache size: 155, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 37 TransitionsBefore, 37 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 195, independent: 182, independent conditional: 38, independent unconditional: 144, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 182, independent conditional: 13, independent unconditional: 169, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, independent: 182, independent conditional: 13, independent unconditional: 169, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 167, independent conditional: 8, independent unconditional: 159, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 17, unknown conditional: 7, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 183, Positive conditional cache size: 18, Positive unconditional cache size: 165, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 127, independent: 117, independent conditional: 22, independent unconditional: 95, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, independent: 117, independent conditional: 8, independent unconditional: 109, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 117, independent conditional: 8, independent unconditional: 109, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 115, independent conditional: 8, independent unconditional: 107, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 185, Positive conditional cache size: 18, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, 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, 40 TransitionsBefore, 40 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 92, independent conditional: 21, independent unconditional: 71, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 92, independent conditional: 11, independent unconditional: 81, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 92, independent conditional: 11, independent unconditional: 81, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 92, independent conditional: 11, independent unconditional: 81, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 185, Positive conditional cache size: 18, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, independent: 360, independent conditional: 360, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 384, independent: 360, independent conditional: 180, independent unconditional: 180, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, independent: 360, independent conditional: 51, independent unconditional: 309, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, independent: 360, independent conditional: 51, independent unconditional: 309, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 384, independent: 356, independent conditional: 51, independent unconditional: 305, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 265, Positive conditional cache size: 18, Positive unconditional cache size: 247, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 129, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 142, independent conditional: 43, independent unconditional: 99, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 142, independent conditional: 32, independent unconditional: 110, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 142, independent conditional: 32, independent unconditional: 110, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 140, independent conditional: 32, independent unconditional: 108, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 267, Positive conditional cache size: 18, Positive unconditional cache size: 249, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 50, independent unconditional: 112, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 162, independent conditional: 29, independent unconditional: 133, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 29, independent unconditional: 133, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 159, independent conditional: 29, independent unconditional: 130, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 270, Positive conditional cache size: 18, Positive unconditional cache size: 252, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, 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.0s, 50 PlacesBefore, 50 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 261, independent: 240, independent conditional: 93, independent unconditional: 147, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 261, independent: 240, independent conditional: 61, independent unconditional: 179, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 261, independent: 240, independent conditional: 61, independent unconditional: 179, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 261, independent: 240, independent conditional: 61, independent unconditional: 179, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 270, Positive conditional cache size: 18, Positive unconditional cache size: 252, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 57 PlacesBefore, 57 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1399, independent: 1321, independent conditional: 1321, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1399, independent: 1321, independent conditional: 774, independent unconditional: 547, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1399, independent: 1321, independent conditional: 412, independent unconditional: 909, 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: 1399, independent: 1321, independent conditional: 412, independent unconditional: 909, 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: 5, independent: 5, independent conditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1399, independent: 1316, independent conditional: 411, independent unconditional: 905, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 289, Positive conditional cache size: 19, Positive unconditional cache size: 270, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 362, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 868, independent: 822, independent conditional: 822, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 868, independent: 822, independent conditional: 481, independent unconditional: 341, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 868, independent: 822, independent conditional: 271, independent unconditional: 551, 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: 868, independent: 822, independent conditional: 271, independent unconditional: 551, 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: 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: 868, independent: 822, independent conditional: 271, independent unconditional: 551, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 289, Positive conditional cache size: 19, Positive unconditional cache size: 270, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 210, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 68 PlacesBefore, 68 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2019, independent: 1911, independent conditional: 1911, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2019, independent: 1911, independent conditional: 1149, independent unconditional: 762, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2019, independent: 1911, independent conditional: 677, independent unconditional: 1234, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2019, independent: 1911, independent conditional: 677, independent unconditional: 1234, dependent: 108, dependent conditional: 0, dependent unconditional: 108, 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: 2019, independent: 1911, independent conditional: 677, independent unconditional: 1234, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 299, Positive conditional cache size: 19, Positive unconditional cache size: 280, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 472, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1252, independent: 1181, independent conditional: 1181, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1252, independent: 1181, independent conditional: 716, independent unconditional: 465, dependent: 71, dependent conditional: 8, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1268, independent: 1181, independent conditional: 426, independent unconditional: 755, dependent: 87, dependent conditional: 24, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1268, independent: 1181, independent conditional: 426, independent unconditional: 755, dependent: 87, dependent conditional: 24, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1268, independent: 1179, independent conditional: 424, independent unconditional: 755, dependent: 84, dependent conditional: 21, dependent unconditional: 63, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 301, Positive conditional cache size: 21, Positive unconditional cache size: 280, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 290, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1196, independent: 1122, independent conditional: 1122, 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: 1196, independent: 1122, independent conditional: 654, independent unconditional: 468, dependent: 74, dependent conditional: 8, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1204, independent: 1122, independent conditional: 306, independent unconditional: 816, dependent: 82, dependent conditional: 16, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1204, independent: 1122, independent conditional: 306, independent unconditional: 816, dependent: 82, dependent conditional: 16, dependent unconditional: 66, 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: 1204, independent: 1122, independent conditional: 306, independent unconditional: 816, dependent: 82, dependent conditional: 16, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 301, Positive conditional cache size: 21, Positive unconditional cache size: 280, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 348, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1303, independent: 1211, independent conditional: 1211, independent unconditional: 0, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1303, independent: 1211, independent conditional: 836, independent unconditional: 375, dependent: 92, dependent conditional: 13, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1316, independent: 1211, independent conditional: 598, independent unconditional: 613, dependent: 105, dependent conditional: 26, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1316, independent: 1211, independent conditional: 598, independent unconditional: 613, dependent: 105, dependent conditional: 26, dependent unconditional: 79, 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: 1316, independent: 1211, independent conditional: 598, independent unconditional: 613, dependent: 105, dependent conditional: 26, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 301, Positive conditional cache size: 21, Positive unconditional cache size: 280, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 238, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 88 PlacesBefore, 88 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 1226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5167, independent: 4931, independent conditional: 4931, independent unconditional: 0, dependent: 236, dependent conditional: 236, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5167, independent: 4931, independent conditional: 3080, independent unconditional: 1851, dependent: 236, dependent conditional: 26, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5193, independent: 4931, independent conditional: 2128, independent unconditional: 2803, dependent: 262, dependent conditional: 52, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5193, independent: 4931, independent conditional: 2128, independent unconditional: 2803, dependent: 262, dependent conditional: 52, dependent unconditional: 210, 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: 5193, independent: 4930, independent conditional: 2128, independent unconditional: 2802, dependent: 262, dependent conditional: 52, dependent unconditional: 210, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 307, Positive conditional cache size: 21, Positive unconditional cache size: 286, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 952, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 1606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 477, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 477, independent: 454, independent conditional: 346, independent unconditional: 108, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 454, independent conditional: 117, independent unconditional: 337, dependent: 36, dependent conditional: 26, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 454, independent conditional: 117, independent unconditional: 337, dependent: 36, dependent conditional: 26, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 490, independent: 454, independent conditional: 117, independent unconditional: 337, dependent: 35, dependent conditional: 26, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 307, Positive conditional cache size: 21, Positive unconditional cache size: 286, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 230, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 96 PlacesBefore, 95 PlacesAfterwards, 144 TransitionsBefore, 143 TransitionsAfterwards, 1466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 850, independent: 830, independent conditional: 830, 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: 850, independent: 830, independent conditional: 632, independent unconditional: 198, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 850, independent: 830, independent conditional: 295, independent unconditional: 535, 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: 850, independent: 830, independent conditional: 295, independent unconditional: 535, 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: 8, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 850, independent: 822, independent conditional: 289, independent unconditional: 533, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 436, Positive conditional cache size: 27, Positive unconditional cache size: 409, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 339, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 87 PlacesBefore, 87 PlacesAfterwards, 130 TransitionsBefore, 130 TransitionsAfterwards, 1618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 551, independent: 531, independent conditional: 531, 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: 551, independent: 531, independent conditional: 328, independent unconditional: 203, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 553, independent: 531, independent conditional: 216, independent unconditional: 315, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 553, independent: 531, independent conditional: 216, independent unconditional: 315, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 553, independent: 531, independent conditional: 216, independent unconditional: 315, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 442, Positive conditional cache size: 27, Positive unconditional cache size: 415, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 116, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 88 PlacesBefore, 88 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 1130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 347, independent conditional: 234, independent unconditional: 113, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 363, independent: 347, independent conditional: 144, independent unconditional: 203, 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: 363, independent: 347, independent conditional: 144, independent unconditional: 203, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 363, independent: 345, independent conditional: 144, independent unconditional: 201, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 450, Positive conditional cache size: 27, Positive unconditional cache size: 423, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 143, independent conditional: 98, independent unconditional: 45, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 143, independent conditional: 60, independent unconditional: 83, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 143, independent conditional: 60, independent unconditional: 83, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 141, independent conditional: 60, independent unconditional: 81, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 452, Positive conditional cache size: 27, Positive unconditional cache size: 425, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.4s, 93 PlacesBefore, 90 PlacesAfterwards, 74 TransitionsBefore, 71 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 127, independent conditional: 120, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 127, independent conditional: 58, independent unconditional: 69, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 127, independent conditional: 58, independent unconditional: 69, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 20, independent unconditional: 11, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 135, independent: 96, independent conditional: 38, independent unconditional: 58, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 31, unknown conditional: 20, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 557, Positive conditional cache size: 48, Positive unconditional cache size: 509, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 67 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 17, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 35, independent conditional: 17, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 17, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 32, independent conditional: 14, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 689, Positive cache size: 660, Positive conditional cache size: 53, Positive unconditional cache size: 607, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=8, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=9, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=10, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t1084; [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=11, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 4 z = 1 [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 b = 1 [L755] 1 x = 1 [L767] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 y = 1 [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L860] 3 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L862] RET 3 assume_abort_if_not(main$tmp_guard0) [L864] 3 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 3 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 3 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 3 y$flush_delayed = weak$$choice2 [L874] 3 y$mem_tmp = y [L875] 3 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 3 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 3 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 3 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 3 y = y$flush_delayed ? y$mem_tmp : y [L884] 3 y$flush_delayed = (_Bool)0 [L886] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 852]: 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. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 82.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2294 IncrementalHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 39 mSDtfsCounter, 2294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2666occurred in iteration=15, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 3330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:17:47,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...