/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/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:04:01,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:04:01,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:04:01,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:04:01,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:04:01,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:04:01,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:04:01,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:04:01,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:04:01,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:04:01,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:04:01,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:04:01,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:04:01,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:04:01,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:04:01,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:04:01,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:04:01,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:04:01,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:04:01,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:04:01,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:04:01,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:04:01,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:04:01,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:04:01,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:04:01,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:04:01,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:04:01,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:04:01,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:04:01,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:04:01,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:04:01,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:04:01,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:04:01,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:04:01,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:04:01,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:04:01,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:04:01,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:04:01,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:04:01,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:04:01,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:04:01,208 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:04:01,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:04:01,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:04:01,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:04:01,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:04:01,236 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:04:01,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:04:01,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:04:01,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:04:01,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:04:01,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:04:01,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:04:01,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:01,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:04:01,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:04:01,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:04:01,240 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:04:01,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:04:01,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:04:01,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:04:01,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:04:01,525 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:04:01,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:04:02,593 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:04:02,815 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:04:02,816 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:04:02,830 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeea09ebf/a51243588c9042b18b548aab47da638a/FLAG990c1e76e [2022-12-05 23:04:02,849 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeea09ebf/a51243588c9042b18b548aab47da638a [2022-12-05 23:04:02,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:04:02,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:04:02,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:02,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:04:02,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:04:02,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:02" (1/1) ... [2022-12-05 23:04:02,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8fc6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:02, skipping insertion in model container [2022-12-05 23:04:02,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:02" (1/1) ... [2022-12-05 23:04:02,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:04:02,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:04:02,993 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:04:03,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:03,183 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:04:03,193 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:04:03,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:03,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:03,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:03,293 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:04:03,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03 WrapperNode [2022-12-05 23:04:03,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:03,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:03,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:04:03,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:04:03,300 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:04:03" (1/1) ... [2022-12-05 23:04:03,324 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:04:03" (1/1) ... [2022-12-05 23:04:03,346 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 23:04:03,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:03,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:04:03,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:04:03,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:04:03,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:04:03,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:04:03,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:04:03,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:04:03,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (1/1) ... [2022-12-05 23:04:03,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:04:03,428 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:04:03,442 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:04:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:04:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:04:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:04:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:04:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:04:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:04:03,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:04:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:04:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:04:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:04:03,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:04:03,456 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:04:03,605 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:04:03,606 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:04:03,870 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:04:03,985 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:04:03,985 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:04:03,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:03 BoogieIcfgContainer [2022-12-05 23:04:03,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:04:03,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:04:03,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:04:03,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:04:03,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:04:02" (1/3) ... [2022-12-05 23:04:03,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53caa6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:03, skipping insertion in model container [2022-12-05 23:04:03,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:03" (2/3) ... [2022-12-05 23:04:03,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53caa6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:03, skipping insertion in model container [2022-12-05 23:04:03,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:03" (3/3) ... [2022-12-05 23:04:03,992 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:04:04,004 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:04:04,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:04:04,005 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:04:04,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:04:04,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 23:04:04,152 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 23:04:04,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:04,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:04:04,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 23:04:04,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 23:04:04,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:04,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 23:04:04,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 23:04:04,206 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 23:04:04,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:04,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:04:04,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 23:04:04,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-05 23:04:08,857 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 23:04:08,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:04:08,871 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;@56f3d605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:04:08,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:04:08,873 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:04:08,873 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:08,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:08,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:04:08,874 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:04:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 556139, now seen corresponding path program 1 times [2022-12-05 23:04:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:08,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279456302] [2022-12-05 23:04:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:09,170 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:04:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279456302] [2022-12-05 23:04:09,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279456302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:09,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:09,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130192410] [2022-12-05 23:04:09,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:09,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 23:04:09,194 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:04:09,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:09,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 23:04:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:10,006 INFO L130 PetriNetUnfolder]: 6050/8308 cut-off events. [2022-12-05 23:04:10,006 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 23:04:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16707 conditions, 8308 events. 6050/8308 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41419 event pairs, 3098 based on Foata normal form. 0/7547 useless extension candidates. Maximal degree in co-relation 16695. Up to 6574 conditions per place. [2022-12-05 23:04:10,040 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-05 23:04:10,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-05 23:04:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-05 23:04:10,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 23:04:10,049 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:04:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-05 23:04:10,052 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:04:10,053 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-05 23:04:10,054 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:04:10,056 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-05 23:04:10,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:10,057 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-05 23:04:10,058 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:10,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:10,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-05 23:04:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-05 23:04:10,063 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-05 23:04:10,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:10,063 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 3. Compared 36 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:04:10,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-05 23:04:10,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-05 23:04:10,137 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:10,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-05 23:04:10,139 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-05 23:04:10,139 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:04:10,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:10,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:10,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:04:10,139 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:04:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1501688075, now seen corresponding path program 1 times [2022-12-05 23:04:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554384141] [2022-12-05 23:04:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:10,332 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:04:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554384141] [2022-12-05 23:04:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554384141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:10,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:10,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371696155] [2022-12-05 23:04:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:10,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:10,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:04:10,335 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:04:10,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:10,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:04:10,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:11,978 INFO L130 PetriNetUnfolder]: 16407/22321 cut-off events. [2022-12-05 23:04:11,979 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2022-12-05 23:04:11,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46179 conditions, 22321 events. 16407/22321 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 117990 event pairs, 5637 based on Foata normal form. 634/22955 useless extension candidates. Maximal degree in co-relation 46169. Up to 13398 conditions per place. [2022-12-05 23:04:12,060 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-05 23:04:12,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-05 23:04:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 23:04:12,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 23:04:12,062 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:04:12,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-05 23:04:12,063 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:04:12,064 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,064 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-05 23:04:12,064 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-05 23:04:12,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:12,064 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,065 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:12,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:12,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,113 INFO L130 PetriNetUnfolder]: 241/622 cut-off events. [2022-12-05 23:04:12,113 INFO L131 PetriNetUnfolder]: For 82/95 co-relation queries the response was YES. [2022-12-05 23:04:12,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 622 events. 241/622 cut-off events. For 82/95 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4099 event pairs, 101 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 1210. Up to 263 conditions per place. [2022-12-05 23:04:12,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-05 23:04:12,235 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:12,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-05 23:04:12,236 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2022-12-05 23:04:12,237 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:04:12,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:12,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:12,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:04:12,237 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:04:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash 692308755, now seen corresponding path program 1 times [2022-12-05 23:04:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:12,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538412556] [2022-12-05 23:04:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:12,341 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:04:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:12,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538412556] [2022-12-05 23:04:12,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538412556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:12,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:12,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959685523] [2022-12-05 23:04:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:12,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:12,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:12,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:04:12,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 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:04:12,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:12,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:04:12,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:13,918 INFO L130 PetriNetUnfolder]: 15212/20712 cut-off events. [2022-12-05 23:04:13,918 INFO L131 PetriNetUnfolder]: For 8815/8815 co-relation queries the response was YES. [2022-12-05 23:04:13,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51966 conditions, 20712 events. 15212/20712 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 105503 event pairs, 3999 based on Foata normal form. 225/20937 useless extension candidates. Maximal degree in co-relation 51954. Up to 8783 conditions per place. [2022-12-05 23:04:13,982 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2022-12-05 23:04:13,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 340 flow [2022-12-05 23:04:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 23:04:13,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-05 23:04:13,984 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 60 transitions. [2022-12-05 23:04:13,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 340 flow [2022-12-05 23:04:14,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:14,015 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-05 23:04:14,016 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-05 23:04:14,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:14,016 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,016 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:14,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:14,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,040 INFO L130 PetriNetUnfolder]: 170/452 cut-off events. [2022-12-05 23:04:14,040 INFO L131 PetriNetUnfolder]: For 243/246 co-relation queries the response was YES. [2022-12-05 23:04:14,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 452 events. 170/452 cut-off events. For 243/246 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2705 event pairs, 54 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1027. Up to 187 conditions per place. [2022-12-05 23:04:14,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-05 23:04:14,062 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:14,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-05 23:04:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 168 flow [2022-12-05 23:04:14,063 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:04:14,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:14,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:04:14,064 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:04:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -13459691, now seen corresponding path program 1 times [2022-12-05 23:04:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561876916] [2022-12-05 23:04:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:14,172 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:04:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561876916] [2022-12-05 23:04:14,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561876916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:14,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:14,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971261151] [2022-12-05 23:04:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:14,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:14,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:14,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:04:14,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 168 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:04:14,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:14,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:04:14,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:15,492 INFO L130 PetriNetUnfolder]: 14954/20366 cut-off events. [2022-12-05 23:04:15,493 INFO L131 PetriNetUnfolder]: For 12761/12761 co-relation queries the response was YES. [2022-12-05 23:04:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53989 conditions, 20366 events. 14954/20366 cut-off events. For 12761/12761 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 106608 event pairs, 2854 based on Foata normal form. 40/20406 useless extension candidates. Maximal degree in co-relation 53974. Up to 11586 conditions per place. [2022-12-05 23:04:15,560 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 65 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2022-12-05 23:04:15,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 490 flow [2022-12-05 23:04:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 23:04:15,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-05 23:04:15,561 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 168 flow. Second operand 4 states and 72 transitions. [2022-12-05 23:04:15,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 490 flow [2022-12-05 23:04:15,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:15,603 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2022-12-05 23:04:15,604 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-05 23:04:15,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:15,604 INFO L89 Accepts]: Start accepts. Operand has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,605 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:15,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:15,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,628 INFO L130 PetriNetUnfolder]: 152/414 cut-off events. [2022-12-05 23:04:15,628 INFO L131 PetriNetUnfolder]: For 616/663 co-relation queries the response was YES. [2022-12-05 23:04:15,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 414 events. 152/414 cut-off events. For 616/663 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2375 event pairs, 31 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1252. Up to 171 conditions per place. [2022-12-05 23:04:15,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-05 23:04:15,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:15,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:04:15,634 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 322 flow [2022-12-05 23:04:15,634 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:04:15,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:15,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:15,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:04:15,634 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:04:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash -411188927, now seen corresponding path program 1 times [2022-12-05 23:04:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:15,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622979604] [2022-12-05 23:04:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:15,729 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:04:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:15,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622979604] [2022-12-05 23:04:15,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622979604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:15,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:15,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629506677] [2022-12-05 23:04:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:15,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:04:15,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:15,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:15,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:04:15,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:16,968 INFO L130 PetriNetUnfolder]: 9343/13834 cut-off events. [2022-12-05 23:04:16,969 INFO L131 PetriNetUnfolder]: For 17921/19433 co-relation queries the response was YES. [2022-12-05 23:04:16,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37355 conditions, 13834 events. 9343/13834 cut-off events. For 17921/19433 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 87281 event pairs, 1514 based on Foata normal form. 1252/14735 useless extension candidates. Maximal degree in co-relation 37336. Up to 8514 conditions per place. [2022-12-05 23:04:17,037 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 96 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2022-12-05 23:04:17,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 123 transitions, 920 flow [2022-12-05 23:04:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-05 23:04:17,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-05 23:04:17,039 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 322 flow. Second operand 5 states and 92 transitions. [2022-12-05 23:04:17,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 123 transitions, 920 flow [2022-12-05 23:04:17,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:17,058 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 397 flow [2022-12-05 23:04:17,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2022-12-05 23:04:17,058 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-05 23:04:17,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:17,058 INFO L89 Accepts]: Start accepts. Operand has 57 places, 59 transitions, 397 flow [2022-12-05 23:04:17,059 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:17,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:17,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 59 transitions, 397 flow [2022-12-05 23:04:17,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 397 flow [2022-12-05 23:04:17,175 INFO L130 PetriNetUnfolder]: 771/1607 cut-off events. [2022-12-05 23:04:17,175 INFO L131 PetriNetUnfolder]: For 1824/2512 co-relation queries the response was YES. [2022-12-05 23:04:17,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4911 conditions, 1607 events. 771/1607 cut-off events. For 1824/2512 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 12604 event pairs, 320 based on Foata normal form. 14/1445 useless extension candidates. Maximal degree in co-relation 4890. Up to 937 conditions per place. [2022-12-05 23:04:17,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 397 flow [2022-12-05 23:04:17,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-05 23:04:17,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:17,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 493 [2022-12-05 23:04:17,551 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 391 flow [2022-12-05 23:04:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:17,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:17,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:17,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:04:17,551 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:04:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash -318641581, now seen corresponding path program 1 times [2022-12-05 23:04:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:17,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413644260] [2022-12-05 23:04:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:17,742 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:04:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:17,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413644260] [2022-12-05 23:04:17,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413644260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:17,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713039058] [2022-12-05 23:04:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:17,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:04:17,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:17,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:17,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:04:17,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:18,571 INFO L130 PetriNetUnfolder]: 5040/7862 cut-off events. [2022-12-05 23:04:18,571 INFO L131 PetriNetUnfolder]: For 12223/12891 co-relation queries the response was YES. [2022-12-05 23:04:18,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26167 conditions, 7862 events. 5040/7862 cut-off events. For 12223/12891 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 48748 event pairs, 790 based on Foata normal form. 781/8450 useless extension candidates. Maximal degree in co-relation 26143. Up to 2637 conditions per place. [2022-12-05 23:04:18,613 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 112 selfloop transitions, 14 changer transitions 0/143 dead transitions. [2022-12-05 23:04:18,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 1129 flow [2022-12-05 23:04:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-05 23:04:18,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2022-12-05 23:04:18,615 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 391 flow. Second operand 6 states and 113 transitions. [2022-12-05 23:04:18,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 1129 flow [2022-12-05 23:04:18,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 143 transitions, 1122 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:18,649 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 480 flow [2022-12-05 23:04:18,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2022-12-05 23:04:18,650 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2022-12-05 23:04:18,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:18,650 INFO L89 Accepts]: Start accepts. Operand has 61 places, 63 transitions, 480 flow [2022-12-05 23:04:18,651 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:18,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:18,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 480 flow [2022-12-05 23:04:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 480 flow [2022-12-05 23:04:18,727 INFO L130 PetriNetUnfolder]: 464/1092 cut-off events. [2022-12-05 23:04:18,728 INFO L131 PetriNetUnfolder]: For 2888/3719 co-relation queries the response was YES. [2022-12-05 23:04:18,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 1092 events. 464/1092 cut-off events. For 2888/3719 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7989 event pairs, 85 based on Foata normal form. 33/1063 useless extension candidates. Maximal degree in co-relation 4502. Up to 673 conditions per place. [2022-12-05 23:04:18,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 480 flow [2022-12-05 23:04:18,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-05 23:04:18,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 23:04:18,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 23:04:18,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-05 23:04:18,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L852-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P3Thread1of1ForFork1_#res.base_11| 0) (= |v_P3Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-05 23:04:18,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:18,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-05 23:04:18,861 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 488 flow [2022-12-05 23:04:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:18,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:18,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:18,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:04:18,862 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:04:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1555594541, now seen corresponding path program 1 times [2022-12-05 23:04:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:18,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235045790] [2022-12-05 23:04:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235045790] [2022-12-05 23:04:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235045790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:19,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:19,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300329199] [2022-12-05 23:04:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:19,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:19,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 23:04:19,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 488 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:04:19,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:19,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 23:04:19,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:20,083 INFO L130 PetriNetUnfolder]: 8212/12172 cut-off events. [2022-12-05 23:04:20,083 INFO L131 PetriNetUnfolder]: For 41940/41940 co-relation queries the response was YES. [2022-12-05 23:04:20,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50878 conditions, 12172 events. 8212/12172 cut-off events. For 41940/41940 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 69002 event pairs, 1819 based on Foata normal form. 76/12248 useless extension candidates. Maximal degree in co-relation 50851. Up to 5577 conditions per place. [2022-12-05 23:04:20,133 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 23 changer transitions 18/131 dead transitions. [2022-12-05 23:04:20,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 131 transitions, 1248 flow [2022-12-05 23:04:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-05 23:04:20,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-05 23:04:20,135 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 488 flow. Second operand 4 states and 87 transitions. [2022-12-05 23:04:20,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 131 transitions, 1248 flow [2022-12-05 23:04:20,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 1072 flow, removed 75 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:20,514 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 557 flow [2022-12-05 23:04:20,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=557, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2022-12-05 23:04:20,514 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2022-12-05 23:04:20,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:20,514 INFO L89 Accepts]: Start accepts. Operand has 63 places, 63 transitions, 557 flow [2022-12-05 23:04:20,515 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:20,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:20,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 63 transitions, 557 flow [2022-12-05 23:04:20,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 63 transitions, 557 flow [2022-12-05 23:04:20,579 INFO L130 PetriNetUnfolder]: 496/1147 cut-off events. [2022-12-05 23:04:20,580 INFO L131 PetriNetUnfolder]: For 2387/2640 co-relation queries the response was YES. [2022-12-05 23:04:20,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1147 events. 496/1147 cut-off events. For 2387/2640 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8275 event pairs, 128 based on Foata normal form. 44/1130 useless extension candidates. Maximal degree in co-relation 3999. Up to 627 conditions per place. [2022-12-05 23:04:20,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 63 transitions, 557 flow [2022-12-05 23:04:20,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 1074 [2022-12-05 23:04:20,593 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:20,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:04:20,593 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 557 flow [2022-12-05 23:04:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:04:20,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:20,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:20,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:04:20,594 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:04:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1511071422, now seen corresponding path program 1 times [2022-12-05 23:04:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:20,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271666273] [2022-12-05 23:04:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:20,753 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:04:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:20,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271666273] [2022-12-05 23:04:20,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271666273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:20,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:20,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:04:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363001452] [2022-12-05 23:04:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:20,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:20,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:04:20,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:20,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:20,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:04:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:21,355 INFO L130 PetriNetUnfolder]: 3969/6346 cut-off events. [2022-12-05 23:04:21,355 INFO L131 PetriNetUnfolder]: For 16156/16597 co-relation queries the response was YES. [2022-12-05 23:04:21,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22302 conditions, 6346 events. 3969/6346 cut-off events. For 16156/16597 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39686 event pairs, 823 based on Foata normal form. 403/6559 useless extension candidates. Maximal degree in co-relation 22273. Up to 2143 conditions per place. [2022-12-05 23:04:21,382 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 114 selfloop transitions, 18 changer transitions 18/170 dead transitions. [2022-12-05 23:04:21,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 170 transitions, 1637 flow [2022-12-05 23:04:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:04:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:04:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-05 23:04:21,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2022-12-05 23:04:21,384 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 557 flow. Second operand 7 states and 132 transitions. [2022-12-05 23:04:21,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 170 transitions, 1637 flow [2022-12-05 23:04:21,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 170 transitions, 1623 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:21,402 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 691 flow [2022-12-05 23:04:21,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2022-12-05 23:04:21,402 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-05 23:04:21,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:21,402 INFO L89 Accepts]: Start accepts. Operand has 70 places, 72 transitions, 691 flow [2022-12-05 23:04:21,404 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:21,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:21,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 72 transitions, 691 flow [2022-12-05 23:04:21,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 72 transitions, 691 flow [2022-12-05 23:04:21,457 INFO L130 PetriNetUnfolder]: 340/877 cut-off events. [2022-12-05 23:04:21,457 INFO L131 PetriNetUnfolder]: For 2562/2799 co-relation queries the response was YES. [2022-12-05 23:04:21,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 877 events. 340/877 cut-off events. For 2562/2799 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6236 event pairs, 32 based on Foata normal form. 4/843 useless extension candidates. Maximal degree in co-relation 3856. Up to 504 conditions per place. [2022-12-05 23:04:21,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 72 transitions, 691 flow [2022-12-05 23:04:21,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 1260 [2022-12-05 23:04:21,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 23:04:21,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L852-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P3Thread1of1ForFork1_#res.base_11| 0) (= |v_P3Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-05 23:04:21,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-05 23:04:21,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 23:04:21,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:21,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-05 23:04:21,589 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 697 flow [2022-12-05 23:04:21,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:21,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:21,589 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:04:21,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:04:21,590 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:04:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2057724155, now seen corresponding path program 1 times [2022-12-05 23:04:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:21,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086006026] [2022-12-05 23:04:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:22,326 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:04:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:22,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086006026] [2022-12-05 23:04:22,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086006026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:22,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:22,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:04:22,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955995657] [2022-12-05 23:04:22,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:22,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:04:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:22,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:04:22,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:04:22,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 23:04:22,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 697 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:04:22,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:22,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 23:04:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:23,365 INFO L130 PetriNetUnfolder]: 5846/9438 cut-off events. [2022-12-05 23:04:23,366 INFO L131 PetriNetUnfolder]: For 35461/35790 co-relation queries the response was YES. [2022-12-05 23:04:23,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38508 conditions, 9438 events. 5846/9438 cut-off events. For 35461/35790 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 63500 event pairs, 1179 based on Foata normal form. 62/9321 useless extension candidates. Maximal degree in co-relation 38475. Up to 4926 conditions per place. [2022-12-05 23:04:23,412 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 113 selfloop transitions, 10 changer transitions 57/200 dead transitions. [2022-12-05 23:04:23,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 200 transitions, 2175 flow [2022-12-05 23:04:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:04:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:04:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-05 23:04:23,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5848214285714286 [2022-12-05 23:04:23,413 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 697 flow. Second operand 7 states and 131 transitions. [2022-12-05 23:04:23,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 200 transitions, 2175 flow [2022-12-05 23:04:23,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 200 transitions, 1858 flow, removed 131 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:23,647 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 700 flow [2022-12-05 23:04:23,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=700, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2022-12-05 23:04:23,648 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2022-12-05 23:04:23,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:23,648 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 700 flow [2022-12-05 23:04:23,649 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:23,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:23,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 700 flow [2022-12-05 23:04:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 79 transitions, 700 flow [2022-12-05 23:04:23,785 INFO L130 PetriNetUnfolder]: 922/2160 cut-off events. [2022-12-05 23:04:23,785 INFO L131 PetriNetUnfolder]: For 3884/3962 co-relation queries the response was YES. [2022-12-05 23:04:23,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7608 conditions, 2160 events. 922/2160 cut-off events. For 3884/3962 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 17565 event pairs, 96 based on Foata normal form. 6/2013 useless extension candidates. Maximal degree in co-relation 7574. Up to 658 conditions per place. [2022-12-05 23:04:23,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 79 transitions, 700 flow [2022-12-05 23:04:23,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 1544 [2022-12-05 23:04:23,806 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:23,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-05 23:04:23,806 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 700 flow [2022-12-05 23:04:23,807 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:04:23,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:23,807 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:04:23,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:04:23,807 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:04:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 155813641, now seen corresponding path program 2 times [2022-12-05 23:04:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:23,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347777047] [2022-12-05 23:04:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:23,987 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:04:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347777047] [2022-12-05 23:04:23,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347777047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:23,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:23,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:04:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708799222] [2022-12-05 23:04:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:23,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:04:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:04:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:04:23,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 23:04:23,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 700 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:04:23,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:23,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 23:04:23,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:24,841 INFO L130 PetriNetUnfolder]: 4745/7604 cut-off events. [2022-12-05 23:04:24,842 INFO L131 PetriNetUnfolder]: For 24497/25163 co-relation queries the response was YES. [2022-12-05 23:04:24,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31536 conditions, 7604 events. 4745/7604 cut-off events. For 24497/25163 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 49942 event pairs, 660 based on Foata normal form. 173/7598 useless extension candidates. Maximal degree in co-relation 31506. Up to 2955 conditions per place. [2022-12-05 23:04:24,867 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 22 changer transitions 40/180 dead transitions. [2022-12-05 23:04:24,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 180 transitions, 1773 flow [2022-12-05 23:04:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:04:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:04:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-05 23:04:24,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49609375 [2022-12-05 23:04:24,869 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 700 flow. Second operand 8 states and 127 transitions. [2022-12-05 23:04:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 180 transitions, 1773 flow [2022-12-05 23:04:24,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 180 transitions, 1735 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:25,002 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 654 flow [2022-12-05 23:04:25,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2022-12-05 23:04:25,004 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2022-12-05 23:04:25,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:25,004 INFO L89 Accepts]: Start accepts. Operand has 80 places, 72 transitions, 654 flow [2022-12-05 23:04:25,009 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:25,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:25,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 72 transitions, 654 flow [2022-12-05 23:04:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 72 transitions, 654 flow [2022-12-05 23:04:25,060 INFO L130 PetriNetUnfolder]: 335/827 cut-off events. [2022-12-05 23:04:25,061 INFO L131 PetriNetUnfolder]: For 2199/2280 co-relation queries the response was YES. [2022-12-05 23:04:25,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 827 events. 335/827 cut-off events. For 2199/2280 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5673 event pairs, 24 based on Foata normal form. 5/790 useless extension candidates. Maximal degree in co-relation 3335. Up to 249 conditions per place. [2022-12-05 23:04:25,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 72 transitions, 654 flow [2022-12-05 23:04:25,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 1052 [2022-12-05 23:04:25,499 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:25,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 496 [2022-12-05 23:04:25,500 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 594 flow [2022-12-05 23:04:25,500 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:04:25,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:25,500 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:04:25,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:04:25,500 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:04:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1480151072, now seen corresponding path program 1 times [2022-12-05 23:04:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:25,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398488330] [2022-12-05 23:04:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:25,666 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:04:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:25,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398488330] [2022-12-05 23:04:25,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398488330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:25,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:25,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883576633] [2022-12-05 23:04:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:25,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:25,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:25,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 23:04:25,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 594 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:04:25,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:25,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 23:04:25,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:26,057 INFO L130 PetriNetUnfolder]: 2880/4551 cut-off events. [2022-12-05 23:04:26,058 INFO L131 PetriNetUnfolder]: For 19299/19535 co-relation queries the response was YES. [2022-12-05 23:04:26,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20389 conditions, 4551 events. 2880/4551 cut-off events. For 19299/19535 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25998 event pairs, 427 based on Foata normal form. 46/4553 useless extension candidates. Maximal degree in co-relation 20353. Up to 2245 conditions per place. [2022-12-05 23:04:26,075 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 59 selfloop transitions, 1 changer transitions 53/125 dead transitions. [2022-12-05 23:04:26,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 1253 flow [2022-12-05 23:04:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 23:04:26,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5865384615384616 [2022-12-05 23:04:26,078 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 594 flow. Second operand 4 states and 61 transitions. [2022-12-05 23:04:26,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 1253 flow [2022-12-05 23:04:26,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 1112 flow, removed 28 selfloop flow, removed 11 redundant places. [2022-12-05 23:04:26,117 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 444 flow [2022-12-05 23:04:26,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2022-12-05 23:04:26,117 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-05 23:04:26,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:26,117 INFO L89 Accepts]: Start accepts. Operand has 69 places, 59 transitions, 444 flow [2022-12-05 23:04:26,118 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:26,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:26,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 59 transitions, 444 flow [2022-12-05 23:04:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 59 transitions, 444 flow [2022-12-05 23:04:26,157 INFO L130 PetriNetUnfolder]: 260/673 cut-off events. [2022-12-05 23:04:26,157 INFO L131 PetriNetUnfolder]: For 1915/2134 co-relation queries the response was YES. [2022-12-05 23:04:26,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 673 events. 260/673 cut-off events. For 1915/2134 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4521 event pairs, 18 based on Foata normal form. 29/657 useless extension candidates. Maximal degree in co-relation 2147. Up to 202 conditions per place. [2022-12-05 23:04:26,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 59 transitions, 444 flow [2022-12-05 23:04:26,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-05 23:04:26,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:26,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-05 23:04:26,260 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 454 flow [2022-12-05 23:04:26,260 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:04:26,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:26,260 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:04:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:04:26,260 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:04:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash -430935697, now seen corresponding path program 1 times [2022-12-05 23:04:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:26,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028124866] [2022-12-05 23:04:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:27,218 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:04:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:27,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028124866] [2022-12-05 23:04:27,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028124866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:27,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:27,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:04:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767887860] [2022-12-05 23:04:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:27,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:04:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:04:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:04:27,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 23:04:27,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 454 flow. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:04:27,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:27,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 23:04:27,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:27,785 INFO L130 PetriNetUnfolder]: 1961/3124 cut-off events. [2022-12-05 23:04:27,785 INFO L131 PetriNetUnfolder]: For 14768/14768 co-relation queries the response was YES. [2022-12-05 23:04:27,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13963 conditions, 3124 events. 1961/3124 cut-off events. For 14768/14768 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16199 event pairs, 187 based on Foata normal form. 1/3125 useless extension candidates. Maximal degree in co-relation 13934. Up to 1090 conditions per place. [2022-12-05 23:04:27,794 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 68 selfloop transitions, 19 changer transitions 78/165 dead transitions. [2022-12-05 23:04:27,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 165 transitions, 1449 flow [2022-12-05 23:04:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:04:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:04:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-05 23:04:27,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2022-12-05 23:04:27,795 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 454 flow. Second operand 8 states and 104 transitions. [2022-12-05 23:04:27,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 165 transitions, 1449 flow [2022-12-05 23:04:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 165 transitions, 1406 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:27,819 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 446 flow [2022-12-05 23:04:27,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=446, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2022-12-05 23:04:27,819 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2022-12-05 23:04:27,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:27,820 INFO L89 Accepts]: Start accepts. Operand has 73 places, 56 transitions, 446 flow [2022-12-05 23:04:27,820 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:27,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:27,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 56 transitions, 446 flow [2022-12-05 23:04:27,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 56 transitions, 446 flow [2022-12-05 23:04:27,844 INFO L130 PetriNetUnfolder]: 129/364 cut-off events. [2022-12-05 23:04:27,844 INFO L131 PetriNetUnfolder]: For 1090/1129 co-relation queries the response was YES. [2022-12-05 23:04:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 364 events. 129/364 cut-off events. For 1090/1129 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2139 event pairs, 6 based on Foata normal form. 24/376 useless extension candidates. Maximal degree in co-relation 1203. Up to 106 conditions per place. [2022-12-05 23:04:27,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 56 transitions, 446 flow [2022-12-05 23:04:27,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-05 23:04:27,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L766-->L773: Formula: (let ((.cse1 (not (= (mod v_~b$w_buff0_used~0_103 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_27 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_89 256) 0)) .cse2)) (.cse0 (and .cse5 .cse1))) (and (= (ite .cse0 0 v_~b$r_buff0_thd1~0_27) v_~b$r_buff0_thd1~0_26) (= v_~b$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~b$r_buff0_thd1~0_26 256) 0)) .cse1) (and (not (= (mod v_~b$w_buff1_used~0_88 256) 0)) .cse2)) 0 v_~b$r_buff1_thd1~0_18)) (= (ite .cse3 0 v_~b$w_buff0_used~0_104) v_~b$w_buff0_used~0_103) (= v_~b~0_50 (ite .cse3 v_~b$w_buff0~0_32 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_51))) (= v_~b$w_buff1_used~0_88 (ite (or .cse4 .cse0) 0 v_~b$w_buff1_used~0_89))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_27, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_89, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_32} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_26, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_88, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_32} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0] and [545] L876-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd0~0_167 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd0~0_175 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_506 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~b$w_buff0_used~0_507 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_436 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_95|) (= v_~b$r_buff0_thd0~0_174 (ite .cse0 0 v_~b$r_buff0_thd0~0_175)) (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_436) v_~b$w_buff1_used~0_435) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|) (= v_~b$w_buff0_used~0_506 (ite .cse2 0 v_~b$w_buff0_used~0_507)) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_95|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~b$r_buff1_thd0~0_166 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_435 256) 0)) .cse3) (and (not (= (mod v_~b$r_buff0_thd0~0_174 256) 0)) .cse4)) 0 v_~b$r_buff1_thd0~0_167)) (= (mod v_~main$tmp_guard1~0_88 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79| 0) (= (ite .cse2 v_~b$w_buff0~0_282 (ite .cse1 v_~b$w_buff1~0_237 v_~b~0_358)) v_~b~0_357) (= (ite (= (ite (= v_~__unbuffered_cnt~0_295 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_72 1) (= v_~z~0_101 2) (= 2 v_~x~0_100) (= 0 v_~__unbuffered_p3_EBX~0_86) (= v_~__unbuffered_p1_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_88)))) InVars {~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_167, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_507, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_436, ~b~0=v_~b~0_358, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_72, ~b$w_buff1~0=v_~b$w_buff1~0_237, ~b$w_buff0~0=v_~b$w_buff0~0_282, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_101, ~x~0=v_~x~0_100, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_175} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_77|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_63|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_506, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_435, ~b~0=v_~b~0_357, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_72, ~b$w_buff1~0=v_~b$w_buff1~0_237, ~b$w_buff0~0=v_~b$w_buff0~0_282, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_101, ~x~0=v_~x~0_100, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_174, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_95|} 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] [2022-12-05 23:04:28,212 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:28,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-05 23:04:28,213 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 467 flow [2022-12-05 23:04:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:04:28,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:28,213 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:04:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:04:28,213 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:04:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash -870739273, now seen corresponding path program 2 times [2022-12-05 23:04:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843764197] [2022-12-05 23:04:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:28,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:04:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:28,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:04:28,315 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:04:28,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:04:28,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:04:28,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:04:28,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:04:28,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:04:28,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:04:28,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:04:28,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:04:28,317 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:28,321 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:04:28,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:04:28,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:04:28 BasicIcfg [2022-12-05 23:04:28,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:04:28,383 INFO L158 Benchmark]: Toolchain (without parser) took 25531.95ms. Allocated memory was 255.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 211.9MB in the beginning and 1.1GB in the end (delta: -876.8MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-05 23:04:28,383 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 255.9MB. Free memory was 231.9MB in the beginning and 231.8MB in the end (delta: 77.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:04:28,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.50ms. Allocated memory is still 255.9MB. Free memory was 211.9MB in the beginning and 183.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:04:28,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.24ms. Allocated memory is still 255.9MB. Free memory was 183.6MB in the beginning and 181.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:04:28,384 INFO L158 Benchmark]: Boogie Preprocessor took 44.10ms. Allocated memory is still 255.9MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:04:28,384 INFO L158 Benchmark]: RCFGBuilder took 595.86ms. Allocated memory is still 255.9MB. Free memory was 178.9MB in the beginning and 140.1MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-05 23:04:28,384 INFO L158 Benchmark]: TraceAbstraction took 24394.05ms. Allocated memory was 255.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 139.0MB in the beginning and 1.1GB in the end (delta: -949.7MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-05 23:04:28,385 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.22ms. Allocated memory is still 255.9MB. Free memory was 231.9MB in the beginning and 231.8MB in the end (delta: 77.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 442.50ms. Allocated memory is still 255.9MB. Free memory was 211.9MB in the beginning and 183.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.24ms. Allocated memory is still 255.9MB. Free memory was 183.6MB in the beginning and 181.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.10ms. Allocated memory is still 255.9MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.86ms. Allocated memory is still 255.9MB. Free memory was 178.9MB in the beginning and 140.1MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24394.05ms. Allocated memory was 255.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 139.0MB in the beginning and 1.1GB in the end (delta: -949.7MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 139 PlacesBefore, 48 PlacesAfterwards, 128 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2432, independent: 2358, independent conditional: 2358, 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: 2432, independent: 2358, independent conditional: 0, independent unconditional: 2358, 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: 2432, independent: 2358, independent conditional: 0, independent unconditional: 2358, 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: 2432, independent: 2358, independent conditional: 0, independent unconditional: 2358, 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: 1965, independent: 1915, independent conditional: 0, independent unconditional: 1915, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1965, independent: 1890, independent conditional: 0, independent unconditional: 1890, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2432, independent: 443, independent conditional: 0, independent unconditional: 443, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1965, unknown conditional: 0, unknown unconditional: 1965] , Statistics on independence cache: Total cache size (in pairs): 2915, Positive cache size: 2865, Positive conditional cache size: 0, Positive unconditional cache size: 2865, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, 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: 182, independent: 152, independent conditional: 152, 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: 182, independent: 152, independent conditional: 20, independent unconditional: 132, 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: 182, independent: 152, independent conditional: 20, independent unconditional: 132, 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: 182, independent: 152, independent conditional: 20, independent unconditional: 132, 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: 168, independent: 143, independent conditional: 19, independent unconditional: 124, 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: 168, independent: 136, independent conditional: 0, independent unconditional: 136, 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: 72, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 67, dependent conditional: 39, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 168, unknown conditional: 29, unknown unconditional: 139] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 143, Positive conditional cache size: 19, Positive unconditional cache size: 124, 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, 35 TransitionsBefore, 35 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 115, independent conditional: 115, 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: 130, independent: 115, independent conditional: 17, independent unconditional: 98, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 115, independent conditional: 0, independent unconditional: 115, 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: 130, independent: 115, independent conditional: 0, independent unconditional: 115, 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: 26, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 26, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 163, Positive conditional cache size: 19, Positive unconditional cache size: 144, 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: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 122, independent conditional: 14, independent unconditional: 108, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 145, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 167, Positive conditional cache size: 19, Positive unconditional cache size: 148, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 209, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 209, independent: 178, independent conditional: 46, independent unconditional: 132, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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: 209, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 169, Positive conditional cache size: 19, Positive unconditional cache size: 150, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 387, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 387, independent: 323, independent conditional: 111, independent unconditional: 212, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 387, independent: 323, independent conditional: 50, independent unconditional: 273, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 387, independent: 323, independent conditional: 50, independent unconditional: 273, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 387, independent: 313, independent conditional: 43, independent unconditional: 270, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 179, Positive conditional cache size: 26, Positive unconditional cache size: 153, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 60 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 582, independent: 502, independent conditional: 502, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 582, independent: 502, independent conditional: 286, independent unconditional: 216, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 582, independent: 502, independent conditional: 228, independent unconditional: 274, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 582, independent: 502, independent conditional: 228, independent unconditional: 274, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 582, independent: 483, independent conditional: 209, independent unconditional: 274, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 205, Positive conditional cache size: 45, Positive unconditional cache size: 160, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 115, independent conditional: 7, independent unconditional: 108, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 115, independent conditional: 7, independent unconditional: 108, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 151, independent: 115, independent conditional: 7, independent unconditional: 108, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 205, Positive conditional cache size: 45, Positive unconditional cache size: 160, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 69 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 494, independent conditional: 494, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 494, independent conditional: 303, independent unconditional: 191, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 494, independent conditional: 174, independent unconditional: 320, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 494, independent conditional: 174, independent unconditional: 320, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 585, independent: 478, independent conditional: 160, independent unconditional: 318, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 17, unknown conditional: 14, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 229, Positive conditional cache size: 60, Positive unconditional cache size: 169, 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: 129, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 105, independent conditional: 84, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 105, independent conditional: 63, independent unconditional: 42, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 105, independent conditional: 63, independent unconditional: 42, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 104, independent conditional: 63, independent unconditional: 41, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 230, Positive conditional cache size: 60, Positive unconditional cache size: 170, 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: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 79 PlacesBefore, 75 PlacesAfterwards, 72 TransitionsBefore, 65 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 159, independent conditional: 107, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 159, independent conditional: 107, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 34, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, 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: 173, independent: 114, independent conditional: 73, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 45, unknown conditional: 34, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 277, Positive conditional cache size: 94, Positive unconditional cache size: 183, 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: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 67 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 155, independent conditional: 155, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 155, independent conditional: 110, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 155, independent conditional: 70, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 155, independent conditional: 70, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 148, independent conditional: 68, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 384, Positive conditional cache size: 136, Positive unconditional cache size: 248, 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: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 72 PlacesBefore, 72 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 40, 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: 46, independent: 40, independent conditional: 30, independent unconditional: 10, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 40, independent conditional: 30, independent unconditional: 10, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 30, independent unconditional: 10, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 7, independent unconditional: 3, 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: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 30, independent conditional: 23, independent unconditional: 7, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 431, Positive conditional cache size: 147, Positive unconditional cache size: 284, Negative cache size: 39, Negative conditional cache size: 12, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1161, ((void *)0), P0, ((void *)0))=-3, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1162, ((void *)0), P1, ((void *)0))=-2, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1163, ((void *)0), P2, ((void *)0))=-1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1164, ((void *)0), P3, ((void *)0))=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L802] 3 y = 1 [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __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=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, x=2, y=1, z=2] [L847] 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) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 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 [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 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_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=1, x=2, y=1, z=2] [L768] 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) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 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 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 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_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=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 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) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 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 [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 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_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=1, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 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) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 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 [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=1, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 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) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 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 [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 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 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 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: 24.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1596 IncrementalHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 32 mSDtfsCounter, 1596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=9, InterpolantAutomatonStates: 63, 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, 3.0s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 2114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:04:28,415 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...