/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/mix050.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:18:58,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:18:58,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:18:58,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:18:58,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:18:58,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:18:58,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:18:58,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:18:58,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:18:58,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:18:58,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:18:58,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:18:58,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:18:58,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:18:58,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:18:58,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:18:58,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:18:58,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:18:58,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:18:58,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:18:58,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:18:58,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:18:58,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:18:58,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:18:58,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:18:58,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:18:58,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:18:58,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:18:58,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:18:58,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:18:58,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:18:58,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:18:58,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:18:58,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:18:58,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:18:58,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:18:58,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:18:58,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:18:58,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:18:58,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:18:58,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:18:58,106 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:18:58,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:18:58,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:18:58,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:18:58,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:18:58,132 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:18:58,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:18:58,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:18:58,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:18:58,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:18:58,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:18:58,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:18:58,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:18:58,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:18:58,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:18:58,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:58,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:18:58,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:18:58,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:18:58,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:18:58,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:18:58,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:18:58,135 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:18:58,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:18:58,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:18:58,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:18:58,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:18:58,484 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:18:58,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-06 04:18:59,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:18:59,763 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:18:59,763 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-06 04:18:59,789 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd7a05a7/b5d8875bd1ab467db649b95fbcc73d3c/FLAG97bcf19e2 [2022-12-06 04:18:59,800 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd7a05a7/b5d8875bd1ab467db649b95fbcc73d3c [2022-12-06 04:18:59,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:18:59,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:18:59,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:59,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:18:59,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:18:59,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:59" (1/1) ... [2022-12-06 04:18:59,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b171b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:59, skipping insertion in model container [2022-12-06 04:18:59,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:59" (1/1) ... [2022-12-06 04:18:59,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:18:59,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:18:59,965 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/mix050.i[940,953] [2022-12-06 04:19:00,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:00,139 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:19:00,146 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/mix050.i[940,953] [2022-12-06 04:19:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:00,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:00,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:00,233 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:19:00,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00 WrapperNode [2022-12-06 04:19:00,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:19:00,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:00,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:19:00,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:19:00,239 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:19:00" (1/1) ... [2022-12-06 04:19:00,264 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:19:00" (1/1) ... [2022-12-06 04:19:00,295 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:19:00,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:00,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:19:00,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:19:00,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:19:00,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:19:00,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:19:00,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:19:00,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:19:00,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (1/1) ... [2022-12-06 04:19:00,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:19:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:19:00,391 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:19:00,409 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:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:19:00,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:19:00,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:19:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:19:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:19:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:19:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:19:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:19:00,444 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:19:00,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:19:00,608 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:19:00,903 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:19:00,987 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:19:00,988 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:19:00,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:00 BoogieIcfgContainer [2022-12-06 04:19:00,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:19:00,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:19:00,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:19:01,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:19:01,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:18:59" (1/3) ... [2022-12-06 04:19:01,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:01, skipping insertion in model container [2022-12-06 04:19:01,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:00" (2/3) ... [2022-12-06 04:19:01,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:01, skipping insertion in model container [2022-12-06 04:19:01,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:00" (3/3) ... [2022-12-06 04:19:01,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2022-12-06 04:19:01,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:19:01,088 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:19:01,088 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:19:01,148 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:19:01,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:19:01,232 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:19:01,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:19:01,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:19:01,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 04:19:01,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:01,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:19:01,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 04:19:01,311 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:19:01,311 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:01,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:19:01,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:19:01,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-06 04:19:05,663 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:19:05,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:19:05,678 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;@245e489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:19:05,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:19:05,680 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:19:05,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:05,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:05,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:19:05,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 544600, now seen corresponding path program 1 times [2022-12-06 04:19:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:05,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805194365] [2022-12-06 04:19:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:06,030 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:19:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805194365] [2022-12-06 04:19:06,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805194365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:06,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:06,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355687750] [2022-12-06 04:19:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:06,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:06,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:19:06,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:06,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:06,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:19:06,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:07,014 INFO L130 PetriNetUnfolder]: 6050/8778 cut-off events. [2022-12-06 04:19:07,014 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 04:19:07,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17177 conditions, 8778 events. 6050/8778 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 52158 event pairs, 1106 based on Foata normal form. 0/8050 useless extension candidates. Maximal degree in co-relation 17165. Up to 6574 conditions per place. [2022-12-06 04:19:07,098 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 41 selfloop transitions, 2 changer transitions 10/56 dead transitions. [2022-12-06 04:19:07,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 239 flow [2022-12-06 04:19:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 04:19:07,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 04:19:07,107 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-06 04:19:07,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 239 flow [2022-12-06 04:19:07,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:07,111 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:07,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-06 04:19:07,115 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:19:07,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:07,115 INFO L89 Accepts]: Start accepts. Operand has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:07,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:07,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:07,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:07,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:07,123 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:19:07,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:07,124 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 46 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:19:07,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:07,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 04:19:07,213 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:07,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 04:19:07,214 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:07,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:07,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:07,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:07,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:19:07,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1910169861, now seen corresponding path program 1 times [2022-12-06 04:19:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:07,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085661344] [2022-12-06 04:19:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:07,415 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:19:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085661344] [2022-12-06 04:19:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085661344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739147078] [2022-12-06 04:19:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:07,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:07,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:07,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:07,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:07,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:07,937 INFO L130 PetriNetUnfolder]: 3395/4866 cut-off events. [2022-12-06 04:19:07,937 INFO L131 PetriNetUnfolder]: For 333/333 co-relation queries the response was YES. [2022-12-06 04:19:07,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10214 conditions, 4866 events. 3395/4866 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25138 event pairs, 634 based on Foata normal form. 320/5173 useless extension candidates. Maximal degree in co-relation 10204. Up to 3244 conditions per place. [2022-12-06 04:19:07,963 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2022-12-06 04:19:07,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 310 flow [2022-12-06 04:19:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 04:19:07,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-06 04:19:07,965 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 87 transitions. [2022-12-06 04:19:07,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 310 flow [2022-12-06 04:19:07,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:07,967 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 107 flow [2022-12-06 04:19:07,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-06 04:19:07,968 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:19:07,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:07,968 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 107 flow [2022-12-06 04:19:07,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:07,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:07,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 107 flow [2022-12-06 04:19:07,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 107 flow [2022-12-06 04:19:07,980 INFO L130 PetriNetUnfolder]: 73/153 cut-off events. [2022-12-06 04:19:07,980 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 04:19:07,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 153 events. 73/153 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 592 event pairs, 40 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 378. Up to 104 conditions per place. [2022-12-06 04:19:07,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 107 flow [2022-12-06 04:19:07,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 04:19:08,044 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:08,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 04:19:08,045 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 107 flow [2022-12-06 04:19:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:08,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:08,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:08,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:19:08,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1502398820, now seen corresponding path program 1 times [2022-12-06 04:19:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:08,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354901502] [2022-12-06 04:19:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:08,232 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:19:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:08,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354901502] [2022-12-06 04:19:08,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354901502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:08,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:08,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:19:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16351175] [2022-12-06 04:19:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:19:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:19:08,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:19:08,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:08,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 107 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:19:08,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:08,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:08,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:08,639 INFO L130 PetriNetUnfolder]: 1883/2841 cut-off events. [2022-12-06 04:19:08,639 INFO L131 PetriNetUnfolder]: For 929/929 co-relation queries the response was YES. [2022-12-06 04:19:08,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 2841 events. 1883/2841 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14250 event pairs, 373 based on Foata normal form. 212/3040 useless extension candidates. Maximal degree in co-relation 7618. Up to 994 conditions per place. [2022-12-06 04:19:08,651 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 51 selfloop transitions, 9 changer transitions 27/90 dead transitions. [2022-12-06 04:19:08,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 459 flow [2022-12-06 04:19:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 04:19:08,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-06 04:19:08,653 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 107 flow. Second operand 6 states and 107 transitions. [2022-12-06 04:19:08,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 459 flow [2022-12-06 04:19:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 90 transitions, 452 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:08,660 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 172 flow [2022-12-06 04:19:08,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-06 04:19:08,661 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-06 04:19:08,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:08,661 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 172 flow [2022-12-06 04:19:08,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:08,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:08,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 172 flow [2022-12-06 04:19:08,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 172 flow [2022-12-06 04:19:08,672 INFO L130 PetriNetUnfolder]: 49/117 cut-off events. [2022-12-06 04:19:08,672 INFO L131 PetriNetUnfolder]: For 207/222 co-relation queries the response was YES. [2022-12-06 04:19:08,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 117 events. 49/117 cut-off events. For 207/222 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 424. Up to 76 conditions per place. [2022-12-06 04:19:08,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 172 flow [2022-12-06 04:19:08,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 04:19:08,733 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:08,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 04:19:08,734 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 172 flow [2022-12-06 04:19:08,734 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:19:08,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:08,734 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:19:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:19:08,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2116896806, now seen corresponding path program 1 times [2022-12-06 04:19:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116023545] [2022-12-06 04:19:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:08,875 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:19:08,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:08,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116023545] [2022-12-06 04:19:08,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116023545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:08,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:08,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207411882] [2022-12-06 04:19:08,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:08,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:19:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:19:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:19:08,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:08,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:08,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:08,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:08,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:09,203 INFO L130 PetriNetUnfolder]: 1163/1797 cut-off events. [2022-12-06 04:19:09,203 INFO L131 PetriNetUnfolder]: For 1694/1694 co-relation queries the response was YES. [2022-12-06 04:19:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 1797 events. 1163/1797 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8542 event pairs, 329 based on Foata normal form. 77/1861 useless extension candidates. Maximal degree in co-relation 5414. Up to 630 conditions per place. [2022-12-06 04:19:09,213 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 62 selfloop transitions, 13 changer transitions 27/105 dead transitions. [2022-12-06 04:19:09,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 105 transitions, 628 flow [2022-12-06 04:19:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:19:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:19:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-06 04:19:09,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6613756613756614 [2022-12-06 04:19:09,216 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 172 flow. Second operand 7 states and 125 transitions. [2022-12-06 04:19:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 105 transitions, 628 flow [2022-12-06 04:19:09,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 105 transitions, 566 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:09,230 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 222 flow [2022-12-06 04:19:09,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2022-12-06 04:19:09,231 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-06 04:19:09,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:09,232 INFO L89 Accepts]: Start accepts. Operand has 50 places, 39 transitions, 222 flow [2022-12-06 04:19:09,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:09,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:09,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 222 flow [2022-12-06 04:19:09,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 222 flow [2022-12-06 04:19:09,242 INFO L130 PetriNetUnfolder]: 25/75 cut-off events. [2022-12-06 04:19:09,242 INFO L131 PetriNetUnfolder]: For 139/154 co-relation queries the response was YES. [2022-12-06 04:19:09,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 75 events. 25/75 cut-off events. For 139/154 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 172 event pairs, 2 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 265. Up to 42 conditions per place. [2022-12-06 04:19:09,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 222 flow [2022-12-06 04:19:09,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 04:19:09,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:09,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:19:09,246 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 222 flow [2022-12-06 04:19:09,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:09,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:09,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:09,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:19:09,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1373004658, now seen corresponding path program 1 times [2022-12-06 04:19:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:09,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397027422] [2022-12-06 04:19:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:09,432 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:19:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397027422] [2022-12-06 04:19:09,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397027422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:09,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:09,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:19:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482652231] [2022-12-06 04:19:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:09,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:09,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:09,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:19:09,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:09,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:09,713 INFO L130 PetriNetUnfolder]: 1011/1543 cut-off events. [2022-12-06 04:19:09,713 INFO L131 PetriNetUnfolder]: For 1419/1419 co-relation queries the response was YES. [2022-12-06 04:19:09,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4492 conditions, 1543 events. 1011/1543 cut-off events. For 1419/1419 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7173 event pairs, 326 based on Foata normal form. 14/1544 useless extension candidates. Maximal degree in co-relation 4476. Up to 630 conditions per place. [2022-12-06 04:19:09,728 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 58 selfloop transitions, 17 changer transitions 14/92 dead transitions. [2022-12-06 04:19:09,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 564 flow [2022-12-06 04:19:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:19:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:19:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2022-12-06 04:19:09,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2022-12-06 04:19:09,730 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 222 flow. Second operand 8 states and 115 transitions. [2022-12-06 04:19:09,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 564 flow [2022-12-06 04:19:09,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 502 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 04:19:09,745 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 216 flow [2022-12-06 04:19:09,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-06 04:19:09,747 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-06 04:19:09,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:09,747 INFO L89 Accepts]: Start accepts. Operand has 53 places, 39 transitions, 216 flow [2022-12-06 04:19:09,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:09,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:09,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 216 flow [2022-12-06 04:19:09,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 216 flow [2022-12-06 04:19:09,756 INFO L130 PetriNetUnfolder]: 17/55 cut-off events. [2022-12-06 04:19:09,757 INFO L131 PetriNetUnfolder]: For 75/84 co-relation queries the response was YES. [2022-12-06 04:19:09,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 55 events. 17/55 cut-off events. For 75/84 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 108 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 163. Up to 18 conditions per place. [2022-12-06 04:19:09,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 216 flow [2022-12-06 04:19:09,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 04:19:10,055 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:19:10,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-06 04:19:10,057 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 212 flow [2022-12-06 04:19:10,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:19:10,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:10,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:10,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:19:10,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash -940083997, now seen corresponding path program 1 times [2022-12-06 04:19:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:10,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263396168] [2022-12-06 04:19:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:11,211 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:19:11,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:11,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263396168] [2022-12-06 04:19:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263396168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:11,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:11,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:19:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408416094] [2022-12-06 04:19:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:19:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:19:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:19:11,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:19:11,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19:11,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:11,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:19:11,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:11,692 INFO L130 PetriNetUnfolder]: 1424/2284 cut-off events. [2022-12-06 04:19:11,692 INFO L131 PetriNetUnfolder]: For 2738/2738 co-relation queries the response was YES. [2022-12-06 04:19:11,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6710 conditions, 2284 events. 1424/2284 cut-off events. For 2738/2738 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12558 event pairs, 145 based on Foata normal form. 1/2281 useless extension candidates. Maximal degree in co-relation 6692. Up to 740 conditions per place. [2022-12-06 04:19:11,701 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 86 selfloop transitions, 7 changer transitions 42/138 dead transitions. [2022-12-06 04:19:11,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 138 transitions, 1087 flow [2022-12-06 04:19:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:19:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:19:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 04:19:11,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2022-12-06 04:19:11,703 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 212 flow. Second operand 7 states and 103 transitions. [2022-12-06 04:19:11,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 138 transitions, 1087 flow [2022-12-06 04:19:11,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 138 transitions, 860 flow, removed 54 selfloop flow, removed 7 redundant places. [2022-12-06 04:19:11,717 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 203 flow [2022-12-06 04:19:11,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-06 04:19:11,720 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2022-12-06 04:19:11,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:11,720 INFO L89 Accepts]: Start accepts. Operand has 52 places, 42 transitions, 203 flow [2022-12-06 04:19:11,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:11,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:11,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 203 flow [2022-12-06 04:19:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 203 flow [2022-12-06 04:19:11,731 INFO L130 PetriNetUnfolder]: 49/119 cut-off events. [2022-12-06 04:19:11,731 INFO L131 PetriNetUnfolder]: For 121/137 co-relation queries the response was YES. [2022-12-06 04:19:11,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 119 events. 49/119 cut-off events. For 121/137 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 448 event pairs, 0 based on Foata normal form. 8/113 useless extension candidates. Maximal degree in co-relation 323. Up to 37 conditions per place. [2022-12-06 04:19:11,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 203 flow [2022-12-06 04:19:11,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 04:19:11,751 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:11,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 04:19:11,752 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 203 flow [2022-12-06 04:19:11,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19:11,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:11,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:11,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:19:11,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1126765637, now seen corresponding path program 2 times [2022-12-06 04:19:11,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:11,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932337954] [2022-12-06 04:19:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:11,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:11,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932337954] [2022-12-06 04:19:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932337954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563183316] [2022-12-06 04:19:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:11,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:19:11,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 203 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:19:11,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:11,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:19:11,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:12,240 INFO L130 PetriNetUnfolder]: 2294/3682 cut-off events. [2022-12-06 04:19:12,240 INFO L131 PetriNetUnfolder]: For 3714/3714 co-relation queries the response was YES. [2022-12-06 04:19:12,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10995 conditions, 3682 events. 2294/3682 cut-off events. For 3714/3714 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22037 event pairs, 227 based on Foata normal form. 2/3679 useless extension candidates. Maximal degree in co-relation 10976. Up to 1823 conditions per place. [2022-12-06 04:19:12,257 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 61 selfloop transitions, 1 changer transitions 33/97 dead transitions. [2022-12-06 04:19:12,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 652 flow [2022-12-06 04:19:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:19:12,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 04:19:12,259 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 203 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:19:12,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 652 flow [2022-12-06 04:19:12,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 630 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:12,289 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 201 flow [2022-12-06 04:19:12,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-06 04:19:12,289 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2022-12-06 04:19:12,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:12,289 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 201 flow [2022-12-06 04:19:12,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:12,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:12,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 201 flow [2022-12-06 04:19:12,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 201 flow [2022-12-06 04:19:12,301 INFO L130 PetriNetUnfolder]: 58/147 cut-off events. [2022-12-06 04:19:12,301 INFO L131 PetriNetUnfolder]: For 145/156 co-relation queries the response was YES. [2022-12-06 04:19:12,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 147 events. 58/147 cut-off events. For 145/156 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 619 event pairs, 0 based on Foata normal form. 7/137 useless extension candidates. Maximal degree in co-relation 390. Up to 47 conditions per place. [2022-12-06 04:19:12,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 201 flow [2022-12-06 04:19:12,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-06 04:19:12,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:12,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:19:12,339 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 199 flow [2022-12-06 04:19:12,339 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:19:12,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:12,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:19:12,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1191381805, now seen corresponding path program 1 times [2022-12-06 04:19:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864737037] [2022-12-06 04:19:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:12,534 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:19:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864737037] [2022-12-06 04:19:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864737037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:12,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:12,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:12,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226809345] [2022-12-06 04:19:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:12,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:12,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:19:12,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:12,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:12,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:19:12,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:12,985 INFO L130 PetriNetUnfolder]: 2132/3497 cut-off events. [2022-12-06 04:19:12,986 INFO L131 PetriNetUnfolder]: For 4105/4106 co-relation queries the response was YES. [2022-12-06 04:19:12,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 3497 events. 2132/3497 cut-off events. For 4105/4106 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20766 event pairs, 218 based on Foata normal form. 2/3459 useless extension candidates. Maximal degree in co-relation 10628. Up to 1550 conditions per place. [2022-12-06 04:19:13,007 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 57 selfloop transitions, 1 changer transitions 32/92 dead transitions. [2022-12-06 04:19:13,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 92 transitions, 624 flow [2022-12-06 04:19:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:19:13,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:19:13,009 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 199 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:19:13,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 92 transitions, 624 flow [2022-12-06 04:19:13,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 618 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:13,054 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 203 flow [2022-12-06 04:19:13,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-06 04:19:13,056 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2022-12-06 04:19:13,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:13,057 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 203 flow [2022-12-06 04:19:13,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:13,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:13,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 203 flow [2022-12-06 04:19:13,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 203 flow [2022-12-06 04:19:13,079 INFO L130 PetriNetUnfolder]: 71/183 cut-off events. [2022-12-06 04:19:13,080 INFO L131 PetriNetUnfolder]: For 169/186 co-relation queries the response was YES. [2022-12-06 04:19:13,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 183 events. 71/183 cut-off events. For 169/186 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 855 event pairs, 0 based on Foata normal form. 7/165 useless extension candidates. Maximal degree in co-relation 491. Up to 65 conditions per place. [2022-12-06 04:19:13,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 203 flow [2022-12-06 04:19:13,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 04:19:13,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:13,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 04:19:13,114 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 201 flow [2022-12-06 04:19:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:13,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:13,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:19:13,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1040582015, now seen corresponding path program 1 times [2022-12-06 04:19:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:13,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743619109] [2022-12-06 04:19:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:13,352 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:19:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:13,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743619109] [2022-12-06 04:19:13,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743619109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:13,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:13,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:13,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107724979] [2022-12-06 04:19:13,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:13,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:13,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:19:13,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 201 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:13,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:13,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:19:13,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:13,763 INFO L130 PetriNetUnfolder]: 1766/2873 cut-off events. [2022-12-06 04:19:13,764 INFO L131 PetriNetUnfolder]: For 3696/3696 co-relation queries the response was YES. [2022-12-06 04:19:13,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9365 conditions, 2873 events. 1766/2873 cut-off events. For 3696/3696 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15349 event pairs, 509 based on Foata normal form. 2/2875 useless extension candidates. Maximal degree in co-relation 9346. Up to 1118 conditions per place. [2022-12-06 04:19:13,779 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 49 selfloop transitions, 3 changer transitions 30/82 dead transitions. [2022-12-06 04:19:13,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 568 flow [2022-12-06 04:19:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 04:19:13,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2022-12-06 04:19:13,781 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 201 flow. Second operand 4 states and 45 transitions. [2022-12-06 04:19:13,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 568 flow [2022-12-06 04:19:13,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 564 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:13,818 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 191 flow [2022-12-06 04:19:13,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-06 04:19:13,819 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-06 04:19:13,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:13,820 INFO L89 Accepts]: Start accepts. Operand has 53 places, 37 transitions, 191 flow [2022-12-06 04:19:13,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:13,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:13,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 191 flow [2022-12-06 04:19:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 37 transitions, 191 flow [2022-12-06 04:19:13,841 INFO L130 PetriNetUnfolder]: 75/206 cut-off events. [2022-12-06 04:19:13,841 INFO L131 PetriNetUnfolder]: For 211/230 co-relation queries the response was YES. [2022-12-06 04:19:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 206 events. 75/206 cut-off events. For 211/230 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1035 event pairs, 5 based on Foata normal form. 11/191 useless extension candidates. Maximal degree in co-relation 575. Up to 66 conditions per place. [2022-12-06 04:19:13,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 37 transitions, 191 flow [2022-12-06 04:19:13,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:19:14,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:14,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 04:19:14,046 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 194 flow [2022-12-06 04:19:14,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:14,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:14,046 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:19:14,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:19:14,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash 277322901, now seen corresponding path program 1 times [2022-12-06 04:19:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:14,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689890288] [2022-12-06 04:19:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:14,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:19:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:14,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:19:14,243 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:19:14,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:19:14,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:19:14,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:19:14,246 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:14,250 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:19:14,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:19:14,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:19:14 BasicIcfg [2022-12-06 04:19:14,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:19:14,329 INFO L158 Benchmark]: Toolchain (without parser) took 14525.89ms. Allocated memory was 189.8MB in the beginning and 700.4MB in the end (delta: 510.7MB). Free memory was 148.2MB in the beginning and 333.4MB in the end (delta: -185.2MB). Peak memory consumption was 325.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,329 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 104.6MB in the beginning and 104.5MB in the end (delta: 35.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:19:14,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.74ms. Allocated memory is still 189.8MB. Free memory was 148.0MB in the beginning and 144.0MB in the end (delta: 3.9MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.09ms. Allocated memory is still 189.8MB. Free memory was 144.0MB in the beginning and 141.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,330 INFO L158 Benchmark]: Boogie Preprocessor took 29.97ms. Allocated memory is still 189.8MB. Free memory was 141.3MB in the beginning and 139.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,330 INFO L158 Benchmark]: RCFGBuilder took 652.47ms. Allocated memory is still 189.8MB. Free memory was 139.6MB in the beginning and 134.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,330 INFO L158 Benchmark]: TraceAbstraction took 13335.35ms. Allocated memory was 189.8MB in the beginning and 700.4MB in the end (delta: 510.7MB). Free memory was 133.7MB in the beginning and 333.4MB in the end (delta: -199.7MB). Peak memory consumption was 310.4MB. Max. memory is 8.0GB. [2022-12-06 04:19:14,331 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 was 104.6MB in the beginning and 104.5MB in the end (delta: 35.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.74ms. Allocated memory is still 189.8MB. Free memory was 148.0MB in the beginning and 144.0MB in the end (delta: 3.9MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.09ms. Allocated memory is still 189.8MB. Free memory was 144.0MB in the beginning and 141.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.97ms. Allocated memory is still 189.8MB. Free memory was 141.3MB in the beginning and 139.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 652.47ms. Allocated memory is still 189.8MB. Free memory was 139.6MB in the beginning and 134.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * TraceAbstraction took 13335.35ms. Allocated memory was 189.8MB in the beginning and 700.4MB in the end (delta: 510.7MB). Free memory was 133.7MB in the beginning and 333.4MB in the end (delta: -199.7MB). Peak memory consumption was 310.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 137 PlacesBefore, 47 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2386, independent: 2320, independent conditional: 2320, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2386, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2386, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2386, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1834, independent: 1791, independent conditional: 0, independent unconditional: 1791, 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: 1834, independent: 1770, independent conditional: 0, independent unconditional: 1770, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 225, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2386, independent: 529, independent conditional: 0, independent unconditional: 529, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1834, unknown conditional: 0, unknown unconditional: 1834] , Statistics on independence cache: Total cache size (in pairs): 2787, Positive cache size: 2744, Positive conditional cache size: 0, Positive unconditional cache size: 2744, 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, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 20, independent unconditional: 107, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 127, independent conditional: 20, independent unconditional: 107, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 20, independent unconditional: 107, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 120, independent conditional: 19, independent unconditional: 101, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 80, dependent conditional: 55, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 143, unknown conditional: 29, unknown unconditional: 114] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 120, Positive conditional cache size: 19, Positive unconditional cache size: 101, Negative cache size: 23, Negative conditional cache size: 10, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 94, 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: 118, independent: 94, independent conditional: 7, independent unconditional: 87, 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: 118, independent: 94, independent conditional: 7, independent unconditional: 87, 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: 118, independent: 94, independent conditional: 7, independent unconditional: 87, 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: 22, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 80, independent conditional: 7, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 134, Positive conditional cache size: 19, Positive unconditional cache size: 115, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 86, independent conditional: 3, independent unconditional: 83, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 86, independent conditional: 3, independent unconditional: 83, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 86, independent conditional: 3, independent unconditional: 83, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 77, independent conditional: 3, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 143, Positive conditional cache size: 19, Positive unconditional cache size: 124, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, 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, 48 PlacesBefore, 48 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 142, independent: 104, independent conditional: 16, independent unconditional: 88, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 149, Positive conditional cache size: 25, Positive unconditional cache size: 124, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, 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.3s, 51 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 202, independent conditional: 14, independent unconditional: 188, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 202, independent conditional: 14, independent unconditional: 188, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 202, independent conditional: 14, independent unconditional: 188, dependent: 64, dependent conditional: 0, dependent unconditional: 64, 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: 266, independent: 202, independent conditional: 14, independent unconditional: 188, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 151, Positive conditional cache size: 25, Positive unconditional cache size: 126, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, 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, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 94, independent conditional: 94, 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: 115, independent: 94, independent conditional: 48, independent unconditional: 46, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 94, independent conditional: 48, independent unconditional: 46, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 94, independent conditional: 48, independent unconditional: 46, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 88, independent conditional: 42, independent unconditional: 46, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 157, Positive conditional cache size: 31, Positive unconditional cache size: 126, Negative cache size: 43, Negative conditional cache size: 14, Negative unconditional cache size: 29, 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 193, independent: 161, independent conditional: 83, independent unconditional: 78, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 161, independent conditional: 83, independent unconditional: 78, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 161, independent conditional: 83, independent unconditional: 78, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 146, independent conditional: 83, independent unconditional: 63, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 188, Positive conditional cache size: 33, Positive unconditional cache size: 155, Negative cache size: 45, Negative conditional cache size: 14, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 106, independent conditional: 71, independent unconditional: 35, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 106, independent conditional: 71, independent unconditional: 35, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 106, independent conditional: 71, independent unconditional: 35, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 105, independent conditional: 70, independent unconditional: 35, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 205, Positive conditional cache size: 36, Positive unconditional cache size: 169, Negative cache size: 47, Negative conditional cache size: 14, Negative unconditional cache size: 33, 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.2s, 52 PlacesBefore, 52 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 31, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 4, independent: 4, independent conditional: 3, 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: 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: 31, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 211, Positive conditional cache size: 39, Positive unconditional cache size: 172, Negative cache size: 47, Negative conditional cache size: 14, Negative unconditional cache size: 33, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1321, ((void *)0), P0, ((void *)0))=10, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=11, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L782] 2 x = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=12, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] 0 pthread_t t1324; [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=13, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L822] 4 z = 1 [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, 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: 866]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1133 IncrementalHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 4 mSDtfsCounter, 1133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=4, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:19:14,355 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...