/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:01:01,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:01:01,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:01:01,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:01:01,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:01:01,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:01:01,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:01:01,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:01:01,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:01:01,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:01:01,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:01:01,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:01:01,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:01:01,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:01:01,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:01:01,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:01:01,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:01:01,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:01:01,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:01:01,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:01:01,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:01:01,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:01:01,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:01:01,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:01:01,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:01:01,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:01:01,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:01:01,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:01:01,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:01:01,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:01:01,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:01:01,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:01:01,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:01:01,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:01:01,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:01:01,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:01:01,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:01:01,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:01:01,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:01:01,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:01:01,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:01:01,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:01:01,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:01:01,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:01:01,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:01:01,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:01:01,174 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:01:01,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:01:01,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:01:01,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:01:01,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:01:01,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:01:01,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:01:01,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:01:01,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:01:01,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:01:01,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:01:01,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:01:01,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:01:01,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:01:01,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:01:01,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:01:01,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:01:01,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:01:01,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:01:01,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:01:01,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:01:01,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:01:01,467 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:01:01,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:01:02,601 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:01:02,816 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:01:02,817 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:01:02,841 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da292008e/caab777d437341248d5a04840a9bbd38/FLAGc5b062dd3 [2022-12-05 23:01:02,851 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da292008e/caab777d437341248d5a04840a9bbd38 [2022-12-05 23:01:02,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:01:02,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:01:02,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:01:02,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:01:02,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:01:02,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:01:02" (1/1) ... [2022-12-05 23:01:02,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd60b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:02, skipping insertion in model container [2022-12-05 23:01:02,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:01:02" (1/1) ... [2022-12-05 23:01:02,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:01:02,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:01:02,994 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:01:03,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:01:03,195 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:01:03,204 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:01:03,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:01:03,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:01:03,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:01:03,297 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:01:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03 WrapperNode [2022-12-05 23:01:03,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:01:03,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:01:03,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:01:03,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:01:03,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,351 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-05 23:01:03,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:01:03,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:01:03,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:01:03,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:01:03,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:01:03,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:01:03,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:01:03,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:01:03,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (1/1) ... [2022-12-05 23:01:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:01:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:01:03,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:01:03,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:01:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:01:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:01:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:01:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:01:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:01:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:01:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:01:03,457 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:01:03,591 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:01:03,592 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:01:03,845 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:01:03,945 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:01:03,945 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:01:03,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:01:03 BoogieIcfgContainer [2022-12-05 23:01:03,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:01:03,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:01:03,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:01:03,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:01:03,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:01:02" (1/3) ... [2022-12-05 23:01:03,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78734caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:01:03, skipping insertion in model container [2022-12-05 23:01:03,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:01:03" (2/3) ... [2022-12-05 23:01:03,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78734caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:01:03, skipping insertion in model container [2022-12-05 23:01:03,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:01:03" (3/3) ... [2022-12-05 23:01:03,952 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:01:03,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:01:03,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:01:03,964 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:01:03,997 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:01:04,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-05 23:01:04,049 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-05 23:01:04,049 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:01:04,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:01:04,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-05 23:01:04,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-05 23:01:04,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:04,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-05 23:01:04,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-05 23:01:04,087 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-05 23:01:04,087 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:01:04,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:01:04,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-05 23:01:04,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-05 23:01:08,075 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-05 23:01:08,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:01:08,111 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;@eff385c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:01:08,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:01:08,115 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:01:08,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:01:08,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:08,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:01:08,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 556268, now seen corresponding path program 1 times [2022-12-05 23:01:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623505266] [2022-12-05 23:01:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:08,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623505266] [2022-12-05 23:01:08,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623505266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:08,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:08,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:01:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070905809] [2022-12-05 23:01:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:01:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:01:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:01:08,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 23:01:08,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-05 23:01:08,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:08,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 23:01:08,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:09,364 INFO L130 PetriNetUnfolder]: 6050/8788 cut-off events. [2022-12-05 23:01:09,364 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-05 23:01:09,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17187 conditions, 8788 events. 6050/8788 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 52858 event pairs, 1106 based on Foata normal form. 0/8032 useless extension candidates. Maximal degree in co-relation 17175. Up to 6574 conditions per place. [2022-12-05 23:01:09,395 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-05 23:01:09,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-05 23:01:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:01:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:01:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-05 23:01:09,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 23:01:09,404 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-05 23:01:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-05 23:01:09,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:01:09,407 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-05 23:01:09,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-05 23:01:09,411 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-05 23:01:09,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:09,411 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-05 23:01:09,413 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:09,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:09,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-05 23:01:09,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-05 23:01:09,417 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-05 23:01:09,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:01:09,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:01:09,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-05 23:01:09,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-05 23:01:09,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:09,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-05 23:01:09,540 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-05 23:01:09,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-05 23:01:09,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:09,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:01:09,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -82390497, now seen corresponding path program 1 times [2022-12-05 23:01:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954374892] [2022-12-05 23:01:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954374892] [2022-12-05 23:01:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954374892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:09,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:09,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:01:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508369633] [2022-12-05 23:01:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:09,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:01:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:01:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:01:09,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:01:09,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:09,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:09,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:01:09,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:11,180 INFO L130 PetriNetUnfolder]: 14433/19638 cut-off events. [2022-12-05 23:01:11,180 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2022-12-05 23:01:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40412 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 101833 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40402. Up to 13647 conditions per place. [2022-12-05 23:01:11,278 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2022-12-05 23:01:11,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-05 23:01:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:01:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:01:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 23:01:11,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 23:01:11,280 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-05 23:01:11,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-05 23:01:11,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:01:11,282 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-05 23:01:11,283 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-05 23:01:11,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:11,283 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,283 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:11,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:11,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,315 INFO L130 PetriNetUnfolder]: 152/414 cut-off events. [2022-12-05 23:01:11,315 INFO L131 PetriNetUnfolder]: For 40/51 co-relation queries the response was YES. [2022-12-05 23:01:11,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 414 events. 152/414 cut-off events. For 40/51 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2516 event pairs, 78 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 773. Up to 221 conditions per place. [2022-12-05 23:01:11,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-05 23:01:11,401 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:11,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-05 23:01:11,402 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2022-12-05 23:01:11,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:11,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:11,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:11,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:01:11,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1740862474, now seen corresponding path program 1 times [2022-12-05 23:01:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615117845] [2022-12-05 23:01:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:11,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615117845] [2022-12-05 23:01:11,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615117845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:11,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:11,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:01:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142058600] [2022-12-05 23:01:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:11,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:01:11,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:11,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:11,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:01:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:12,721 INFO L130 PetriNetUnfolder]: 13351/18188 cut-off events. [2022-12-05 23:01:12,722 INFO L131 PetriNetUnfolder]: For 6666/6666 co-relation queries the response was YES. [2022-12-05 23:01:12,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 18188 events. 13351/18188 cut-off events. For 6666/6666 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 90116 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44445. Up to 9003 conditions per place. [2022-12-05 23:01:12,820 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-05 23:01:12,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2022-12-05 23:01:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:01:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:01:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 23:01:12,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-05 23:01:12,821 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 58 transitions. [2022-12-05 23:01:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2022-12-05 23:01:12,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:01:12,851 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-05 23:01:12,852 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-05 23:01:12,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:12,852 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,853 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:12,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:12,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,872 INFO L130 PetriNetUnfolder]: 122/335 cut-off events. [2022-12-05 23:01:12,872 INFO L131 PetriNetUnfolder]: For 144/178 co-relation queries the response was YES. [2022-12-05 23:01:12,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 335 events. 122/335 cut-off events. For 144/178 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1848 event pairs, 46 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 749. Up to 181 conditions per place. [2022-12-05 23:01:12,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-05 23:01:12,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:12,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-05 23:01:12,900 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2022-12-05 23:01:12,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:12,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:12,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:12,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:01:12,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1863575379, now seen corresponding path program 1 times [2022-12-05 23:01:12,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:12,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045803005] [2022-12-05 23:01:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:13,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045803005] [2022-12-05 23:01:13,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045803005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:13,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:13,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:01:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671963508] [2022-12-05 23:01:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:13,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:13,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:01:13,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:13,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:13,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:01:13,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:14,224 INFO L130 PetriNetUnfolder]: 13076/17813 cut-off events. [2022-12-05 23:01:14,224 INFO L131 PetriNetUnfolder]: For 11334/11334 co-relation queries the response was YES. [2022-12-05 23:01:14,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 17813 events. 13076/17813 cut-off events. For 11334/11334 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 91389 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46083. Up to 11817 conditions per place. [2022-12-05 23:01:14,352 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2022-12-05 23:01:14,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 444 flow [2022-12-05 23:01:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:01:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:01:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-05 23:01:14,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:01:14,353 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 70 transitions. [2022-12-05 23:01:14,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 444 flow [2022-12-05 23:01:14,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:01:14,366 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-05 23:01:14,367 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-05 23:01:14,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:14,367 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,367 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:14,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:14,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,391 INFO L130 PetriNetUnfolder]: 106/303 cut-off events. [2022-12-05 23:01:14,391 INFO L131 PetriNetUnfolder]: For 322/408 co-relation queries the response was YES. [2022-12-05 23:01:14,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 303 events. 106/303 cut-off events. For 322/408 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1644 event pairs, 44 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 830. Up to 161 conditions per place. [2022-12-05 23:01:14,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-05 23:01:14,397 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:14,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 23:01:14,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2022-12-05 23:01:14,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:14,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:14,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:14,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:01:14,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1936150646, now seen corresponding path program 1 times [2022-12-05 23:01:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:14,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141354367] [2022-12-05 23:01:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141354367] [2022-12-05 23:01:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141354367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:14,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:14,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:01:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200736228] [2022-12-05 23:01:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:01:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:01:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:01:14,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:01:14,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 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-05 23:01:14,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:14,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:01:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:15,128 INFO L130 PetriNetUnfolder]: 6254/9256 cut-off events. [2022-12-05 23:01:15,128 INFO L131 PetriNetUnfolder]: For 6930/7330 co-relation queries the response was YES. [2022-12-05 23:01:15,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23734 conditions, 9256 events. 6254/9256 cut-off events. For 6930/7330 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 53825 event pairs, 1497 based on Foata normal form. 414/9400 useless extension candidates. Maximal degree in co-relation 23716. Up to 7625 conditions per place. [2022-12-05 23:01:15,188 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 47 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-05 23:01:15,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 447 flow [2022-12-05 23:01:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:01:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:01:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-05 23:01:15,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 23:01:15,189 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 3 states and 56 transitions. [2022-12-05 23:01:15,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 447 flow [2022-12-05 23:01:15,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:01:15,199 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-05 23:01:15,200 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-05 23:01:15,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:15,200 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,200 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:15,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:15,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,253 INFO L130 PetriNetUnfolder]: 429/991 cut-off events. [2022-12-05 23:01:15,253 INFO L131 PetriNetUnfolder]: For 539/622 co-relation queries the response was YES. [2022-12-05 23:01:15,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 991 events. 429/991 cut-off events. For 539/622 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7108 event pairs, 206 based on Foata normal form. 4/909 useless extension candidates. Maximal degree in co-relation 2321. Up to 533 conditions per place. [2022-12-05 23:01:15,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-05 23:01:15,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:15,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-05 23:01:15,274 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 288 flow [2022-12-05 23:01:15,275 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-05 23:01:15,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:15,275 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-05 23:01:15,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:01:15,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:15,276 INFO L85 PathProgramCache]: Analyzing trace with hash -802900014, now seen corresponding path program 1 times [2022-12-05 23:01:15,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:15,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020314373] [2022-12-05 23:01:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020314373] [2022-12-05 23:01:15,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020314373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:15,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:15,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:01:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752603415] [2022-12-05 23:01:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:15,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:15,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:01:15,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:15,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:15,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:01:15,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:15,910 INFO L130 PetriNetUnfolder]: 3394/5309 cut-off events. [2022-12-05 23:01:15,910 INFO L131 PetriNetUnfolder]: For 4262/4472 co-relation queries the response was YES. [2022-12-05 23:01:15,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15860 conditions, 5309 events. 3394/5309 cut-off events. For 4262/4472 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 30645 event pairs, 826 based on Foata normal form. 460/5607 useless extension candidates. Maximal degree in co-relation 15839. Up to 2202 conditions per place. [2022-12-05 23:01:15,927 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 64 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2022-12-05 23:01:15,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 604 flow [2022-12-05 23:01:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:01:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:01:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-05 23:01:15,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-05 23:01:15,929 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 288 flow. Second operand 4 states and 77 transitions. [2022-12-05 23:01:15,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 604 flow [2022-12-05 23:01:15,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:01:15,933 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-05 23:01:15,934 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-05 23:01:15,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:15,934 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,935 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:15,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:15,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,970 INFO L130 PetriNetUnfolder]: 248/655 cut-off events. [2022-12-05 23:01:15,970 INFO L131 PetriNetUnfolder]: For 543/702 co-relation queries the response was YES. [2022-12-05 23:01:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 655 events. 248/655 cut-off events. For 543/702 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4342 event pairs, 66 based on Foata normal form. 32/649 useless extension candidates. Maximal degree in co-relation 1957. Up to 348 conditions per place. [2022-12-05 23:01:15,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-05 23:01:15,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:15,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-05 23:01:15,979 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 335 flow [2022-12-05 23:01:15,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:15,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:15,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:15,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:01:15,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1076345358, now seen corresponding path program 1 times [2022-12-05 23:01:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:15,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497035847] [2022-12-05 23:01:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497035847] [2022-12-05 23:01:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497035847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:16,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:16,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:01:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528783677] [2022-12-05 23:01:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:16,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:01:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:01:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:01:16,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:01:16,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:16,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:16,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:01:16,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:16,498 INFO L130 PetriNetUnfolder]: 2610/4066 cut-off events. [2022-12-05 23:01:16,499 INFO L131 PetriNetUnfolder]: For 5423/5600 co-relation queries the response was YES. [2022-12-05 23:01:16,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 4066 events. 2610/4066 cut-off events. For 5423/5600 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22907 event pairs, 711 based on Foata normal form. 228/4148 useless extension candidates. Maximal degree in co-relation 13303. Up to 1578 conditions per place. [2022-12-05 23:01:16,517 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 77 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2022-12-05 23:01:16,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 745 flow [2022-12-05 23:01:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:01:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:01:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-05 23:01:16,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-05 23:01:16,520 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 335 flow. Second operand 5 states and 96 transitions. [2022-12-05 23:01:16,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 745 flow [2022-12-05 23:01:16,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 727 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:01:16,530 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-05 23:01:16,531 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-05 23:01:16,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:16,531 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,532 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:16,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:16,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,559 INFO L130 PetriNetUnfolder]: 162/430 cut-off events. [2022-12-05 23:01:16,559 INFO L131 PetriNetUnfolder]: For 714/862 co-relation queries the response was YES. [2022-12-05 23:01:16,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 430 events. 162/430 cut-off events. For 714/862 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2449 event pairs, 23 based on Foata normal form. 33/437 useless extension candidates. Maximal degree in co-relation 1444. Up to 185 conditions per place. [2022-12-05 23:01:16,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 848 [2022-12-05 23:01:16,583 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:16,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-05 23:01:16,584 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 385 flow [2022-12-05 23:01:16,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:16,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:16,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:16,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:01:16,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1824566128, now seen corresponding path program 1 times [2022-12-05 23:01:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335191628] [2022-12-05 23:01:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:17,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335191628] [2022-12-05 23:01:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335191628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:17,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:17,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:01:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804163488] [2022-12-05 23:01:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:17,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:01:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:01:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:01:17,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:01:17,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:17,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:17,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:01:17,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:17,803 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([407] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_52 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_54 256) 0))) (let ((.cse5 (not .cse4)) (.cse2 (and .cse4 .cse11)) (.cse7 (and .cse4 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_142 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse5))) (let ((.cse6 (ite .cse8 v_~b~0_89 (ite .cse9 v_~b$w_buff0~0_59 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse1 (= (mod v_~b$w_buff0_used~0_141 256) 0)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256)))) (and (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$flush_delayed~0_27 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_54 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~b$r_buff0_thd4~0_54 (ite (and (not .cse1) .cse5) 0 v_~b$r_buff0_thd4~0_54))) v_~b$r_buff0_thd4~0_53) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$mem_tmp~0_18 v_~b~0_89) (= v_~b~0_88 (ite .cse0 v_~b$mem_tmp~0_18 .cse6)) (= v_~b$w_buff1_used~0_122 (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse2 .cse7) v_~b$w_buff1_used~0_123 0))) (= (ite .cse0 v_~b$w_buff0_used~0_142 (ite .cse8 v_~b$w_buff0_used~0_142 (ite .cse9 0 v_~b$w_buff0_used~0_142))) v_~b$w_buff0_used~0_141) (= v_~b$w_buff0~0_59 v_~b$w_buff0~0_58) (= .cse6 v_~__unbuffered_p3_EBX~0_10) (= v_~b$r_buff1_thd4~0_51 (ite .cse0 v_~b$r_buff1_thd4~0_52 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_53 256) 0))) (or .cse1 (and .cse10 .cse11) (and .cse3 .cse10))) v_~b$r_buff1_thd4~0_52 0))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_142, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_89, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_52, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_54, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_141, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_88, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_53} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][83], [Black: 162#(<= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P1Thread1of1ForFork3InUse, Black: 170#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 169#(<= ~x~0 0), P2Thread1of1ForFork0InUse, 167#true, P0Thread1of1ForFork1InUse, Black: 175#(= ~__unbuffered_cnt~0 0), 57#L847true, P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 101#L808true, 185#(<= ~__unbuffered_cnt~0 1), 180#(<= ~__unbuffered_cnt~0 1), 160#true, 198#(and (= ~b$w_buff1_used~0 0) (= ~b$w_buff0_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (<= 0 ~b$r_buff0_thd4~0) (not (= ~b~0 0)) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), Black: 186#(<= ~__unbuffered_cnt~0 2), 93#L795true, 82#L878-3true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-05 23:01:17,804 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-05 23:01:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 23:01:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 23:01:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 23:01:17,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([407] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_52 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_54 256) 0))) (let ((.cse5 (not .cse4)) (.cse2 (and .cse4 .cse11)) (.cse7 (and .cse4 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_142 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse5))) (let ((.cse6 (ite .cse8 v_~b~0_89 (ite .cse9 v_~b$w_buff0~0_59 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse1 (= (mod v_~b$w_buff0_used~0_141 256) 0)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256)))) (and (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$flush_delayed~0_27 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_54 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~b$r_buff0_thd4~0_54 (ite (and (not .cse1) .cse5) 0 v_~b$r_buff0_thd4~0_54))) v_~b$r_buff0_thd4~0_53) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$mem_tmp~0_18 v_~b~0_89) (= v_~b~0_88 (ite .cse0 v_~b$mem_tmp~0_18 .cse6)) (= v_~b$w_buff1_used~0_122 (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse2 .cse7) v_~b$w_buff1_used~0_123 0))) (= (ite .cse0 v_~b$w_buff0_used~0_142 (ite .cse8 v_~b$w_buff0_used~0_142 (ite .cse9 0 v_~b$w_buff0_used~0_142))) v_~b$w_buff0_used~0_141) (= v_~b$w_buff0~0_59 v_~b$w_buff0~0_58) (= .cse6 v_~__unbuffered_p3_EBX~0_10) (= v_~b$r_buff1_thd4~0_51 (ite .cse0 v_~b$r_buff1_thd4~0_52 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_53 256) 0))) (or .cse1 (and .cse10 .cse11) (and .cse3 .cse10))) v_~b$r_buff1_thd4~0_52 0))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_142, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_89, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_52, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_54, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_141, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_88, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_53} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][83], [111#P1EXITtrue, Black: 162#(<= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 186#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, Black: 170#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 169#(<= ~x~0 0), P2Thread1of1ForFork0InUse, 167#true, P0Thread1of1ForFork1InUse, Black: 175#(= ~__unbuffered_cnt~0 0), 57#L847true, P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 101#L808true, Black: 180#(<= ~__unbuffered_cnt~0 1), 160#true, 198#(and (= ~b$w_buff1_used~0 0) (= ~b$w_buff0_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (<= 0 ~b$r_buff0_thd4~0) (not (= ~b~0 0)) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), 82#L878-3true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-05 23:01:17,842 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-05 23:01:17,842 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 23:01:17,842 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 23:01:17,842 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 23:01:17,938 INFO L130 PetriNetUnfolder]: 4211/6825 cut-off events. [2022-12-05 23:01:17,938 INFO L131 PetriNetUnfolder]: For 12334/12498 co-relation queries the response was YES. [2022-12-05 23:01:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23780 conditions, 6825 events. 4211/6825 cut-off events. For 12334/12498 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 43561 event pairs, 568 based on Foata normal form. 29/6749 useless extension candidates. Maximal degree in co-relation 23756. Up to 2327 conditions per place. [2022-12-05 23:01:17,967 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 124 selfloop transitions, 7 changer transitions 22/168 dead transitions. [2022-12-05 23:01:17,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 1358 flow [2022-12-05 23:01:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:01:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:01:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-05 23:01:17,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2022-12-05 23:01:17,968 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 385 flow. Second operand 6 states and 117 transitions. [2022-12-05 23:01:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 1358 flow [2022-12-05 23:01:18,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 168 transitions, 1212 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-05 23:01:18,067 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 399 flow [2022-12-05 23:01:18,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2022-12-05 23:01:18,067 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2022-12-05 23:01:18,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:18,067 INFO L89 Accepts]: Start accepts. Operand has 63 places, 61 transitions, 399 flow [2022-12-05 23:01:18,068 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:18,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:18,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 61 transitions, 399 flow [2022-12-05 23:01:18,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 61 transitions, 399 flow [2022-12-05 23:01:18,136 INFO L130 PetriNetUnfolder]: 495/1260 cut-off events. [2022-12-05 23:01:18,136 INFO L131 PetriNetUnfolder]: For 1555/1808 co-relation queries the response was YES. [2022-12-05 23:01:18,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3764 conditions, 1260 events. 495/1260 cut-off events. For 1555/1808 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9378 event pairs, 84 based on Foata normal form. 90/1249 useless extension candidates. Maximal degree in co-relation 3740. Up to 436 conditions per place. [2022-12-05 23:01:18,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 61 transitions, 399 flow [2022-12-05 23:01:18,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-05 23:01:18,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:01:18,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-05 23:01:18,287 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 405 flow [2022-12-05 23:01:18,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:18,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:18,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:18,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:01:18,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1226264469, now seen corresponding path program 1 times [2022-12-05 23:01:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:18,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105968947] [2022-12-05 23:01:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105968947] [2022-12-05 23:01:18,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105968947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:18,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:18,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:01:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727624497] [2022-12-05 23:01:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:18,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:18,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 23:01:18,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 405 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:18,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:18,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 23:01:18,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:19,254 INFO L130 PetriNetUnfolder]: 7395/11210 cut-off events. [2022-12-05 23:01:19,254 INFO L131 PetriNetUnfolder]: For 19022/19022 co-relation queries the response was YES. [2022-12-05 23:01:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41287 conditions, 11210 events. 7395/11210 cut-off events. For 19022/19022 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 65628 event pairs, 1964 based on Foata normal form. 27/11237 useless extension candidates. Maximal degree in co-relation 41260. Up to 6502 conditions per place. [2022-12-05 23:01:19,295 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 82 selfloop transitions, 11 changer transitions 14/107 dead transitions. [2022-12-05 23:01:19,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 840 flow [2022-12-05 23:01:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:01:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:01:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-05 23:01:19,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-05 23:01:19,296 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 405 flow. Second operand 4 states and 65 transitions. [2022-12-05 23:01:19,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 840 flow [2022-12-05 23:01:19,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:01:19,467 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-05 23:01:19,467 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-05 23:01:19,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:19,468 INFO L89 Accepts]: Start accepts. Operand has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,470 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:19,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:19,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,550 INFO L130 PetriNetUnfolder]: 548/1432 cut-off events. [2022-12-05 23:01:19,550 INFO L131 PetriNetUnfolder]: For 2082/2285 co-relation queries the response was YES. [2022-12-05 23:01:19,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4222 conditions, 1432 events. 548/1432 cut-off events. For 2082/2285 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11373 event pairs, 99 based on Foata normal form. 103/1427 useless extension candidates. Maximal degree in co-relation 4197. Up to 539 conditions per place. [2022-12-05 23:01:19,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-05 23:01:19,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:19,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-05 23:01:19,570 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 401 flow [2022-12-05 23:01:19,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:19,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:19,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:01:19,571 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 847874314, now seen corresponding path program 2 times [2022-12-05 23:01:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:19,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321306597] [2022-12-05 23:01:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321306597] [2022-12-05 23:01:19,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321306597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:19,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:19,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:01:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966415145] [2022-12-05 23:01:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:19,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:01:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:01:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:01:19,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-05 23:01:19,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:19,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:19,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-05 23:01:19,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:20,271 INFO L130 PetriNetUnfolder]: 3827/6141 cut-off events. [2022-12-05 23:01:20,272 INFO L131 PetriNetUnfolder]: For 11415/11565 co-relation queries the response was YES. [2022-12-05 23:01:20,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22310 conditions, 6141 events. 3827/6141 cut-off events. For 11415/11565 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38820 event pairs, 752 based on Foata normal form. 145/6148 useless extension candidates. Maximal degree in co-relation 22282. Up to 2471 conditions per place. [2022-12-05 23:01:20,295 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 73 selfloop transitions, 17 changer transitions 15/116 dead transitions. [2022-12-05 23:01:20,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 116 transitions, 923 flow [2022-12-05 23:01:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:01:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:01:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-05 23:01:20,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5804597701149425 [2022-12-05 23:01:20,296 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 401 flow. Second operand 6 states and 101 transitions. [2022-12-05 23:01:20,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 116 transitions, 923 flow [2022-12-05 23:01:20,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 116 transitions, 848 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-05 23:01:20,460 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 351 flow [2022-12-05 23:01:20,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2022-12-05 23:01:20,461 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-05 23:01:20,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:20,461 INFO L89 Accepts]: Start accepts. Operand has 67 places, 53 transitions, 351 flow [2022-12-05 23:01:20,462 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:20,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:20,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 53 transitions, 351 flow [2022-12-05 23:01:20,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 351 flow [2022-12-05 23:01:20,487 INFO L130 PetriNetUnfolder]: 172/451 cut-off events. [2022-12-05 23:01:20,487 INFO L131 PetriNetUnfolder]: For 694/724 co-relation queries the response was YES. [2022-12-05 23:01:20,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 451 events. 172/451 cut-off events. For 694/724 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2709 event pairs, 19 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 1545. Up to 151 conditions per place. [2022-12-05 23:01:20,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 53 transitions, 351 flow [2022-12-05 23:01:20,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 634 [2022-12-05 23:01:20,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L765-->L768: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [525] $Ultimate##0-->L785: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_49 2)) 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_49} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-05 23:01:20,771 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:01:20,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-05 23:01:20,771 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 351 flow [2022-12-05 23:01:20,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:20,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:20,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:20,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:01:20,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1595257141, now seen corresponding path program 1 times [2022-12-05 23:01:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:20,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454275053] [2022-12-05 23:01:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:20,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454275053] [2022-12-05 23:01:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454275053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:20,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:20,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:01:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788036808] [2022-12-05 23:01:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:20,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:20,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:01:20,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 351 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-05 23:01:20,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:20,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:01:20,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:21,317 INFO L130 PetriNetUnfolder]: 2468/3947 cut-off events. [2022-12-05 23:01:21,318 INFO L131 PetriNetUnfolder]: For 9165/9241 co-relation queries the response was YES. [2022-12-05 23:01:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15546 conditions, 3947 events. 2468/3947 cut-off events. For 9165/9241 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22904 event pairs, 758 based on Foata normal form. 71/3964 useless extension candidates. Maximal degree in co-relation 15519. Up to 1528 conditions per place. [2022-12-05 23:01:21,333 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 59 selfloop transitions, 1 changer transitions 36/102 dead transitions. [2022-12-05 23:01:21,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 893 flow [2022-12-05 23:01:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:01:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:01:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-05 23:01:21,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2022-12-05 23:01:21,335 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 351 flow. Second operand 4 states and 59 transitions. [2022-12-05 23:01:21,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 893 flow [2022-12-05 23:01:21,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 752 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-05 23:01:21,386 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 279 flow [2022-12-05 23:01:21,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2022-12-05 23:01:21,387 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-05 23:01:21,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:21,387 INFO L89 Accepts]: Start accepts. Operand has 62 places, 49 transitions, 279 flow [2022-12-05 23:01:21,388 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:21,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:21,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 49 transitions, 279 flow [2022-12-05 23:01:21,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 279 flow [2022-12-05 23:01:21,418 INFO L130 PetriNetUnfolder]: 158/419 cut-off events. [2022-12-05 23:01:21,418 INFO L131 PetriNetUnfolder]: For 799/838 co-relation queries the response was YES. [2022-12-05 23:01:21,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 419 events. 158/419 cut-off events. For 799/838 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2621 event pairs, 20 based on Foata normal form. 17/407 useless extension candidates. Maximal degree in co-relation 1195. Up to 135 conditions per place. [2022-12-05 23:01:21,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 279 flow [2022-12-05 23:01:21,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-05 23:01:21,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:01:21,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-05 23:01:21,468 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 280 flow [2022-12-05 23:01:21,469 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-05 23:01:21,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:21,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:21,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:01:21,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -83617486, now seen corresponding path program 1 times [2022-12-05 23:01:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319143579] [2022-12-05 23:01:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319143579] [2022-12-05 23:01:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319143579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:21,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:21,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:01:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127390066] [2022-12-05 23:01:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:01:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:01:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:01:21,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:01:21,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 280 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-05 23:01:21,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:21,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:01:21,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:21,989 INFO L130 PetriNetUnfolder]: 2469/3882 cut-off events. [2022-12-05 23:01:21,990 INFO L131 PetriNetUnfolder]: For 6699/6699 co-relation queries the response was YES. [2022-12-05 23:01:21,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14096 conditions, 3882 events. 2469/3882 cut-off events. For 6699/6699 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20797 event pairs, 401 based on Foata normal form. 2/3884 useless extension candidates. Maximal degree in co-relation 14071. Up to 2124 conditions per place. [2022-12-05 23:01:22,005 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 70 selfloop transitions, 13 changer transitions 25/108 dead transitions. [2022-12-05 23:01:22,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 803 flow [2022-12-05 23:01:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:01:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:01:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-05 23:01:22,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-05 23:01:22,006 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 280 flow. Second operand 5 states and 67 transitions. [2022-12-05 23:01:22,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 803 flow [2022-12-05 23:01:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 794 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:01:22,048 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 344 flow [2022-12-05 23:01:22,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2022-12-05 23:01:22,048 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-05 23:01:22,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:22,048 INFO L89 Accepts]: Start accepts. Operand has 64 places, 52 transitions, 344 flow [2022-12-05 23:01:22,049 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:22,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:22,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 52 transitions, 344 flow [2022-12-05 23:01:22,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 344 flow [2022-12-05 23:01:22,081 INFO L130 PetriNetUnfolder]: 228/584 cut-off events. [2022-12-05 23:01:22,081 INFO L131 PetriNetUnfolder]: For 960/1007 co-relation queries the response was YES. [2022-12-05 23:01:22,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 584 events. 228/584 cut-off events. For 960/1007 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3957 event pairs, 20 based on Foata normal form. 20/568 useless extension candidates. Maximal degree in co-relation 1732. Up to 197 conditions per place. [2022-12-05 23:01:22,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 52 transitions, 344 flow [2022-12-05 23:01:22,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-05 23:01:22,087 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:01:22,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-05 23:01:22,087 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 344 flow [2022-12-05 23:01:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-05 23:01:22,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:22,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:22,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:01:22,088 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1772579856, now seen corresponding path program 2 times [2022-12-05 23:01:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124255203] [2022-12-05 23:01:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124255203] [2022-12-05 23:01:22,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124255203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:22,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:22,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:01:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397394067] [2022-12-05 23:01:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:22,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:01:22,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:22,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:01:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:01:22,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:01:22,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 344 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-05 23:01:22,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:22,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:01:22,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:22,635 INFO L130 PetriNetUnfolder]: 2922/4616 cut-off events. [2022-12-05 23:01:22,635 INFO L131 PetriNetUnfolder]: For 9774/9774 co-relation queries the response was YES. [2022-12-05 23:01:22,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17805 conditions, 4616 events. 2922/4616 cut-off events. For 9774/9774 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 25600 event pairs, 606 based on Foata normal form. 2/4618 useless extension candidates. Maximal degree in co-relation 17778. Up to 2147 conditions per place. [2022-12-05 23:01:22,653 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 49 selfloop transitions, 3 changer transitions 64/116 dead transitions. [2022-12-05 23:01:22,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 900 flow [2022-12-05 23:01:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:01:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:01:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-05 23:01:22,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 23:01:22,655 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 344 flow. Second operand 6 states and 72 transitions. [2022-12-05 23:01:22,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 900 flow [2022-12-05 23:01:22,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 892 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:01:22,714 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 229 flow [2022-12-05 23:01:22,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2022-12-05 23:01:22,715 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-05 23:01:22,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:22,715 INFO L89 Accepts]: Start accepts. Operand has 68 places, 40 transitions, 229 flow [2022-12-05 23:01:22,716 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:22,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:22,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 40 transitions, 229 flow [2022-12-05 23:01:22,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 40 transitions, 229 flow [2022-12-05 23:01:22,729 INFO L130 PetriNetUnfolder]: 83/224 cut-off events. [2022-12-05 23:01:22,729 INFO L131 PetriNetUnfolder]: For 543/584 co-relation queries the response was YES. [2022-12-05 23:01:22,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 224 events. 83/224 cut-off events. For 543/584 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1079 event pairs, 5 based on Foata normal form. 9/206 useless extension candidates. Maximal degree in co-relation 647. Up to 79 conditions per place. [2022-12-05 23:01:22,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 40 transitions, 229 flow [2022-12-05 23:01:22,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-05 23:01:22,854 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:01:22,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-05 23:01:22,854 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 225 flow [2022-12-05 23:01:22,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-05 23:01:22,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:22,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:22,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:01:22,855 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1238470727, now seen corresponding path program 1 times [2022-12-05 23:01:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116759948] [2022-12-05 23:01:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:23,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116759948] [2022-12-05 23:01:23,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116759948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:01:23,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:01:23,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:01:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722462822] [2022-12-05 23:01:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:01:23,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:01:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:01:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:01:23,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:01:23,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 225 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:23,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:23,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:01:23,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:23,748 INFO L130 PetriNetUnfolder]: 1009/1718 cut-off events. [2022-12-05 23:01:23,748 INFO L131 PetriNetUnfolder]: For 3872/3888 co-relation queries the response was YES. [2022-12-05 23:01:23,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6518 conditions, 1718 events. 1009/1718 cut-off events. For 3872/3888 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9051 event pairs, 141 based on Foata normal form. 12/1726 useless extension candidates. Maximal degree in co-relation 6489. Up to 726 conditions per place. [2022-12-05 23:01:23,754 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 73 selfloop transitions, 6 changer transitions 44/124 dead transitions. [2022-12-05 23:01:23,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 944 flow [2022-12-05 23:01:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:01:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:01:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-05 23:01:23,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4658385093167702 [2022-12-05 23:01:23,756 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 225 flow. Second operand 7 states and 75 transitions. [2022-12-05 23:01:23,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 944 flow [2022-12-05 23:01:23,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 124 transitions, 883 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-05 23:01:23,771 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 238 flow [2022-12-05 23:01:23,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2022-12-05 23:01:23,772 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2022-12-05 23:01:23,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:01:23,772 INFO L89 Accepts]: Start accepts. Operand has 61 places, 40 transitions, 238 flow [2022-12-05 23:01:23,772 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:01:23,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:01:23,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 40 transitions, 238 flow [2022-12-05 23:01:23,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 40 transitions, 238 flow [2022-12-05 23:01:23,788 INFO L130 PetriNetUnfolder]: 115/287 cut-off events. [2022-12-05 23:01:23,788 INFO L131 PetriNetUnfolder]: For 1325/1440 co-relation queries the response was YES. [2022-12-05 23:01:23,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 287 events. 115/287 cut-off events. For 1325/1440 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1494 event pairs, 7 based on Foata normal form. 31/289 useless extension candidates. Maximal degree in co-relation 858. Up to 106 conditions per place. [2022-12-05 23:01:23,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 238 flow [2022-12-05 23:01:23,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-05 23:01:23,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L878-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~b$r_buff1_thd0~0_152 256) 0))) (.cse1 (not (= (mod v_~b$w_buff0_used~0_504 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd0~0_153 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~b$w_buff1_used~0_425 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_505 256) 0)) .cse5))) (and (= (mod v_~main$tmp_guard0~0_78 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~main$tmp_guard1~0_76 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_80 0) (= 0 v_~__unbuffered_p3_EBX~0_95) (= v_~__unbuffered_p2_EAX~0_85 0) (= 2 v_~x~0_104) (= v_~__unbuffered_p3_EAX~0_74 1))) 1 0) 0) 0 1)) (= (ite (or (and (not (= (mod v_~b$w_buff1_used~0_424 256) 0)) .cse0) (and (not (= (mod v_~b$r_buff0_thd0~0_152 256) 0)) .cse1)) 0 v_~b$r_buff1_thd0~0_152) v_~b$r_buff1_thd0~0_151) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75| 0) (= (mod v_~main$tmp_guard1~0_76 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~b$r_buff0_thd0~0_152 (ite .cse2 0 v_~b$r_buff0_thd0~0_153)) (= (ite (or .cse2 .cse3) 0 v_~b$w_buff1_used~0_425) v_~b$w_buff1_used~0_424) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_337 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_78) (= v_~b~0_356 (ite .cse4 v_~b$w_buff0~0_292 (ite .cse3 v_~b$w_buff1~0_241 v_~b~0_357))) (= (ite .cse4 0 v_~b$w_buff0_used~0_505) v_~b$w_buff0_used~0_504) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|)))) InVars {~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_152, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_95, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_505, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_425, ~b~0=v_~b~0_357, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~b$w_buff1~0=v_~b$w_buff1~0_241, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~b$w_buff0~0=v_~b$w_buff0~0_292, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_337, ~x~0=v_~x~0_104, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_153} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_151, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_69|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_504, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_424, ~b~0=v_~b~0_356, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~b$w_buff1~0=v_~b$w_buff1~0_241, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~b$w_buff0~0=v_~b$w_buff0~0_292, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_337, ~x~0=v_~x~0_104, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_152, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~b$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~b$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [543] $Ultimate##0-->L768: Formula: (and (= v_~b$r_buff0_thd1~0_206 v_~b$r_buff1_thd1~0_126) (= v_~x~0_106 1) (= v_~b$w_buff1~0_251 v_~b$w_buff0~0_305) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| 0)) (= v_~b$r_buff0_thd3~0_136 v_~b$r_buff1_thd3~0_137) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|) (= v_~b$w_buff0_used~0_532 1) (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff1_thd4~0_233) (= v_~b$r_buff0_thd2~0_176 v_~b$r_buff1_thd2~0_180) (= v_~b$w_buff0~0_304 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_68| |v_P0Thread1of1ForFork1_#in~arg#1.offset_68|) (= (ite (not (and (not (= (mod v_~b$w_buff0_used~0_532 256) 0)) (not (= (mod v_~b$w_buff1_used~0_452 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|) (= v_~b$w_buff0_used~0_533 v_~b$w_buff1_used~0_452) (= |v_P0Thread1of1ForFork1_~arg#1.base_68| |v_P0Thread1of1ForFork1_#in~arg#1.base_68|) (= v_~b$r_buff0_thd1~0_205 1) (= v_~b$r_buff0_thd0~0_156 v_~b$r_buff1_thd0~0_155)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_533, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_206, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_176, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_136, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_68|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_68|, ~b$w_buff0~0=v_~b$w_buff0~0_305, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_156} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_205, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_176, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_136, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_126, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_155, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_68|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_68|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_68|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_68|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_532, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_452, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_233, ~b$w_buff1~0=v_~b$w_buff1~0_251, ~b$w_buff0~0=v_~b$w_buff0~0_304, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_70|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_180, ~x~0=v_~x~0_106, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_137, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_156} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~x~0, ~b$r_buff1_thd3~0] [2022-12-05 23:01:24,112 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:01:24,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-05 23:01:24,113 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 258 flow [2022-12-05 23:01:24,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:24,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:24,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:24,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:01:24,113 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1946255661, now seen corresponding path program 2 times [2022-12-05 23:01:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:24,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498820463] [2022-12-05 23:01:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:01:24,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:01:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:01:24,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:01:24,306 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:01:24,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:01:24,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:01:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:01:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:01:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:01:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:01:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:01:24,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:01:24,311 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:24,316 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:01:24,316 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:01:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:01:24 BasicIcfg [2022-12-05 23:01:24,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:01:24,396 INFO L158 Benchmark]: Toolchain (without parser) took 21535.70ms. Allocated memory was 191.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 156.0MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 411.6MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,396 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:01:24,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.51ms. Allocated memory is still 191.9MB. Free memory was 156.0MB in the beginning and 127.6MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 191.9MB. Free memory was 127.6MB in the beginning and 125.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,397 INFO L158 Benchmark]: Boogie Preprocessor took 42.29ms. Allocated memory is still 191.9MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,397 INFO L158 Benchmark]: RCFGBuilder took 552.00ms. Allocated memory is still 191.9MB. Free memory was 123.0MB in the beginning and 154.9MB in the end (delta: -31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,397 INFO L158 Benchmark]: TraceAbstraction took 20447.66ms. Allocated memory was 191.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 154.4MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 409.4MB. Max. memory is 8.0GB. [2022-12-05 23:01:24,398 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.11ms. Allocated memory is still 191.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.51ms. Allocated memory is still 191.9MB. Free memory was 156.0MB in the beginning and 127.6MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 191.9MB. Free memory was 127.6MB in the beginning and 125.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.29ms. Allocated memory is still 191.9MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 552.00ms. Allocated memory is still 191.9MB. Free memory was 123.0MB in the beginning and 154.9MB in the end (delta: -31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20447.66ms. Allocated memory was 191.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 154.4MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 409.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 140 PlacesBefore, 48 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2561, independent: 2487, independent conditional: 2487, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2561, independent: 2487, independent conditional: 0, independent unconditional: 2487, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2561, independent: 2487, independent conditional: 0, independent unconditional: 2487, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2561, independent: 2487, independent conditional: 0, independent unconditional: 2487, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2081, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2081, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2561, independent: 455, independent conditional: 0, independent unconditional: 455, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 2081, unknown conditional: 0, unknown unconditional: 2081] , Statistics on independence cache: Total cache size (in pairs): 2974, Positive cache size: 2925, Positive conditional cache size: 0, Positive unconditional cache size: 2925, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 142, independent conditional: 19, independent unconditional: 123, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 114, dependent conditional: 38, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 167, unknown conditional: 29, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 142, Positive conditional cache size: 19, Positive unconditional cache size: 123, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 139, independent conditional: 23, independent unconditional: 116, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 159, Positive conditional cache size: 19, Positive unconditional cache size: 140, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 149, independent conditional: 17, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 191, independent conditional: 52, independent unconditional: 139, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 223, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 163, Positive conditional cache size: 19, Positive unconditional cache size: 144, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 42, independent unconditional: 95, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 137, independent conditional: 6, independent unconditional: 131, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 6, independent unconditional: 131, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 135, independent conditional: 6, independent unconditional: 129, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 43, independent unconditional: 91, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, 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: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 140, independent conditional: 140, 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: 179, independent: 140, independent conditional: 44, independent unconditional: 96, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 208, independent: 182, independent conditional: 132, independent unconditional: 50, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 208, independent: 182, independent conditional: 87, independent unconditional: 95, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 182, independent conditional: 87, independent unconditional: 95, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 8, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 168, independent conditional: 79, independent unconditional: 89, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 16, unknown conditional: 10, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 181, Positive conditional cache size: 27, Positive unconditional cache size: 154, Negative cache size: 41, Negative conditional cache size: 12, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 106, independent conditional: 64, independent unconditional: 42, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 106, independent conditional: 43, independent unconditional: 63, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 106, independent conditional: 43, independent unconditional: 63, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 95, independent conditional: 39, independent unconditional: 56, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 192, Positive conditional cache size: 31, Positive unconditional cache size: 161, Negative cache size: 42, Negative conditional cache size: 12, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 64 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 191, independent conditional: 141, independent unconditional: 50, dependent: 30, dependent conditional: 6, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221, independent: 191, independent conditional: 91, independent unconditional: 100, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221, independent: 191, independent conditional: 91, independent unconditional: 100, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 221, independent: 180, independent conditional: 86, independent unconditional: 94, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 214, Positive conditional cache size: 36, Positive unconditional cache size: 178, Negative cache size: 42, Negative conditional cache size: 12, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 60 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 126, independent conditional: 70, independent unconditional: 56, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 126, independent conditional: 52, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 126, independent conditional: 52, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 146, independent: 120, independent conditional: 48, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 250, Positive conditional cache size: 44, Positive unconditional cache size: 206, Negative cache size: 42, Negative conditional cache size: 12, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 250, Positive conditional cache size: 44, Positive unconditional cache size: 206, Negative cache size: 42, Negative conditional cache size: 12, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 63 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 51, independent unconditional: 21, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 72, independent conditional: 51, independent unconditional: 21, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 51, independent unconditional: 21, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 63, independent conditional: 46, independent unconditional: 17, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 286, Positive conditional cache size: 51, Positive unconditional cache size: 235, Negative cache size: 43, Negative conditional cache size: 12, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 59 PlacesBefore, 61 PlacesAfterwards, 40 TransitionsBefore, 41 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 72, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 84, independent conditional: 68, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 68, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 72, independent conditional: 60, independent unconditional: 12, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 13, unknown conditional: 8, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 298, Positive conditional cache size: 59, Positive unconditional cache size: 239, Negative cache size: 44, Negative conditional cache size: 12, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-4, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-3, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-2, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: 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, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 31 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=8, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:01:24,447 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...