/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:18:28,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:18:28,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:18:28,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:18:28,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:18:28,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:18:28,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:18:28,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:18:28,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:18:28,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:18:28,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:18:28,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:18:28,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:18:28,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:18:28,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:18:28,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:18:28,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:18:28,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:18:28,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:18:28,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:18:28,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:18:28,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:18:28,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:18:28,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:18:28,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:18:28,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:18:28,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:18:28,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:18:28,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:18:28,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:18:28,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:18:28,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:18:28,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:18:28,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:18:28,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:18:28,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:18:28,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:18:28,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:18:28,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:18:28,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:18:28,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:18:28,084 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:28,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:18:28,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:18:28,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:18:28,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:18:28,117 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:18:28,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:18:28,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:18:28,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:18:28,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:18:28,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:18:28,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:18:28,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:18:28,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:18:28,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:18:28,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:18:28,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:28,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:18:28,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:18:28,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:18:28,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:18:28,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:18:28,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:18:28,120 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:28,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:18:28,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:18:28,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:18:28,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:18:28,394 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:18:28,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:29,483 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:18:29,756 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:18:29,757 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:29,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ffc2c545/6b80a038576045d29b4259be44df0250/FLAGc313e19d1 [2022-12-06 04:18:29,796 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ffc2c545/6b80a038576045d29b4259be44df0250 [2022-12-06 04:18:29,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:18:29,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:18:29,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:29,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:18:29,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:18:29,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:29" (1/1) ... [2022-12-06 04:18:29,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146a0110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:29, skipping insertion in model container [2022-12-06 04:18:29,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:29" (1/1) ... [2022-12-06 04:18:29,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:18:29,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:18:29,991 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:18:30,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:30,181 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:18:30,189 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:18:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:30,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:30,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:30,266 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:18:30,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30 WrapperNode [2022-12-06 04:18:30,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:30,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:30,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:18:30,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:18:30,274 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:18:30" (1/1) ... [2022-12-06 04:18:30,288 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:18:30" (1/1) ... [2022-12-06 04:18:30,335 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-06 04:18:30,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:30,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:18:30,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:18:30,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:18:30,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,377 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:18:30,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:18:30,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:18:30,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:18:30,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (1/1) ... [2022-12-06 04:18:30,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:30,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:18:30,457 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:18:30,471 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:18:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:18:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:18:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:18:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:18:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:18:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:18:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:18:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:18:30,503 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:18:30,676 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:18:30,677 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:18:30,867 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:18:30,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:18:30,974 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:18:30,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:30 BoogieIcfgContainer [2022-12-06 04:18:30,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:18:30,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:18:30,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:18:30,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:18:30,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:18:29" (1/3) ... [2022-12-06 04:18:30,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e92ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:30, skipping insertion in model container [2022-12-06 04:18:30,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:30" (2/3) ... [2022-12-06 04:18:30,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e92ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:30, skipping insertion in model container [2022-12-06 04:18:30,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:30" (3/3) ... [2022-12-06 04:18:30,982 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:30,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:18:30,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:18:30,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:18:31,041 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:18:31,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:18:31,149 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:18:31,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:31,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:18:31,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:18:31,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 04:18:31,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:31,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:18:31,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 04:18:31,233 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:18:31,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:31,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:18:31,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:18:31,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-06 04:18:36,089 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:18:36,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:18:36,110 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;@7192e4f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:18:36,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:18:36,114 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:18:36,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:36,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:36,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:36,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1514565341, now seen corresponding path program 1 times [2022-12-06 04:18:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:36,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119497992] [2022-12-06 04:18:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:36,439 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:18:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:36,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119497992] [2022-12-06 04:18:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119497992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:36,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:36,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47891261] [2022-12-06 04:18:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:36,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:36,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-06 04:18:36,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:36,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:36,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-06 04:18:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:36,880 INFO L130 PetriNetUnfolder]: 2891/4513 cut-off events. [2022-12-06 04:18:36,880 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:18:36,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8613 conditions, 4513 events. 2891/4513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26826 event pairs, 668 based on Foata normal form. 0/4212 useless extension candidates. Maximal degree in co-relation 8601. Up to 2980 conditions per place. [2022-12-06 04:18:36,902 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 31 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2022-12-06 04:18:36,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 170 flow [2022-12-06 04:18:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 04:18:36,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-06 04:18:36,911 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 57 transitions. [2022-12-06 04:18:36,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 170 flow [2022-12-06 04:18:36,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:18:36,915 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2022-12-06 04:18:36,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 04:18:36,919 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 04:18:36,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:36,919 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 66 flow [2022-12-06 04:18:36,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:36,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:36,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 66 flow [2022-12-06 04:18:36,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:18:36,926 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:18:36,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:36,926 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 3. Compared 29 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:18:36,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:18:36,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 04:18:37,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:37,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 04:18:37,162 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 04:18:37,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:37,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:37,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:37,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:18:37,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -496507795, now seen corresponding path program 1 times [2022-12-06 04:18:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:37,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618871738] [2022-12-06 04:18:37,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:37,468 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:18:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618871738] [2022-12-06 04:18:37,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618871738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:37,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:37,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991828578] [2022-12-06 04:18:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:37,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:37,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:37,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:18:37,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:37,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:37,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:18:37,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:38,216 INFO L130 PetriNetUnfolder]: 7719/10640 cut-off events. [2022-12-06 04:18:38,217 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-06 04:18:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21726 conditions, 10640 events. 7719/10640 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 50798 event pairs, 1847 based on Foata normal form. 400/11040 useless extension candidates. Maximal degree in co-relation 21716. Up to 5729 conditions per place. [2022-12-06 04:18:38,265 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 43 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-06 04:18:38,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 224 flow [2022-12-06 04:18:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 04:18:38,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 04:18:38,268 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 4 states and 55 transitions. [2022-12-06 04:18:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 224 flow [2022-12-06 04:18:38,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:38,272 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 04:18:38,272 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-12-06 04:18:38,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:38,273 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:38,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:38,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,340 INFO L130 PetriNetUnfolder]: 534/999 cut-off events. [2022-12-06 04:18:38,341 INFO L131 PetriNetUnfolder]: For 185/250 co-relation queries the response was YES. [2022-12-06 04:18:38,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 999 events. 534/999 cut-off events. For 185/250 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5875 event pairs, 225 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 2234. Up to 596 conditions per place. [2022-12-06 04:18:38,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 04:18:38,365 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:38,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 04:18:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 136 flow [2022-12-06 04:18:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:38,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:38,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:38,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:18:38,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash -402321547, now seen corresponding path program 1 times [2022-12-06 04:18:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:38,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058828847] [2022-12-06 04:18:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:38,612 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:18:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058828847] [2022-12-06 04:18:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058828847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108311518] [2022-12-06 04:18:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:38,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:38,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:18:38,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 136 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:38,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:38,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:18:38,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:39,586 INFO L130 PetriNetUnfolder]: 8653/11938 cut-off events. [2022-12-06 04:18:39,587 INFO L131 PetriNetUnfolder]: For 5351/5351 co-relation queries the response was YES. [2022-12-06 04:18:39,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 11938 events. 8653/11938 cut-off events. For 5351/5351 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 59698 event pairs, 779 based on Foata normal form. 40/11978 useless extension candidates. Maximal degree in co-relation 32640. Up to 7441 conditions per place. [2022-12-06 04:18:39,629 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 54 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2022-12-06 04:18:39,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 412 flow [2022-12-06 04:18:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:18:39,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 04:18:39,630 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 136 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:18:39,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 412 flow [2022-12-06 04:18:39,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:39,638 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 04:18:39,639 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-06 04:18:39,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:39,639 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:39,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:39,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,722 INFO L130 PetriNetUnfolder]: 709/1300 cut-off events. [2022-12-06 04:18:39,722 INFO L131 PetriNetUnfolder]: For 1440/1554 co-relation queries the response was YES. [2022-12-06 04:18:39,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1300 events. 709/1300 cut-off events. For 1440/1554 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7892 event pairs, 255 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 4232. Up to 695 conditions per place. [2022-12-06 04:18:39,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 04:18:39,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:39,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 04:18:39,756 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 277 flow [2022-12-06 04:18:39,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:39,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:39,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:18:39,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 412934032, now seen corresponding path program 1 times [2022-12-06 04:18:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:39,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679421658] [2022-12-06 04:18:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:39,864 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:18:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:39,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679421658] [2022-12-06 04:18:39,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679421658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:39,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:39,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700474789] [2022-12-06 04:18:39,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:39,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:39,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:18:39,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:39,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:39,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:18:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:40,480 INFO L130 PetriNetUnfolder]: 5754/8413 cut-off events. [2022-12-06 04:18:40,480 INFO L131 PetriNetUnfolder]: For 15345/15409 co-relation queries the response was YES. [2022-12-06 04:18:40,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28898 conditions, 8413 events. 5754/8413 cut-off events. For 15345/15409 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 47555 event pairs, 1186 based on Foata normal form. 40/8195 useless extension candidates. Maximal degree in co-relation 28881. Up to 6964 conditions per place. [2022-12-06 04:18:40,522 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 53 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2022-12-06 04:18:40,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 545 flow [2022-12-06 04:18:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 04:18:40,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-06 04:18:40,524 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 277 flow. Second operand 3 states and 49 transitions. [2022-12-06 04:18:40,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 545 flow [2022-12-06 04:18:40,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:18:40,528 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-06 04:18:40,529 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-12-06 04:18:40,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:40,529 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:40,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:40,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,608 INFO L130 PetriNetUnfolder]: 679/1262 cut-off events. [2022-12-06 04:18:40,608 INFO L131 PetriNetUnfolder]: For 1825/1947 co-relation queries the response was YES. [2022-12-06 04:18:40,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 1262 events. 679/1262 cut-off events. For 1825/1947 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7710 event pairs, 250 based on Foata normal form. 1/1231 useless extension candidates. Maximal degree in co-relation 4411. Up to 665 conditions per place. [2022-12-06 04:18:40,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-06 04:18:40,631 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:40,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 04:18:40,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 360 flow [2022-12-06 04:18:40,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:40,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:40,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:40,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:18:40,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash 350774423, now seen corresponding path program 1 times [2022-12-06 04:18:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060433727] [2022-12-06 04:18:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:40,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:18:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060433727] [2022-12-06 04:18:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060433727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:40,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:40,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151237771] [2022-12-06 04:18:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:40,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:40,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:18:40,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 360 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:40,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:40,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:18:40,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:42,114 INFO L130 PetriNetUnfolder]: 10773/15034 cut-off events. [2022-12-06 04:18:42,115 INFO L131 PetriNetUnfolder]: For 26534/26534 co-relation queries the response was YES. [2022-12-06 04:18:42,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52246 conditions, 15034 events. 10773/15034 cut-off events. For 26534/26534 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 79293 event pairs, 2231 based on Foata normal form. 160/15194 useless extension candidates. Maximal degree in co-relation 52226. Up to 6843 conditions per place. [2022-12-06 04:18:42,177 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 63 selfloop transitions, 29 changer transitions 2/94 dead transitions. [2022-12-06 04:18:42,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 755 flow [2022-12-06 04:18:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 04:18:42,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2022-12-06 04:18:42,181 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 360 flow. Second operand 4 states and 67 transitions. [2022-12-06 04:18:42,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 755 flow [2022-12-06 04:18:42,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 94 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:42,188 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2022-12-06 04:18:42,190 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-12-06 04:18:42,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:42,190 INFO L89 Accepts]: Start accepts. Operand has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:42,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:42,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,280 INFO L130 PetriNetUnfolder]: 672/1315 cut-off events. [2022-12-06 04:18:42,280 INFO L131 PetriNetUnfolder]: For 3622/4009 co-relation queries the response was YES. [2022-12-06 04:18:42,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 1315 events. 672/1315 cut-off events. For 3622/4009 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8428 event pairs, 201 based on Foata normal form. 1/1302 useless extension candidates. Maximal degree in co-relation 5629. Up to 714 conditions per place. [2022-12-06 04:18:42,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 04:18:42,308 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:42,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 04:18:42,310 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 604 flow [2022-12-06 04:18:42,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:42,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:42,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:42,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:18:42,311 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1295743669, now seen corresponding path program 1 times [2022-12-06 04:18:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:42,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133166943] [2022-12-06 04:18:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:42,962 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:18:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:42,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133166943] [2022-12-06 04:18:42,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133166943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:42,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:42,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389039855] [2022-12-06 04:18:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:42,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:42,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:18:42,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 604 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:18:42,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:42,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:18:42,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:44,354 INFO L130 PetriNetUnfolder]: 11407/15964 cut-off events. [2022-12-06 04:18:44,354 INFO L131 PetriNetUnfolder]: For 55570/55570 co-relation queries the response was YES. [2022-12-06 04:18:44,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64446 conditions, 15964 events. 11407/15964 cut-off events. For 55570/55570 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 84601 event pairs, 2449 based on Foata normal form. 56/16020 useless extension candidates. Maximal degree in co-relation 64422. Up to 12551 conditions per place. [2022-12-06 04:18:44,418 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 123 selfloop transitions, 39 changer transitions 15/177 dead transitions. [2022-12-06 04:18:44,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 177 transitions, 1978 flow [2022-12-06 04:18:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 04:18:44,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 04:18:44,419 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 604 flow. Second operand 6 states and 84 transitions. [2022-12-06 04:18:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 177 transitions, 1978 flow [2022-12-06 04:18:44,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 177 transitions, 1950 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-06 04:18:44,466 INFO L231 Difference]: Finished difference. Result has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1131, PETRI_PLACES=63, PETRI_TRANSITIONS=98} [2022-12-06 04:18:44,467 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 04:18:44,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:44,467 INFO L89 Accepts]: Start accepts. Operand has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:44,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:44,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,640 INFO L130 PetriNetUnfolder]: 1136/2137 cut-off events. [2022-12-06 04:18:44,640 INFO L131 PetriNetUnfolder]: For 8294/9038 co-relation queries the response was YES. [2022-12-06 04:18:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10830 conditions, 2137 events. 1136/2137 cut-off events. For 8294/9038 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14248 event pairs, 226 based on Foata normal form. 37/2158 useless extension candidates. Maximal degree in co-relation 10803. Up to 1157 conditions per place. [2022-12-06 04:18:44,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-06 04:18:44,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:44,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 04:18:44,684 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 98 transitions, 1131 flow [2022-12-06 04:18:44,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:18:44,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:44,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:44,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:18:44,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1295446069, now seen corresponding path program 2 times [2022-12-06 04:18:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:44,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014362050] [2022-12-06 04:18:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:45,078 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:18:45,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:45,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014362050] [2022-12-06 04:18:45,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014362050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:45,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:45,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492923838] [2022-12-06 04:18:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:45,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:45,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:45,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:45,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:18:45,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 98 transitions, 1131 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:45,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:45,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:18:45,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:46,103 INFO L130 PetriNetUnfolder]: 8651/12833 cut-off events. [2022-12-06 04:18:46,103 INFO L131 PetriNetUnfolder]: For 63495/64384 co-relation queries the response was YES. [2022-12-06 04:18:46,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59291 conditions, 12833 events. 8651/12833 cut-off events. For 63495/64384 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 76966 event pairs, 2005 based on Foata normal form. 514/13185 useless extension candidates. Maximal degree in co-relation 59261. Up to 9079 conditions per place. [2022-12-06 04:18:46,194 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 90 selfloop transitions, 19 changer transitions 1/136 dead transitions. [2022-12-06 04:18:46,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 1709 flow [2022-12-06 04:18:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 04:18:46,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-06 04:18:46,196 INFO L175 Difference]: Start difference. First operand has 63 places, 98 transitions, 1131 flow. Second operand 4 states and 59 transitions. [2022-12-06 04:18:46,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 1709 flow [2022-12-06 04:18:46,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 1618 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:46,405 INFO L231 Difference]: Finished difference. Result has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1209, PETRI_PLACES=67, PETRI_TRANSITIONS=106} [2022-12-06 04:18:46,406 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-12-06 04:18:46,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:46,407 INFO L89 Accepts]: Start accepts. Operand has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:46,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:46,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,606 INFO L130 PetriNetUnfolder]: 1109/2078 cut-off events. [2022-12-06 04:18:46,606 INFO L131 PetriNetUnfolder]: For 8220/8795 co-relation queries the response was YES. [2022-12-06 04:18:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10816 conditions, 2078 events. 1109/2078 cut-off events. For 8220/8795 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13725 event pairs, 223 based on Foata normal form. 44/2108 useless extension candidates. Maximal degree in co-relation 10786. Up to 1096 conditions per place. [2022-12-06 04:18:46,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 04:18:46,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:46,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 04:18:46,655 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 1209 flow [2022-12-06 04:18:46,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:46,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:46,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:46,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:18:46,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -890352623, now seen corresponding path program 1 times [2022-12-06 04:18:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939154558] [2022-12-06 04:18:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:46,977 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:18:46,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:46,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939154558] [2022-12-06 04:18:46,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939154558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:46,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83412652] [2022-12-06 04:18:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:46,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:46,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:18:46,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 1209 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:18:46,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:46,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:18:46,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:48,392 INFO L130 PetriNetUnfolder]: 10265/15094 cut-off events. [2022-12-06 04:18:48,393 INFO L131 PetriNetUnfolder]: For 75769/77260 co-relation queries the response was YES. [2022-12-06 04:18:48,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73845 conditions, 15094 events. 10265/15094 cut-off events. For 75769/77260 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 93276 event pairs, 3581 based on Foata normal form. 775/15650 useless extension candidates. Maximal degree in co-relation 73812. Up to 10340 conditions per place. [2022-12-06 04:18:48,496 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 91 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2022-12-06 04:18:48,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 156 transitions, 1990 flow [2022-12-06 04:18:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:18:48,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-06 04:18:48,498 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 1209 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:18:48,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 156 transitions, 1990 flow [2022-12-06 04:18:48,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 156 transitions, 1980 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 04:18:48,568 INFO L231 Difference]: Finished difference. Result has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1676, PETRI_PLACES=73, PETRI_TRANSITIONS=131} [2022-12-06 04:18:48,568 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2022-12-06 04:18:48,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:48,568 INFO L89 Accepts]: Start accepts. Operand has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:48,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:48,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,834 INFO L130 PetriNetUnfolder]: 1422/2550 cut-off events. [2022-12-06 04:18:48,834 INFO L131 PetriNetUnfolder]: For 12841/13793 co-relation queries the response was YES. [2022-12-06 04:18:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14902 conditions, 2550 events. 1422/2550 cut-off events. For 12841/13793 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 16746 event pairs, 129 based on Foata normal form. 151/2680 useless extension candidates. Maximal degree in co-relation 14868. Up to 1452 conditions per place. [2022-12-06 04:18:48,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-06 04:18:48,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:48,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-06 04:18:48,889 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 131 transitions, 1676 flow [2022-12-06 04:18:48,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:18:48,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:48,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:48,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:18:48,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash 51778547, now seen corresponding path program 2 times [2022-12-06 04:18:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:48,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943058417] [2022-12-06 04:18:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:49,096 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:18:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:49,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943058417] [2022-12-06 04:18:49,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943058417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:49,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:49,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524368071] [2022-12-06 04:18:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:49,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:49,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:18:49,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 131 transitions, 1676 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:18:49,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:49,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:18:49,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:50,663 INFO L130 PetriNetUnfolder]: 10397/15339 cut-off events. [2022-12-06 04:18:50,664 INFO L131 PetriNetUnfolder]: For 96108/98008 co-relation queries the response was YES. [2022-12-06 04:18:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82168 conditions, 15339 events. 10397/15339 cut-off events. For 96108/98008 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 95113 event pairs, 1395 based on Foata normal form. 1165/16345 useless extension candidates. Maximal degree in co-relation 82131. Up to 9304 conditions per place. [2022-12-06 04:18:50,765 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 98 selfloop transitions, 61 changer transitions 0/185 dead transitions. [2022-12-06 04:18:50,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 185 transitions, 2557 flow [2022-12-06 04:18:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 04:18:50,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2022-12-06 04:18:50,767 INFO L175 Difference]: Start difference. First operand has 73 places, 131 transitions, 1676 flow. Second operand 6 states and 76 transitions. [2022-12-06 04:18:50,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 185 transitions, 2557 flow [2022-12-06 04:18:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 185 transitions, 2532 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:50,884 INFO L231 Difference]: Finished difference. Result has 78 places, 149 transitions, 2116 flow [2022-12-06 04:18:50,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2116, PETRI_PLACES=78, PETRI_TRANSITIONS=149} [2022-12-06 04:18:50,885 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-12-06 04:18:50,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:50,885 INFO L89 Accepts]: Start accepts. Operand has 78 places, 149 transitions, 2116 flow [2022-12-06 04:18:50,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:50,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:50,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 149 transitions, 2116 flow [2022-12-06 04:18:50,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 149 transitions, 2116 flow [2022-12-06 04:18:51,102 INFO L130 PetriNetUnfolder]: 1458/2636 cut-off events. [2022-12-06 04:18:51,102 INFO L131 PetriNetUnfolder]: For 15748/16663 co-relation queries the response was YES. [2022-12-06 04:18:51,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 2636 events. 1458/2636 cut-off events. For 15748/16663 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 17568 event pairs, 121 based on Foata normal form. 168/2783 useless extension candidates. Maximal degree in co-relation 16517. Up to 1494 conditions per place. [2022-12-06 04:18:51,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 149 transitions, 2116 flow [2022-12-06 04:18:51,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 04:18:59,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:59,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8251 [2022-12-06 04:18:59,136 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 152 transitions, 2443 flow [2022-12-06 04:18:59,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:18:59,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:59,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:18:59,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -4851943, now seen corresponding path program 3 times [2022-12-06 04:18:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033111204] [2022-12-06 04:18:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:59,474 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:18:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033111204] [2022-12-06 04:18:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033111204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:59,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:18:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913865001] [2022-12-06 04:18:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:59,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:18:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:18:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:18:59,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2022-12-06 04:18:59,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 152 transitions, 2443 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:59,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:59,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2022-12-06 04:18:59,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:01,568 INFO L130 PetriNetUnfolder]: 11562/17541 cut-off events. [2022-12-06 04:19:01,568 INFO L131 PetriNetUnfolder]: For 134736/136960 co-relation queries the response was YES. [2022-12-06 04:19:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98789 conditions, 17541 events. 11562/17541 cut-off events. For 134736/136960 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 118236 event pairs, 2006 based on Foata normal form. 788/18027 useless extension candidates. Maximal degree in co-relation 98750. Up to 12220 conditions per place. [2022-12-06 04:19:01,735 INFO L137 encePairwiseOnDemand]: 43/49 looper letters, 100 selfloop transitions, 47 changer transitions 4/177 dead transitions. [2022-12-06 04:19:01,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 177 transitions, 2592 flow [2022-12-06 04:19:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 04:19:01,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-06 04:19:01,737 INFO L175 Difference]: Start difference. First operand has 79 places, 152 transitions, 2443 flow. Second operand 5 states and 75 transitions. [2022-12-06 04:19:01,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 177 transitions, 2592 flow [2022-12-06 04:19:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 177 transitions, 2557 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 04:19:02,018 INFO L231 Difference]: Finished difference. Result has 83 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2122, PETRI_PLACES=83, PETRI_TRANSITIONS=142} [2022-12-06 04:19:02,019 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2022-12-06 04:19:02,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:02,019 INFO L89 Accepts]: Start accepts. Operand has 83 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:02,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:02,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,234 INFO L130 PetriNetUnfolder]: 1293/2458 cut-off events. [2022-12-06 04:19:02,234 INFO L131 PetriNetUnfolder]: For 16382/16955 co-relation queries the response was YES. [2022-12-06 04:19:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 2458 events. 1293/2458 cut-off events. For 16382/16955 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 17247 event pairs, 126 based on Foata normal form. 140/2580 useless extension candidates. Maximal degree in co-relation 15746. Up to 1338 conditions per place. [2022-12-06 04:19:02,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-06 04:19:02,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:02,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 04:19:02,282 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 142 transitions, 2122 flow [2022-12-06 04:19:02,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:02,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:02,282 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:02,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:19:02,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:02,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1664525719, now seen corresponding path program 1 times [2022-12-06 04:19:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:02,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830891287] [2022-12-06 04:19:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:02,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830891287] [2022-12-06 04:19:02,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830891287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:02,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:02,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449153723] [2022-12-06 04:19:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:02,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:19:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:19:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:19:02,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:19:02,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 142 transitions, 2122 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:02,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:02,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:19:02,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:03,955 INFO L130 PetriNetUnfolder]: 9433/14204 cut-off events. [2022-12-06 04:19:03,955 INFO L131 PetriNetUnfolder]: For 116395/118039 co-relation queries the response was YES. [2022-12-06 04:19:04,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81931 conditions, 14204 events. 9433/14204 cut-off events. For 116395/118039 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 90788 event pairs, 1409 based on Foata normal form. 1055/15115 useless extension candidates. Maximal degree in co-relation 81890. Up to 8165 conditions per place. [2022-12-06 04:19:04,068 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 81 selfloop transitions, 62 changer transitions 0/169 dead transitions. [2022-12-06 04:19:04,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 169 transitions, 2529 flow [2022-12-06 04:19:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 04:19:04,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2022-12-06 04:19:04,069 INFO L175 Difference]: Start difference. First operand has 82 places, 142 transitions, 2122 flow. Second operand 6 states and 79 transitions. [2022-12-06 04:19:04,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 169 transitions, 2529 flow [2022-12-06 04:19:04,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 169 transitions, 2517 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 04:19:04,206 INFO L231 Difference]: Finished difference. Result has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2136, PETRI_PLACES=87, PETRI_TRANSITIONS=138} [2022-12-06 04:19:04,207 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2022-12-06 04:19:04,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:04,207 INFO L89 Accepts]: Start accepts. Operand has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:04,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:04,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,398 INFO L130 PetriNetUnfolder]: 1216/2326 cut-off events. [2022-12-06 04:19:04,398 INFO L131 PetriNetUnfolder]: For 17225/17790 co-relation queries the response was YES. [2022-12-06 04:19:04,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15440 conditions, 2326 events. 1216/2326 cut-off events. For 17225/17790 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16124 event pairs, 117 based on Foata normal form. 134/2442 useless extension candidates. Maximal degree in co-relation 15400. Up to 1252 conditions per place. [2022-12-06 04:19:04,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 1120 [2022-12-06 04:19:04,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:04,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 04:19:04,439 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 138 transitions, 2136 flow [2022-12-06 04:19:04,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:04,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:04,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:19:04,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2140287625, now seen corresponding path program 1 times [2022-12-06 04:19:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:04,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914728238] [2022-12-06 04:19:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:04,689 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:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914728238] [2022-12-06 04:19:04,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914728238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:04,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:04,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343982575] [2022-12-06 04:19:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:04,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:04,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:19:04,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 138 transitions, 2136 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:04,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:19:04,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:06,794 INFO L130 PetriNetUnfolder]: 15163/21812 cut-off events. [2022-12-06 04:19:06,794 INFO L131 PetriNetUnfolder]: For 160059/160059 co-relation queries the response was YES. [2022-12-06 04:19:06,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120996 conditions, 21812 events. 15163/21812 cut-off events. For 160059/160059 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 131899 event pairs, 3278 based on Foata normal form. 192/22004 useless extension candidates. Maximal degree in co-relation 120953. Up to 10519 conditions per place. [2022-12-06 04:19:06,964 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 151 selfloop transitions, 34 changer transitions 34/219 dead transitions. [2022-12-06 04:19:06,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 219 transitions, 3562 flow [2022-12-06 04:19:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:19:06,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:19:06,966 INFO L175 Difference]: Start difference. First operand has 87 places, 138 transitions, 2136 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:19:06,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 219 transitions, 3562 flow [2022-12-06 04:19:07,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 219 transitions, 3355 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-06 04:19:07,303 INFO L231 Difference]: Finished difference. Result has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1972, PETRI_PLACES=87, PETRI_TRANSITIONS=128} [2022-12-06 04:19:07,303 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2022-12-06 04:19:07,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:07,303 INFO L89 Accepts]: Start accepts. Operand has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:07,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:07,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,499 INFO L130 PetriNetUnfolder]: 1103/2282 cut-off events. [2022-12-06 04:19:07,499 INFO L131 PetriNetUnfolder]: For 17049/17574 co-relation queries the response was YES. [2022-12-06 04:19:07,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15107 conditions, 2282 events. 1103/2282 cut-off events. For 17049/17574 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16883 event pairs, 154 based on Foata normal form. 133/2399 useless extension candidates. Maximal degree in co-relation 15065. Up to 1304 conditions per place. [2022-12-06 04:19:07,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-06 04:19:07,537 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:07,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 04:19:07,538 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 128 transitions, 1972 flow [2022-12-06 04:19:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:07,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:07,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:07,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:19:07,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1866754806, now seen corresponding path program 1 times [2022-12-06 04:19:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:07,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873662874] [2022-12-06 04:19:07,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:07,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:07,895 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,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873662874] [2022-12-06 04:19:07,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873662874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:07,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:07,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642084979] [2022-12-06 04:19:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:07,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:07,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:19:07,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 128 transitions, 1972 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:07,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:07,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:19:07,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:09,743 INFO L130 PetriNetUnfolder]: 10881/16602 cut-off events. [2022-12-06 04:19:09,744 INFO L131 PetriNetUnfolder]: For 135466/137300 co-relation queries the response was YES. [2022-12-06 04:19:09,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93551 conditions, 16602 events. 10881/16602 cut-off events. For 135466/137300 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 111455 event pairs, 1787 based on Foata normal form. 587/16699 useless extension candidates. Maximal degree in co-relation 93506. Up to 9674 conditions per place. [2022-12-06 04:19:09,849 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 87 selfloop transitions, 59 changer transitions 1/171 dead transitions. [2022-12-06 04:19:09,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 2730 flow [2022-12-06 04:19:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:19:09,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5615384615384615 [2022-12-06 04:19:09,851 INFO L175 Difference]: Start difference. First operand has 87 places, 128 transitions, 1972 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:19:09,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 2730 flow [2022-12-06 04:19:09,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 171 transitions, 2724 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 04:19:09,989 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:09,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2287, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2022-12-06 04:19:09,990 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2022-12-06 04:19:09,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:09,990 INFO L89 Accepts]: Start accepts. Operand has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:09,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:09,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:09,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:09,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:10,213 INFO L130 PetriNetUnfolder]: 1173/2467 cut-off events. [2022-12-06 04:19:10,214 INFO L131 PetriNetUnfolder]: For 21193/21721 co-relation queries the response was YES. [2022-12-06 04:19:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17361 conditions, 2467 events. 1173/2467 cut-off events. For 21193/21721 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 18881 event pairs, 172 based on Foata normal form. 128/2579 useless extension candidates. Maximal degree in co-relation 17316. Up to 1398 conditions per place. [2022-12-06 04:19:10,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:10,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-06 04:19:10,268 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:10,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 04:19:10,269 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 2287 flow [2022-12-06 04:19:10,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:10,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:10,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:10,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:19:10,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1831186956, now seen corresponding path program 2 times [2022-12-06 04:19:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:10,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840049210] [2022-12-06 04:19:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:10,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:11,005 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,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:11,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840049210] [2022-12-06 04:19:11,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840049210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:11,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:11,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408555992] [2022-12-06 04:19:11,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:11,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:11,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:19:11,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 2287 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:11,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:11,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:19:11,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:13,089 INFO L130 PetriNetUnfolder]: 11969/18280 cut-off events. [2022-12-06 04:19:13,090 INFO L131 PetriNetUnfolder]: For 173281/175133 co-relation queries the response was YES. [2022-12-06 04:19:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108074 conditions, 18280 events. 11969/18280 cut-off events. For 173281/175133 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 125942 event pairs, 2825 based on Foata normal form. 590/18314 useless extension candidates. Maximal degree in co-relation 108026. Up to 12554 conditions per place. [2022-12-06 04:19:13,208 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 118 selfloop transitions, 28 changer transitions 1/171 dead transitions. [2022-12-06 04:19:13,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 2935 flow [2022-12-06 04:19:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 04:19:13,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2022-12-06 04:19:13,209 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 2287 flow. Second operand 5 states and 72 transitions. [2022-12-06 04:19:13,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 171 transitions, 2935 flow [2022-12-06 04:19:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 2847 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 04:19:13,398 INFO L231 Difference]: Finished difference. Result has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2338, PETRI_PLACES=94, PETRI_TRANSITIONS=138} [2022-12-06 04:19:13,399 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2022-12-06 04:19:13,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:13,399 INFO L89 Accepts]: Start accepts. Operand has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:13,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:13,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,714 INFO L130 PetriNetUnfolder]: 1250/2687 cut-off events. [2022-12-06 04:19:13,715 INFO L131 PetriNetUnfolder]: For 22794/23321 co-relation queries the response was YES. [2022-12-06 04:19:13,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18150 conditions, 2687 events. 1250/2687 cut-off events. For 22794/23321 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 21454 event pairs, 210 based on Foata normal form. 128/2799 useless extension candidates. Maximal degree in co-relation 18104. Up to 1501 conditions per place. [2022-12-06 04:19:13,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 04:19:13,774 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:13,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-06 04:19:13,776 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 138 transitions, 2338 flow [2022-12-06 04:19:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:13,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:13,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:13,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:19:13,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1840356756, now seen corresponding path program 3 times [2022-12-06 04:19:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:13,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483502047] [2022-12-06 04:19:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:14,256 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:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483502047] [2022-12-06 04:19:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483502047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:14,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975269185] [2022-12-06 04:19:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:14,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:19:14,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 138 transitions, 2338 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:14,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:14,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:19:14,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:16,258 INFO L130 PetriNetUnfolder]: 11695/17860 cut-off events. [2022-12-06 04:19:16,258 INFO L131 PetriNetUnfolder]: For 168195/169891 co-relation queries the response was YES. [2022-12-06 04:19:16,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103925 conditions, 17860 events. 11695/17860 cut-off events. For 168195/169891 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 122414 event pairs, 2109 based on Foata normal form. 532/17778 useless extension candidates. Maximal degree in co-relation 103876. Up to 7379 conditions per place. [2022-12-06 04:19:16,494 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 101 selfloop transitions, 46 changer transitions 1/172 dead transitions. [2022-12-06 04:19:16,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 2923 flow [2022-12-06 04:19:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:19:16,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5615384615384615 [2022-12-06 04:19:16,496 INFO L175 Difference]: Start difference. First operand has 94 places, 138 transitions, 2338 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:19:16,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 2923 flow [2022-12-06 04:19:16,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 172 transitions, 2876 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:19:16,675 INFO L231 Difference]: Finished difference. Result has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2400, PETRI_PLACES=96, PETRI_TRANSITIONS=137} [2022-12-06 04:19:16,676 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2022-12-06 04:19:16,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:16,676 INFO L89 Accepts]: Start accepts. Operand has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:16,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:16,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,909 INFO L130 PetriNetUnfolder]: 1226/2630 cut-off events. [2022-12-06 04:19:16,909 INFO L131 PetriNetUnfolder]: For 24102/24610 co-relation queries the response was YES. [2022-12-06 04:19:16,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18302 conditions, 2630 events. 1226/2630 cut-off events. For 24102/24610 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 20972 event pairs, 206 based on Foata normal form. 128/2742 useless extension candidates. Maximal degree in co-relation 18255. Up to 1468 conditions per place. [2022-12-06 04:19:16,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 1076 [2022-12-06 04:19:16,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:16,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 294 [2022-12-06 04:19:16,971 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 137 transitions, 2400 flow [2022-12-06 04:19:16,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:16,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:16,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:16,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:19:16,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 201191954, now seen corresponding path program 1 times [2022-12-06 04:19:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:16,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391655370] [2022-12-06 04:19:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:17,063 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:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391655370] [2022-12-06 04:19:17,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391655370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:17,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:17,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:17,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375258966] [2022-12-06 04:19:17,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:17,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:17,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:17,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-06 04:19:17,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 137 transitions, 2400 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:17,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:17,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-06 04:19:17,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:18,767 INFO L130 PetriNetUnfolder]: 10312/15789 cut-off events. [2022-12-06 04:19:18,767 INFO L131 PetriNetUnfolder]: For 230645/235014 co-relation queries the response was YES. [2022-12-06 04:19:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98377 conditions, 15789 events. 10312/15789 cut-off events. For 230645/235014 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 112369 event pairs, 1855 based on Foata normal form. 2740/17650 useless extension candidates. Maximal degree in co-relation 98327. Up to 9557 conditions per place. [2022-12-06 04:19:18,878 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 217 selfloop transitions, 9 changer transitions 90/346 dead transitions. [2022-12-06 04:19:18,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 346 transitions, 6900 flow [2022-12-06 04:19:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 04:19:18,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 04:19:18,888 INFO L175 Difference]: Start difference. First operand has 96 places, 137 transitions, 2400 flow. Second operand 5 states and 85 transitions. [2022-12-06 04:19:18,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 346 transitions, 6900 flow [2022-12-06 04:19:19,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 346 transitions, 6640 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:19,062 INFO L231 Difference]: Finished difference. Result has 99 places, 133 transitions, 2119 flow [2022-12-06 04:19:19,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2119, PETRI_PLACES=99, PETRI_TRANSITIONS=133} [2022-12-06 04:19:19,062 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2022-12-06 04:19:19,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:19,063 INFO L89 Accepts]: Start accepts. Operand has 99 places, 133 transitions, 2119 flow [2022-12-06 04:19:19,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:19,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:19,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 133 transitions, 2119 flow [2022-12-06 04:19:19,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 133 transitions, 2119 flow [2022-12-06 04:19:19,701 INFO L130 PetriNetUnfolder]: 3500/6691 cut-off events. [2022-12-06 04:19:19,701 INFO L131 PetriNetUnfolder]: For 47371/50715 co-relation queries the response was YES. [2022-12-06 04:19:19,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34426 conditions, 6691 events. 3500/6691 cut-off events. For 47371/50715 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 59811 event pairs, 1251 based on Foata normal form. 257/6286 useless extension candidates. Maximal degree in co-relation 34376. Up to 3730 conditions per place. [2022-12-06 04:19:19,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 133 transitions, 2119 flow [2022-12-06 04:19:19,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 1854 [2022-12-06 04:19:19,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [458] L754-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:19:19,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [418] L791-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 04:19:19,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [461] L769-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:19:19,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:19,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 826 [2022-12-06 04:19:19,889 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 2125 flow [2022-12-06 04:19:19,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:19,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:19,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:19,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:19:19,890 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1337121646, now seen corresponding path program 1 times [2022-12-06 04:19:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:19,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467782542] [2022-12-06 04:19:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:20,005 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:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:20,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467782542] [2022-12-06 04:19:20,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467782542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:20,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:20,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:19:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535765796] [2022-12-06 04:19:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:20,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:19:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:19:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:19:20,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:19:20,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 2125 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:20,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:20,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:19:20,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:21,659 INFO L130 PetriNetUnfolder]: 7483/11918 cut-off events. [2022-12-06 04:19:21,660 INFO L131 PetriNetUnfolder]: For 180736/187363 co-relation queries the response was YES. [2022-12-06 04:19:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80320 conditions, 11918 events. 7483/11918 cut-off events. For 180736/187363 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 86852 event pairs, 478 based on Foata normal form. 2542/13846 useless extension candidates. Maximal degree in co-relation 80267. Up to 5293 conditions per place. [2022-12-06 04:19:21,738 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 295 selfloop transitions, 17 changer transitions 37/379 dead transitions. [2022-12-06 04:19:21,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 379 transitions, 7228 flow [2022-12-06 04:19:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 04:19:21,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2022-12-06 04:19:21,739 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 2125 flow. Second operand 6 states and 107 transitions. [2022-12-06 04:19:21,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 379 transitions, 7228 flow [2022-12-06 04:19:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 379 transitions, 7187 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:21,830 INFO L231 Difference]: Finished difference. Result has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:21,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=104, PETRI_TRANSITIONS=137} [2022-12-06 04:19:21,831 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2022-12-06 04:19:21,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:21,831 INFO L89 Accepts]: Start accepts. Operand has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:21,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:21,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:21,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:21,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:22,279 INFO L130 PetriNetUnfolder]: 2239/4910 cut-off events. [2022-12-06 04:19:22,279 INFO L131 PetriNetUnfolder]: For 44343/54129 co-relation queries the response was YES. [2022-12-06 04:19:22,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28424 conditions, 4910 events. 2239/4910 cut-off events. For 44343/54129 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 46957 event pairs, 308 based on Foata normal form. 307/4796 useless extension candidates. Maximal degree in co-relation 28371. Up to 3444 conditions per place. [2022-12-06 04:19:22,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:22,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 2232 [2022-12-06 04:19:22,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:22,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 544 [2022-12-06 04:19:22,375 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 137 transitions, 2156 flow [2022-12-06 04:19:22,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:22,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:22,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:22,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:19:22,376 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -281379477, now seen corresponding path program 1 times [2022-12-06 04:19:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:22,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636618479] [2022-12-06 04:19:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:22,488 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:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636618479] [2022-12-06 04:19:22,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636618479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:22,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:22,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505355427] [2022-12-06 04:19:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:22,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:19:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:19:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:19:22,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:19:22,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 137 transitions, 2156 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:22,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:22,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:19:22,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:23,866 INFO L130 PetriNetUnfolder]: 6835/10940 cut-off events. [2022-12-06 04:19:23,866 INFO L131 PetriNetUnfolder]: For 163811/171399 co-relation queries the response was YES. [2022-12-06 04:19:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80292 conditions, 10940 events. 6835/10940 cut-off events. For 163811/171399 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 80114 event pairs, 227 based on Foata normal form. 2532/12896 useless extension candidates. Maximal degree in co-relation 80236. Up to 5055 conditions per place. [2022-12-06 04:19:23,946 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 232 selfloop transitions, 25 changer transitions 127/409 dead transitions. [2022-12-06 04:19:23,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 409 transitions, 7795 flow [2022-12-06 04:19:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:19:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:19:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-06 04:19:23,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2022-12-06 04:19:23,948 INFO L175 Difference]: Start difference. First operand has 104 places, 137 transitions, 2156 flow. Second operand 8 states and 140 transitions. [2022-12-06 04:19:23,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 409 transitions, 7795 flow [2022-12-06 04:19:24,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 409 transitions, 7571 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-12-06 04:19:24,939 INFO L231 Difference]: Finished difference. Result has 105 places, 123 transitions, 1812 flow [2022-12-06 04:19:24,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1812, PETRI_PLACES=105, PETRI_TRANSITIONS=123} [2022-12-06 04:19:24,940 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2022-12-06 04:19:24,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:24,940 INFO L89 Accepts]: Start accepts. Operand has 105 places, 123 transitions, 1812 flow [2022-12-06 04:19:24,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:24,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:24,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 123 transitions, 1812 flow [2022-12-06 04:19:24,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 123 transitions, 1812 flow [2022-12-06 04:19:25,306 INFO L130 PetriNetUnfolder]: 1451/3721 cut-off events. [2022-12-06 04:19:25,307 INFO L131 PetriNetUnfolder]: For 30248/34115 co-relation queries the response was YES. [2022-12-06 04:19:25,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20609 conditions, 3721 events. 1451/3721 cut-off events. For 30248/34115 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 38049 event pairs, 62 based on Foata normal form. 179/3599 useless extension candidates. Maximal degree in co-relation 20557. Up to 1744 conditions per place. [2022-12-06 04:19:25,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 123 transitions, 1812 flow [2022-12-06 04:19:25,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-06 04:19:25,764 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:19:25,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 825 [2022-12-06 04:19:25,765 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 118 transitions, 1761 flow [2022-12-06 04:19:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:25,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:25,765 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:25,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:19:25,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1216420161, now seen corresponding path program 1 times [2022-12-06 04:19:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235993511] [2022-12-06 04:19:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:25,853 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:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:25,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235993511] [2022-12-06 04:19:25,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235993511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:25,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:25,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845754723] [2022-12-06 04:19:25,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:25,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:25,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:19:25,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 118 transitions, 1761 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:25,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:25,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:19:25,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:26,821 INFO L130 PetriNetUnfolder]: 4532/8105 cut-off events. [2022-12-06 04:19:26,821 INFO L131 PetriNetUnfolder]: For 98391/98800 co-relation queries the response was YES. [2022-12-06 04:19:26,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57997 conditions, 8105 events. 4532/8105 cut-off events. For 98391/98800 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 62506 event pairs, 499 based on Foata normal form. 282/8325 useless extension candidates. Maximal degree in co-relation 57942. Up to 3760 conditions per place. [2022-12-06 04:19:26,861 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 117 selfloop transitions, 1 changer transitions 88/225 dead transitions. [2022-12-06 04:19:26,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 225 transitions, 3702 flow [2022-12-06 04:19:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:19:26,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 04:19:26,863 INFO L175 Difference]: Start difference. First operand has 105 places, 118 transitions, 1761 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:19:26,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 225 transitions, 3702 flow [2022-12-06 04:19:27,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 225 transitions, 3392 flow, removed 82 selfloop flow, removed 9 redundant places. [2022-12-06 04:19:27,199 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 1262 flow [2022-12-06 04:19:27,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1262, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2022-12-06 04:19:27,200 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2022-12-06 04:19:27,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:27,200 INFO L89 Accepts]: Start accepts. Operand has 101 places, 94 transitions, 1262 flow [2022-12-06 04:19:27,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:27,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:27,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 94 transitions, 1262 flow [2022-12-06 04:19:27,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 1262 flow [2022-12-06 04:19:27,304 INFO L130 PetriNetUnfolder]: 579/1472 cut-off events. [2022-12-06 04:19:27,304 INFO L131 PetriNetUnfolder]: For 7530/7694 co-relation queries the response was YES. [2022-12-06 04:19:27,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7262 conditions, 1472 events. 579/1472 cut-off events. For 7530/7694 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 11644 event pairs, 42 based on Foata normal form. 42/1448 useless extension candidates. Maximal degree in co-relation 7214. Up to 514 conditions per place. [2022-12-06 04:19:27,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 94 transitions, 1262 flow [2022-12-06 04:19:27,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 856 [2022-12-06 04:19:27,418 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:27,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 04:19:27,422 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 1278 flow [2022-12-06 04:19:27,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:27,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:27,425 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:27,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:19:27,425 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1215316952, now seen corresponding path program 1 times [2022-12-06 04:19:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:27,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56255610] [2022-12-06 04:19:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:27,598 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:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56255610] [2022-12-06 04:19:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56255610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:27,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:27,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:19:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862296361] [2022-12-06 04:19:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:27,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:19:27,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 1278 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:27,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:27,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:19:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:27,932 INFO L130 PetriNetUnfolder]: 1392/2610 cut-off events. [2022-12-06 04:19:27,932 INFO L131 PetriNetUnfolder]: For 29821/29996 co-relation queries the response was YES. [2022-12-06 04:19:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16675 conditions, 2610 events. 1392/2610 cut-off events. For 29821/29996 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 17519 event pairs, 63 based on Foata normal form. 156/2733 useless extension candidates. Maximal degree in co-relation 16627. Up to 921 conditions per place. [2022-12-06 04:19:27,944 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 53 selfloop transitions, 17 changer transitions 144/219 dead transitions. [2022-12-06 04:19:27,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 219 transitions, 3680 flow [2022-12-06 04:19:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:19:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:19:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 04:19:27,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-12-06 04:19:27,945 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 1278 flow. Second operand 8 states and 121 transitions. [2022-12-06 04:19:27,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 219 transitions, 3680 flow [2022-12-06 04:19:28,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 219 transitions, 3510 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-12-06 04:19:28,002 INFO L231 Difference]: Finished difference. Result has 98 places, 46 transitions, 485 flow [2022-12-06 04:19:28,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=485, PETRI_PLACES=98, PETRI_TRANSITIONS=46} [2022-12-06 04:19:28,002 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2022-12-06 04:19:28,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:28,002 INFO L89 Accepts]: Start accepts. Operand has 98 places, 46 transitions, 485 flow [2022-12-06 04:19:28,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:28,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:28,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 46 transitions, 485 flow [2022-12-06 04:19:28,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 46 transitions, 485 flow [2022-12-06 04:19:28,013 INFO L130 PetriNetUnfolder]: 42/117 cut-off events. [2022-12-06 04:19:28,013 INFO L131 PetriNetUnfolder]: For 400/417 co-relation queries the response was YES. [2022-12-06 04:19:28,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 117 events. 42/117 cut-off events. For 400/417 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 383 event pairs, 1 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 571. Up to 40 conditions per place. [2022-12-06 04:19:28,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 46 transitions, 485 flow [2022-12-06 04:19:28,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:19:28,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L781-->L784: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [381] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_14 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_21 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3))) (and (= v_~z~0_61 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse1 v_~z$w_buff1~0_33 v_~z~0_62))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_20 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_14) v_~z$r_buff1_thd4~0_13) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$r_buff0_thd4~0_20 (ite .cse4 0 v_~z$r_buff0_thd4~0_21)) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_62} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_61} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-06 04:19:28,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~b~0_36 1) (= v_~x~0_165 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~b~0=v_~b~0_36, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_165, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [491] $Ultimate##0-->L766: Formula: (and (= v_~x~0_57 2) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 04:19:29,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L781-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_602 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_100 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_149 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_603 256) 0)))) (.cse0 (and (not (= 0 (mod v_~z$w_buff1_used~0_558 256))) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_558) v_~z$w_buff1_used~0_557) (= (ite .cse2 0 v_~z$w_buff0_used~0_603) v_~z$w_buff0_used~0_602) (= v_~z~0_528 (ite .cse2 v_~z$w_buff0~0_416 (ite .cse0 v_~z$w_buff1~0_371 1))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_148 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_557 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_100) v_~z$r_buff1_thd4~0_99) (= v_~z$r_buff0_thd4~0_148 (ite .cse1 0 v_~z$r_buff0_thd4~0_149))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_100, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_603, ~z$w_buff0~0=v_~z$w_buff0~0_416, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_149, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_558, ~z$w_buff1~0=v_~z$w_buff1~0_371} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_99, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_602, ~z$w_buff0~0=v_~z$w_buff0~0_416, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_148, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$w_buff1~0=v_~z$w_buff1~0_371, ~z~0=v_~z~0_528} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-06 04:19:29,569 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 04:19:29,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1567 [2022-12-06 04:19:29,569 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 39 transitions, 471 flow [2022-12-06 04:19:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:29,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:29,570 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:29,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:19:29,570 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -755970173, now seen corresponding path program 1 times [2022-12-06 04:19:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:29,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884509477] [2022-12-06 04:19:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:29,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:19:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:29,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:19:29,759 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:19:29,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:19:29,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:19:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:19:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:19:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:19:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:19:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:19:29,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:19:29,762 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:29,766 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:19:29,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:19:29,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:19:29 BasicIcfg [2022-12-06 04:19:29,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:19:29,846 INFO L158 Benchmark]: Toolchain (without parser) took 60043.95ms. Allocated memory was 199.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 173.1MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 04:19:29,847 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:19:29,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.93ms. Allocated memory is still 199.2MB. Free memory was 173.1MB in the beginning and 145.6MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:19:29,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.96ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 176.3MB in the end (delta: -30.7MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-12-06 04:19:29,847 INFO L158 Benchmark]: Boogie Preprocessor took 43.86ms. Allocated memory is still 199.2MB. Free memory was 176.3MB in the beginning and 174.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:29,847 INFO L158 Benchmark]: RCFGBuilder took 595.32ms. Allocated memory is still 199.2MB. Free memory was 174.2MB in the beginning and 141.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 04:19:29,848 INFO L158 Benchmark]: TraceAbstraction took 58865.09ms. Allocated memory was 199.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 141.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 04:19:29,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.93ms. Allocated memory is still 199.2MB. Free memory was 173.1MB in the beginning and 145.6MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.96ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 176.3MB in the end (delta: -30.7MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.86ms. Allocated memory is still 199.2MB. Free memory was 176.3MB in the beginning and 174.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.32ms. Allocated memory is still 199.2MB. Free memory was 174.2MB in the beginning and 141.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 58865.09ms. Allocated memory was 199.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 141.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 2202, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1857, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1857, independent: 1782, independent conditional: 0, independent unconditional: 1782, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2265, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1857, unknown conditional: 0, unknown unconditional: 1857] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2684, Positive conditional cache size: 0, Positive unconditional cache size: 2684, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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.2s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 372, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 180, independent conditional: 11, independent unconditional: 169, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 425, independent: 192, independent conditional: 12, independent unconditional: 180, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 201, unknown conditional: 13, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 180, Positive conditional cache size: 11, Positive unconditional cache size: 169, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, 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, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 15, independent unconditional: 75, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 90, independent conditional: 6, independent unconditional: 84, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 6, independent unconditional: 84, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 82, independent conditional: 6, independent unconditional: 76, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 188, Positive conditional cache size: 11, Positive unconditional cache size: 177, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 337, independent: 314, independent conditional: 85, independent unconditional: 229, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338, independent: 314, independent conditional: 23, independent unconditional: 291, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338, independent: 314, independent conditional: 23, independent unconditional: 291, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 338, independent: 310, independent conditional: 21, independent unconditional: 289, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 13, Positive unconditional cache size: 179, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 352, independent conditional: 352, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 352, independent conditional: 113, independent unconditional: 239, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 378, independent: 352, independent conditional: 24, independent unconditional: 328, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 352, independent conditional: 24, independent unconditional: 328, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 378, independent: 350, independent conditional: 23, independent unconditional: 327, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 194, Positive conditional cache size: 14, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 534, independent: 495, independent conditional: 495, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 534, independent: 495, independent conditional: 186, independent unconditional: 309, dependent: 39, dependent conditional: 1, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, 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: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 194, Positive conditional cache size: 14, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 856, independent conditional: 856, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 906, independent: 856, independent conditional: 492, independent unconditional: 364, dependent: 50, dependent conditional: 11, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 125, independent unconditional: 731, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 125, independent unconditional: 731, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 907, independent: 850, independent conditional: 122, independent unconditional: 728, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 200, Positive conditional cache size: 17, Positive unconditional cache size: 183, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 377, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 767, independent: 710, independent conditional: 710, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 767, independent: 710, independent conditional: 349, independent unconditional: 361, dependent: 57, dependent conditional: 1, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 768, independent: 710, independent conditional: 95, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 768, independent: 710, independent conditional: 95, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 768, independent: 708, independent conditional: 93, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 202, Positive conditional cache size: 19, Positive unconditional cache size: 183, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 254, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 1020, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 647, independent unconditional: 373, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 225, independent unconditional: 795, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 225, independent unconditional: 795, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1085, independent: 1018, independent conditional: 224, independent unconditional: 794, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 204, Positive conditional cache size: 20, Positive unconditional cache size: 184, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 422, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 78 PlacesBefore, 79 PlacesAfterwards, 149 TransitionsBefore, 152 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 2910, independent unconditional: 0, dependent: 167, dependent conditional: 167, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 1859, independent unconditional: 1051, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 773, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 773, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3077, independent: 2909, independent conditional: 772, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 297, Positive conditional cache size: 21, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1086, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 1327, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 757, independent unconditional: 570, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 204, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 204, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1399, independent: 1324, independent conditional: 201, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 553, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 1258, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 672, independent unconditional: 586, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 517, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 829, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 385, independent unconditional: 444, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, 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: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 296, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1136, independent: 1070, independent conditional: 1070, 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: 1136, independent: 1070, independent conditional: 556, independent unconditional: 514, 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: 1136, independent: 1070, independent conditional: 81, independent unconditional: 989, 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: 1136, independent: 1070, independent conditional: 81, independent unconditional: 989, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1136, independent: 1069, independent conditional: 81, independent unconditional: 988, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 475, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 1095, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 617, independent unconditional: 478, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, 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: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 527, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 1076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 1052, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 580, independent unconditional: 472, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, 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: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 491, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 99 PlacesBefore, 98 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 1854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 719, independent conditional: 719, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 733, independent: 719, independent conditional: 565, independent unconditional: 154, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 733, independent: 719, independent conditional: 340, independent unconditional: 379, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 733, independent: 719, independent conditional: 340, independent unconditional: 379, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 733, independent: 711, independent conditional: 335, independent unconditional: 376, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 327, Positive conditional cache size: 29, Positive unconditional cache size: 298, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 225, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 2232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 133, independent unconditional: 63, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 327, Positive conditional cache size: 29, Positive unconditional cache size: 298, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 105 PlacesBefore, 105 PlacesAfterwards, 123 TransitionsBefore, 118 TransitionsAfterwards, 2116 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 797, independent conditional: 797, 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: 818, independent: 797, independent conditional: 650, independent unconditional: 147, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 818, independent: 797, independent conditional: 415, independent unconditional: 382, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 818, independent: 797, independent conditional: 415, independent unconditional: 382, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 20, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 818, independent: 776, independent conditional: 395, independent unconditional: 381, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 21, unknown conditional: 20, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 348, Positive conditional cache size: 49, Positive unconditional cache size: 299, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 95 PlacesBefore, 94 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 385, independent: 385, independent conditional: 385, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 385, independent: 385, independent conditional: 308, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 385, independent: 385, independent conditional: 168, independent unconditional: 217, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385, independent: 385, independent conditional: 168, independent unconditional: 217, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 385, independent: 385, independent conditional: 168, independent unconditional: 217, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 684, Positive conditional cache size: 70, Positive unconditional cache size: 614, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 140, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 91 PlacesBefore, 83 PlacesAfterwards, 46 TransitionsBefore, 39 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 901, Positive conditional cache size: 75, Positive unconditional cache size: 826, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-2, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 [L753] 1 x = 1 [L765] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 845]: 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: 847]: 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: 851]: 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: 849]: 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, 165 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: 58.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1870 IncrementalHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 54 mSDtfsCounter, 1870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2443occurred in iteration=9, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:29,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...