/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:27:30,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:27:30,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:27:30,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:27:30,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:27:30,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:27:30,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:27:30,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:27:30,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:27:30,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:27:30,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:27:30,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:27:30,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:27:30,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:27:30,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:27:30,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:27:30,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:27:30,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:27:30,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:27:30,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:27:30,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:27:30,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:27:30,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:27:30,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:27:30,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:27:30,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:27:30,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:27:30,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:27:30,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:27:30,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:27:30,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:27:30,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:27:30,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:27:30,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:27:30,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:27:30,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:27:30,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:27:30,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:27:30,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:27:30,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:27:30,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:27:30,184 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:27:30,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:27:30,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:27:30,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:27:30,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:27:30,219 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:27:30,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:27:30,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:27:30,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:27:30,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:27:30,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:27:30,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:27:30,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:27:30,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:27:30,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:27:30,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:27:30,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:27:30,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:27:30,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:27:30,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:27:30,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:27:30,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:27:30,564 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:27:30,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2022-12-06 06:27:31,610 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:27:31,902 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:27:31,903 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2022-12-06 06:27:31,933 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ced21df/1c709d7e6ec340aca6c57bbda6b2e431/FLAGd0bd1aa79 [2022-12-06 06:27:31,952 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ced21df/1c709d7e6ec340aca6c57bbda6b2e431 [2022-12-06 06:27:31,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:27:31,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:27:31,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:27:31,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:27:31,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:27:31,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:27:31" (1/1) ... [2022-12-06 06:27:31,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c5d193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:31, skipping insertion in model container [2022-12-06 06:27:31,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:27:31" (1/1) ... [2022-12-06 06:27:31,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:27:32,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:27:32,208 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/mix043.oepc.i[945,958] [2022-12-06 06:27:32,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:27:32,478 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:27:32,490 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/mix043.oepc.i[945,958] [2022-12-06 06:27:32,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:27:32,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:27:32,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:27:32,610 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:27:32,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32 WrapperNode [2022-12-06 06:27:32,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:27:32,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:27:32,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:27:32,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:27:32,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,669 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 06:27:32,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:27:32,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:27:32,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:27:32,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:27:32,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,729 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:27:32,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:27:32,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:27:32,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:27:32,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (1/1) ... [2022-12-06 06:27:32,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:27:32,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:27:32,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:27:32,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:27:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:27:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:27:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:27:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:27:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:27:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:27:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:27:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:27:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:27:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:27:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:27:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:27:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:27:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:27:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:27:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:27:32,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:27:32,818 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:27:32,999 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:27:33,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:27:33,348 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:27:33,468 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:27:33,468 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:27:33,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:27:33 BoogieIcfgContainer [2022-12-06 06:27:33,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:27:33,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:27:33,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:27:33,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:27:33,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:27:31" (1/3) ... [2022-12-06 06:27:33,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24561b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:27:33, skipping insertion in model container [2022-12-06 06:27:33,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:27:32" (2/3) ... [2022-12-06 06:27:33,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24561b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:27:33, skipping insertion in model container [2022-12-06 06:27:33,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:27:33" (3/3) ... [2022-12-06 06:27:33,477 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2022-12-06 06:27:33,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:27:33,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:27:33,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:27:33,567 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:27:33,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:27:33,688 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:27:33,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:27:33,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:27:33,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:27:33,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-06 06:27:33,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:33,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:27:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-06 06:27:33,793 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:27:33,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:27:33,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:27:33,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:27:33,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-06 06:27:39,269 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 06:27:39,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:27:39,288 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;@706afaf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:27:39,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:27:39,291 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:27:39,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:27:39,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:39,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:27:39,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash 556268, now seen corresponding path program 1 times [2022-12-06 06:27:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:39,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007399273] [2022-12-06 06:27:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:39,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007399273] [2022-12-06 06:27:39,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007399273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:39,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:39,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:27:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177821835] [2022-12-06 06:27:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:39,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:27:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:27:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:27:39,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:27:39,673 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-06 06:27:39,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:39,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:27:39,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:40,834 INFO L130 PetriNetUnfolder]: 6050/8788 cut-off events. [2022-12-06 06:27:40,834 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 06:27:40,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17187 conditions, 8788 events. 6050/8788 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 52858 event pairs, 1106 based on Foata normal form. 0/8032 useless extension candidates. Maximal degree in co-relation 17175. Up to 6574 conditions per place. [2022-12-06 06:27:40,887 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 06:27:40,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 06:27:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:27:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:27:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 06:27:40,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:27:40,901 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 06:27:40,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 06:27:40,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:27:40,907 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:27:40,909 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-06 06:27:40,914 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:27:40,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:40,915 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:27:40,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:40,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:40,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:27:40,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:27:40,934 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:27:40,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:27:40,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:27:40,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:27:40,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:27:41,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:41,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 06:27:41,121 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:27:41,121 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-06 06:27:41,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:41,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:27:41,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -82390497, now seen corresponding path program 1 times [2022-12-06 06:27:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:41,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805581572] [2022-12-06 06:27:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:41,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805581572] [2022-12-06 06:27:41,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805581572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:41,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:41,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:27:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372726258] [2022-12-06 06:27:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:27:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:27:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:27:41,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:27:41,364 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-06 06:27:41,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:41,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:27:41,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:43,297 INFO L130 PetriNetUnfolder]: 14367/19536 cut-off events. [2022-12-06 06:27:43,297 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2022-12-06 06:27:43,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 100359 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2022-12-06 06:27:43,422 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-06 06:27:43,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2022-12-06 06:27:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:27:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:27:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:27:43,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 06:27:43,425 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:27:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2022-12-06 06:27:43,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:27:43,429 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 06:27:43,430 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-06 06:27:43,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:43,430 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:43,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:43,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,463 INFO L130 PetriNetUnfolder]: 126/352 cut-off events. [2022-12-06 06:27:43,464 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-06 06:27:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 352 events. 126/352 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2150 event pairs, 56 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 659. Up to 187 conditions per place. [2022-12-06 06:27:43,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 06:27:43,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:43,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 06:27:43,571 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2022-12-06 06:27:43,571 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-06 06:27:43,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:43,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:43,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:27:43,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1740862443, now seen corresponding path program 1 times [2022-12-06 06:27:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:43,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823076620] [2022-12-06 06:27:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:43,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823076620] [2022-12-06 06:27:43,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823076620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:43,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:43,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:27:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446243328] [2022-12-06 06:27:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:27:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:27:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:27:43,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:27:43,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:43,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:43,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:27:43,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:45,372 INFO L130 PetriNetUnfolder]: 13285/18086 cut-off events. [2022-12-06 06:27:45,372 INFO L131 PetriNetUnfolder]: For 5556/5556 co-relation queries the response was YES. [2022-12-06 06:27:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5556/5556 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 90121 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2022-12-06 06:27:45,469 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-06 06:27:45,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2022-12-06 06:27:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:27:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:27:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 06:27:45,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 06:27:45,471 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 58 transitions. [2022-12-06 06:27:45,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2022-12-06 06:27:45,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:27:45,517 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-06 06:27:45,518 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-06 06:27:45,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:45,518 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:45,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:45,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,542 INFO L130 PetriNetUnfolder]: 87/256 cut-off events. [2022-12-06 06:27:45,543 INFO L131 PetriNetUnfolder]: For 85/92 co-relation queries the response was YES. [2022-12-06 06:27:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 256 events. 87/256 cut-off events. For 85/92 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1342 event pairs, 25 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 554. Up to 134 conditions per place. [2022-12-06 06:27:45,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 06:27:45,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:45,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 06:27:45,576 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2022-12-06 06:27:45,576 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-06 06:27:45,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:45,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:45,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:27:45,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1863575379, now seen corresponding path program 1 times [2022-12-06 06:27:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:45,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386620965] [2022-12-06 06:27:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:45,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386620965] [2022-12-06 06:27:45,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386620965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:45,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:45,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:27:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508117258] [2022-12-06 06:27:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:45,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:27:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:27:45,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:27:45,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:27:45,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:45,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:45,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:27:45,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:46,733 INFO L130 PetriNetUnfolder]: 6120/9113 cut-off events. [2022-12-06 06:27:46,734 INFO L131 PetriNetUnfolder]: For 2474/2844 co-relation queries the response was YES. [2022-12-06 06:27:46,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21045 conditions, 9113 events. 6120/9113 cut-off events. For 2474/2844 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 53124 event pairs, 1336 based on Foata normal form. 309/9263 useless extension candidates. Maximal degree in co-relation 21030. Up to 7548 conditions per place. [2022-12-06 06:27:46,785 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-06 06:27:46,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 306 flow [2022-12-06 06:27:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:27:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:27:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 06:27:46,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:27:46,789 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 3 states and 56 transitions. [2022-12-06 06:27:46,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 306 flow [2022-12-06 06:27:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:27:46,795 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-06 06:27:46,796 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-06 06:27:46,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:46,796 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:46,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:46,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,885 INFO L130 PetriNetUnfolder]: 370/852 cut-off events. [2022-12-06 06:27:46,886 INFO L131 PetriNetUnfolder]: For 150/204 co-relation queries the response was YES. [2022-12-06 06:27:46,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 852 events. 370/852 cut-off events. For 150/204 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5949 event pairs, 154 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1795. Up to 449 conditions per place. [2022-12-06 06:27:46,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 06:27:46,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:46,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 06:27:46,912 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 182 flow [2022-12-06 06:27:46,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:46,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:46,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:27:46,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1785285851, now seen corresponding path program 1 times [2022-12-06 06:27:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:46,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818834574] [2022-12-06 06:27:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:47,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818834574] [2022-12-06 06:27:47,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818834574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:47,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:47,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:27:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337453628] [2022-12-06 06:27:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:47,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:27:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:27:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:27:47,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:27:47,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:47,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:47,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:27:47,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:47,758 INFO L130 PetriNetUnfolder]: 3251/5150 cut-off events. [2022-12-06 06:27:47,759 INFO L131 PetriNetUnfolder]: For 1552/1682 co-relation queries the response was YES. [2022-12-06 06:27:47,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13990 conditions, 5150 events. 3251/5150 cut-off events. For 1552/1682 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 29758 event pairs, 746 based on Foata normal form. 394/5461 useless extension candidates. Maximal degree in co-relation 13973. Up to 2179 conditions per place. [2022-12-06 06:27:47,795 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 57 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2022-12-06 06:27:47,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 428 flow [2022-12-06 06:27:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:27:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:27:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 06:27:47,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-06 06:27:47,797 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 182 flow. Second operand 4 states and 77 transitions. [2022-12-06 06:27:47,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 428 flow [2022-12-06 06:27:47,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:27:47,802 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 06:27:47,803 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-06 06:27:47,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:47,803 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:47,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:47,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,858 INFO L130 PetriNetUnfolder]: 216/562 cut-off events. [2022-12-06 06:27:47,858 INFO L131 PetriNetUnfolder]: For 240/376 co-relation queries the response was YES. [2022-12-06 06:27:47,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 562 events. 216/562 cut-off events. For 240/376 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3565 event pairs, 42 based on Foata normal form. 21/556 useless extension candidates. Maximal degree in co-relation 1532. Up to 302 conditions per place. [2022-12-06 06:27:47,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-06 06:27:47,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:47,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:27:47,871 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 229 flow [2022-12-06 06:27:47,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:47,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:47,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:47,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:27:47,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1972014937, now seen corresponding path program 1 times [2022-12-06 06:27:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:47,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009563410] [2022-12-06 06:27:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009563410] [2022-12-06 06:27:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009563410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:48,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:48,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:27:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746723150] [2022-12-06 06:27:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:27:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:48,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:27:48,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:27:48,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:27:48,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:48,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:48,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:27:48,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:49,593 INFO L130 PetriNetUnfolder]: 6504/10468 cut-off events. [2022-12-06 06:27:49,593 INFO L131 PetriNetUnfolder]: For 9751/10011 co-relation queries the response was YES. [2022-12-06 06:27:49,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32040 conditions, 10468 events. 6504/10468 cut-off events. For 9751/10011 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 70329 event pairs, 1553 based on Foata normal form. 71/10454 useless extension candidates. Maximal degree in co-relation 32021. Up to 3781 conditions per place. [2022-12-06 06:27:49,667 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 108 selfloop transitions, 15 changer transitions 32/166 dead transitions. [2022-12-06 06:27:49,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 166 transitions, 1117 flow [2022-12-06 06:27:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:27:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:27:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-06 06:27:49,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2022-12-06 06:27:49,671 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 229 flow. Second operand 7 states and 133 transitions. [2022-12-06 06:27:49,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 166 transitions, 1117 flow [2022-12-06 06:27:49,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 166 transitions, 1027 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-06 06:27:49,685 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:49,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-06 06:27:49,688 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-06 06:27:49,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:49,688 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:49,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:49,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:49,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:49,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:49,967 INFO L130 PetriNetUnfolder]: 1326/2908 cut-off events. [2022-12-06 06:27:49,967 INFO L131 PetriNetUnfolder]: For 3070/3865 co-relation queries the response was YES. [2022-12-06 06:27:49,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 2908 events. 1326/2908 cut-off events. For 3070/3865 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 24262 event pairs, 300 based on Foata normal form. 122/2782 useless extension candidates. Maximal degree in co-relation 9025. Up to 1301 conditions per place. [2022-12-06 06:27:49,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:49,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 1194 [2022-12-06 06:27:50,009 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:50,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-06 06:27:50,011 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 332 flow [2022-12-06 06:27:50,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:50,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:50,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:50,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:27:50,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1559817677, now seen corresponding path program 2 times [2022-12-06 06:27:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:50,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265884637] [2022-12-06 06:27:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265884637] [2022-12-06 06:27:50,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265884637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:50,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:50,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:27:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442031668] [2022-12-06 06:27:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:27:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:27:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:27:50,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:27:50,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:27:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:50,960 INFO L130 PetriNetUnfolder]: 4557/7355 cut-off events. [2022-12-06 06:27:50,960 INFO L131 PetriNetUnfolder]: For 12760/13151 co-relation queries the response was YES. [2022-12-06 06:27:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26394 conditions, 7355 events. 4557/7355 cut-off events. For 12760/13151 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 48037 event pairs, 704 based on Foata normal form. 468/7713 useless extension candidates. Maximal degree in co-relation 26371. Up to 2827 conditions per place. [2022-12-06 06:27:51,007 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 107 selfloop transitions, 13 changer transitions 8/139 dead transitions. [2022-12-06 06:27:51,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 1014 flow [2022-12-06 06:27:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:27:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:27:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-06 06:27:51,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-06 06:27:51,009 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 332 flow. Second operand 5 states and 96 transitions. [2022-12-06 06:27:51,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 1014 flow [2022-12-06 06:27:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 139 transitions, 1014 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:27:51,025 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 386 flow [2022-12-06 06:27:51,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2022-12-06 06:27:51,026 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2022-12-06 06:27:51,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:51,026 INFO L89 Accepts]: Start accepts. Operand has 63 places, 61 transitions, 386 flow [2022-12-06 06:27:51,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:51,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:51,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 61 transitions, 386 flow [2022-12-06 06:27:51,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 386 flow [2022-12-06 06:27:51,154 INFO L130 PetriNetUnfolder]: 738/1642 cut-off events. [2022-12-06 06:27:51,154 INFO L131 PetriNetUnfolder]: For 2573/3124 co-relation queries the response was YES. [2022-12-06 06:27:51,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1642 events. 738/1642 cut-off events. For 2573/3124 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12121 event pairs, 96 based on Foata normal form. 132/1637 useless extension candidates. Maximal degree in co-relation 5816. Up to 691 conditions per place. [2022-12-06 06:27:51,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 61 transitions, 386 flow [2022-12-06 06:27:51,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 06:27:51,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:27:51,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 06:27:51,303 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 392 flow [2022-12-06 06:27:51,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:51,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:51,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:51,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:27:51,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1762052333, now seen corresponding path program 1 times [2022-12-06 06:27:51,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720915725] [2022-12-06 06:27:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:51,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720915725] [2022-12-06 06:27:51,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720915725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:51,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:51,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:27:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645723874] [2022-12-06 06:27:51,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:51,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:27:51,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:27:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:27:51,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:27:51,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:51,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:51,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:27:51,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:52,586 INFO L130 PetriNetUnfolder]: 6721/10797 cut-off events. [2022-12-06 06:27:52,587 INFO L131 PetriNetUnfolder]: For 25640/26284 co-relation queries the response was YES. [2022-12-06 06:27:52,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42687 conditions, 10797 events. 6721/10797 cut-off events. For 25640/26284 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 72930 event pairs, 1358 based on Foata normal form. 126/10806 useless extension candidates. Maximal degree in co-relation 42661. Up to 4683 conditions per place. [2022-12-06 06:27:52,673 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 89 selfloop transitions, 2 changer transitions 42/141 dead transitions. [2022-12-06 06:27:52,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 141 transitions, 1174 flow [2022-12-06 06:27:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:27:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:27:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 06:27:52,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2022-12-06 06:27:52,676 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 392 flow. Second operand 4 states and 75 transitions. [2022-12-06 06:27:52,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 141 transitions, 1174 flow [2022-12-06 06:27:52,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 1080 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 06:27:52,904 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:52,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2022-12-06 06:27:52,905 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-06 06:27:52,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:52,905 INFO L89 Accepts]: Start accepts. Operand has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:52,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:52,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:52,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:52,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:53,070 INFO L130 PetriNetUnfolder]: 1121/2528 cut-off events. [2022-12-06 06:27:53,071 INFO L131 PetriNetUnfolder]: For 3213/3838 co-relation queries the response was YES. [2022-12-06 06:27:53,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7975 conditions, 2528 events. 1121/2528 cut-off events. For 3213/3838 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20958 event pairs, 176 based on Foata normal form. 231/2566 useless extension candidates. Maximal degree in co-relation 7952. Up to 856 conditions per place. [2022-12-06 06:27:53,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:53,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 1050 [2022-12-06 06:27:53,098 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:27:53,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 06:27:53,099 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 375 flow [2022-12-06 06:27:53,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:53,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:53,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:53,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:27:53,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -417478574, now seen corresponding path program 1 times [2022-12-06 06:27:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:53,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171299012] [2022-12-06 06:27:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171299012] [2022-12-06 06:27:54,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171299012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:54,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:54,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:27:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036483099] [2022-12-06 06:27:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:54,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:27:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:54,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:27:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:27:54,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:27:54,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 375 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-06 06:27:54,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:54,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:27:54,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:55,196 INFO L130 PetriNetUnfolder]: 6883/11337 cut-off events. [2022-12-06 06:27:55,196 INFO L131 PetriNetUnfolder]: For 23112/24271 co-relation queries the response was YES. [2022-12-06 06:27:55,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43268 conditions, 11337 events. 6883/11337 cut-off events. For 23112/24271 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 80260 event pairs, 1126 based on Foata normal form. 596/11806 useless extension candidates. Maximal degree in co-relation 43242. Up to 4625 conditions per place. [2022-12-06 06:27:55,267 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 125 selfloop transitions, 11 changer transitions 22/170 dead transitions. [2022-12-06 06:27:55,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 170 transitions, 1297 flow [2022-12-06 06:27:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:27:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:27:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-06 06:27:55,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-06 06:27:55,269 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 375 flow. Second operand 6 states and 118 transitions. [2022-12-06 06:27:55,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 170 transitions, 1297 flow [2022-12-06 06:27:55,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 170 transitions, 1292 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:27:55,599 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 459 flow [2022-12-06 06:27:55,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2022-12-06 06:27:55,600 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-06 06:27:55,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:55,600 INFO L89 Accepts]: Start accepts. Operand has 69 places, 67 transitions, 459 flow [2022-12-06 06:27:55,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:55,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:55,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 459 flow [2022-12-06 06:27:55,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 459 flow [2022-12-06 06:27:55,818 INFO L130 PetriNetUnfolder]: 1375/3227 cut-off events. [2022-12-06 06:27:55,818 INFO L131 PetriNetUnfolder]: For 6062/7315 co-relation queries the response was YES. [2022-12-06 06:27:55,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11081 conditions, 3227 events. 1375/3227 cut-off events. For 6062/7315 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 28692 event pairs, 180 based on Foata normal form. 343/3339 useless extension candidates. Maximal degree in co-relation 11054. Up to 1176 conditions per place. [2022-12-06 06:27:55,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 67 transitions, 459 flow [2022-12-06 06:27:55,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 1142 [2022-12-06 06:27:55,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:27:55,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 06:27:55,978 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 465 flow [2022-12-06 06:27:55,979 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-06 06:27:55,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:55,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:55,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:27:55,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 796822846, now seen corresponding path program 2 times [2022-12-06 06:27:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847648073] [2022-12-06 06:27:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:56,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847648073] [2022-12-06 06:27:56,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847648073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:56,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:56,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:27:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781509112] [2022-12-06 06:27:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:56,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:27:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:56,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:27:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:27:56,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:27:56,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:56,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:56,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:27:56,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:57,294 INFO L130 PetriNetUnfolder]: 6447/10436 cut-off events. [2022-12-06 06:27:57,294 INFO L131 PetriNetUnfolder]: For 30178/30838 co-relation queries the response was YES. [2022-12-06 06:27:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42552 conditions, 10436 events. 6447/10436 cut-off events. For 30178/30838 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 73810 event pairs, 883 based on Foata normal form. 314/10562 useless extension candidates. Maximal degree in co-relation 42522. Up to 4147 conditions per place. [2022-12-06 06:27:57,367 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 98 selfloop transitions, 17 changer transitions 19/145 dead transitions. [2022-12-06 06:27:57,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 145 transitions, 1233 flow [2022-12-06 06:27:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:27:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:27:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 06:27:57,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:27:57,369 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 465 flow. Second operand 6 states and 102 transitions. [2022-12-06 06:27:57,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 145 transitions, 1233 flow [2022-12-06 06:27:57,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 145 transitions, 1178 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 06:27:57,980 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 425 flow [2022-12-06 06:27:57,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2022-12-06 06:27:57,981 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2022-12-06 06:27:57,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:57,981 INFO L89 Accepts]: Start accepts. Operand has 72 places, 62 transitions, 425 flow [2022-12-06 06:27:57,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:57,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:57,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 62 transitions, 425 flow [2022-12-06 06:27:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 62 transitions, 425 flow [2022-12-06 06:27:58,076 INFO L130 PetriNetUnfolder]: 624/1420 cut-off events. [2022-12-06 06:27:58,076 INFO L131 PetriNetUnfolder]: For 2849/3263 co-relation queries the response was YES. [2022-12-06 06:27:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 1420 events. 624/1420 cut-off events. For 2849/3263 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10573 event pairs, 55 based on Foata normal form. 43/1351 useless extension candidates. Maximal degree in co-relation 5378. Up to 452 conditions per place. [2022-12-06 06:27:58,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 62 transitions, 425 flow [2022-12-06 06:27:58,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 06:27:58,468 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:27:58,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-06 06:27:58,469 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 423 flow [2022-12-06 06:27:58,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:58,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:58,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:58,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:27:58,470 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-06 06:27:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -61051280, now seen corresponding path program 1 times [2022-12-06 06:27:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:58,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484968103] [2022-12-06 06:27:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484968103] [2022-12-06 06:27:58,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484968103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:58,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:27:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216258010] [2022-12-06 06:27:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:27:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:27:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:27:58,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:27:58,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 423 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:58,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:58,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:27:58,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:59,559 INFO L130 PetriNetUnfolder]: 5316/8294 cut-off events. [2022-12-06 06:27:59,559 INFO L131 PetriNetUnfolder]: For 27975/27975 co-relation queries the response was YES. [2022-12-06 06:27:59,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37538 conditions, 8294 events. 5316/8294 cut-off events. For 27975/27975 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 50004 event pairs, 1337 based on Foata normal form. 3/8297 useless extension candidates. Maximal degree in co-relation 37508. Up to 4904 conditions per place. [2022-12-06 06:27:59,596 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 74 selfloop transitions, 6 changer transitions 30/110 dead transitions. [2022-12-06 06:27:59,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 110 transitions, 976 flow [2022-12-06 06:27:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:27:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:27:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 06:27:59,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 06:27:59,599 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 423 flow. Second operand 4 states and 56 transitions. [2022-12-06 06:27:59,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 110 transitions, 976 flow [2022-12-06 06:27:59,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 866 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 06:27:59,795 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 339 flow [2022-12-06 06:27:59,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-12-06 06:27:59,796 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-06 06:27:59,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:59,796 INFO L89 Accepts]: Start accepts. Operand has 65 places, 54 transitions, 339 flow [2022-12-06 06:27:59,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:59,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:59,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 54 transitions, 339 flow [2022-12-06 06:27:59,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 339 flow [2022-12-06 06:27:59,840 INFO L130 PetriNetUnfolder]: 288/653 cut-off events. [2022-12-06 06:27:59,840 INFO L131 PetriNetUnfolder]: For 1088/1537 co-relation queries the response was YES. [2022-12-06 06:27:59,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 653 events. 288/653 cut-off events. For 1088/1537 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3983 event pairs, 30 based on Foata normal form. 66/667 useless extension candidates. Maximal degree in co-relation 2086. Up to 198 conditions per place. [2022-12-06 06:27:59,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 339 flow [2022-12-06 06:27:59,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 06:27:59,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:27:59,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 06:27:59,946 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 344 flow [2022-12-06 06:27:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:59,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:59,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:59,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:27:59,947 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-06 06:27:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2027107098, now seen corresponding path program 1 times [2022-12-06 06:27:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290519944] [2022-12-06 06:27:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:28:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:00,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290519944] [2022-12-06 06:28:00,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290519944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:00,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785341778] [2022-12-06 06:28:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:00,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:28:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:28:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:28:00,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:00,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:00,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:00,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:00,561 INFO L130 PetriNetUnfolder]: 2512/4068 cut-off events. [2022-12-06 06:28:00,561 INFO L131 PetriNetUnfolder]: For 10000/10139 co-relation queries the response was YES. [2022-12-06 06:28:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16732 conditions, 4068 events. 2512/4068 cut-off events. For 10000/10139 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23243 event pairs, 429 based on Foata normal form. 17/4058 useless extension candidates. Maximal degree in co-relation 16703. Up to 2309 conditions per place. [2022-12-06 06:28:00,578 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 47 selfloop transitions, 1 changer transitions 55/105 dead transitions. [2022-12-06 06:28:00,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 857 flow [2022-12-06 06:28:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:28:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:28:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:28:00,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2022-12-06 06:28:00,579 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 344 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:28:00,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 857 flow [2022-12-06 06:28:00,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 837 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 06:28:00,622 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 259 flow [2022-12-06 06:28:00,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2022-12-06 06:28:00,623 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2022-12-06 06:28:00,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:00,623 INFO L89 Accepts]: Start accepts. Operand has 66 places, 42 transitions, 259 flow [2022-12-06 06:28:00,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:00,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:00,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 42 transitions, 259 flow [2022-12-06 06:28:00,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 42 transitions, 259 flow [2022-12-06 06:28:00,639 INFO L130 PetriNetUnfolder]: 80/200 cut-off events. [2022-12-06 06:28:00,639 INFO L131 PetriNetUnfolder]: For 419/498 co-relation queries the response was YES. [2022-12-06 06:28:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 200 events. 80/200 cut-off events. For 419/498 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 868 event pairs, 8 based on Foata normal form. 15/201 useless extension candidates. Maximal degree in co-relation 625. Up to 65 conditions per place. [2022-12-06 06:28:00,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 42 transitions, 259 flow [2022-12-06 06:28:00,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 06:28:00,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] $Ultimate##0-->L768: Formula: (and (= |v_P0Thread1of1ForFork1_~arg#1.offset_57| |v_P0Thread1of1ForFork1_#in~arg#1.offset_57|) (= v_~b$r_buff0_thd1~0_174 1) (= v_~x~0_55 v_~__unbuffered_p0_EAX~0_80) (= v_~b$r_buff0_thd2~0_159 v_~b$r_buff1_thd2~0_163) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|) (= v_~b$w_buff0_used~0_473 1) (= |v_P0Thread1of1ForFork1_~arg#1.base_57| |v_P0Thread1of1ForFork1_#in~arg#1.base_57|) (= v_~b$r_buff0_thd0~0_141 v_~b$r_buff1_thd0~0_140) (= v_~b$w_buff0~0_264 1) (= v_~b$w_buff0_used~0_474 v_~b$w_buff1_used~0_402) (= v_~b$w_buff1~0_219 v_~b$w_buff0~0_265) (= (ite (not (and (not (= (mod v_~b$w_buff0_used~0_473 256) 0)) (not (= (mod v_~b$w_buff1_used~0_402 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|) (= v_~b$r_buff0_thd1~0_175 v_~b$r_buff1_thd1~0_109) (= v_~b$r_buff0_thd3~0_125 v_~b$r_buff1_thd3~0_126) (= v_~b$r_buff0_thd4~0_181 v_~b$r_buff1_thd4~0_189)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_474, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_175, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_159, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_125, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_57|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_57|, ~b$w_buff0~0=v_~b$w_buff0~0_265, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_181, ~x~0=v_~x~0_55, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_141} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_174, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_159, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_125, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_109, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_140, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_57|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_57|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_57|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_57|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_473, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_402, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_189, ~b$w_buff1~0=v_~b$w_buff1~0_219, ~b$w_buff0~0=v_~b$w_buff0~0_264, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_59|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_181, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_163, ~x~0=v_~x~0_55, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_126, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_141} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [544] $Ultimate##0-->L795: Formula: (let ((.cse1 (not (= (mod v_~b$r_buff1_thd2~0_166 256) 0))) (.cse2 (not (= 0 (mod v_~b$w_buff0_used~0_477 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_162 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_478 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_405 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~b$r_buff0_thd2~0_162) v_~b$r_buff0_thd2~0_161) (= v_~y~0_46 v_~__unbuffered_p1_EAX~0_86) (= (ite (or (and (not (= (mod v_~b$w_buff1_used~0_404 256) 0)) .cse1) (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_161 256) 0)))) 0 v_~b$r_buff1_thd2~0_166) v_~b$r_buff1_thd2~0_165) (= v_~b~0_336 (ite .cse3 v_~b$w_buff0~0_268 (ite .cse4 v_~b$w_buff1~0_221 v_~b~0_337))) (= |v_P1Thread1of1ForFork3_#in~arg.offset_21| v_P1Thread1of1ForFork3_~arg.offset_21) (= |v_P1Thread1of1ForFork3_#in~arg.base_21| v_P1Thread1of1ForFork3_~arg.base_21) (= v_~x~0_57 1) (= (ite .cse3 0 v_~b$w_buff0_used~0_478) v_~b$w_buff0_used~0_477) (= (ite (or .cse0 .cse4) 0 v_~b$w_buff1_used~0_405) v_~b$w_buff1_used~0_404)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_478, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_162, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_405, ~b~0=v_~b~0_337, ~b$w_buff1~0=v_~b$w_buff1~0_221, ~b$w_buff0~0=v_~b$w_buff0~0_268, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_166, ~y~0=v_~y~0_46} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_161, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_477, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_21, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_86, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_404, ~b~0=v_~b~0_336, ~b$w_buff1~0=v_~b$w_buff1~0_221, ~b$w_buff0~0=v_~b$w_buff0~0_268, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_165, ~y~0=v_~y~0_46, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[~b$w_buff0_used~0, P1Thread1of1ForFork3_~arg.offset, ~b$r_buff0_thd2~0, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0, ~x~0] [2022-12-06 06:28:01,566 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:28:01,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 944 [2022-12-06 06:28:01,567 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 272 flow [2022-12-06 06:28:01,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:01,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:01,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:01,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:28:01,567 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-06 06:28:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1184299349, now seen corresponding path program 1 times [2022-12-06 06:28:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:01,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124234814] [2022-12-06 06:28:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:28:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124234814] [2022-12-06 06:28:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124234814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:02,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:02,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:28:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963513347] [2022-12-06 06:28:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:02,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:28:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:28:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:28:02,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:28:02,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 272 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:02,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:02,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:28:02,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:02,480 INFO L130 PetriNetUnfolder]: 640/1088 cut-off events. [2022-12-06 06:28:02,480 INFO L131 PetriNetUnfolder]: For 2923/2923 co-relation queries the response was YES. [2022-12-06 06:28:02,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 1088 events. 640/1088 cut-off events. For 2923/2923 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5226 event pairs, 46 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 4541. Up to 438 conditions per place. [2022-12-06 06:28:02,484 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 72 selfloop transitions, 7 changer transitions 40/119 dead transitions. [2022-12-06 06:28:02,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 968 flow [2022-12-06 06:28:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:28:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:28:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 06:28:02,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 06:28:02,485 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 272 flow. Second operand 7 states and 64 transitions. [2022-12-06 06:28:02,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 968 flow [2022-12-06 06:28:02,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 119 transitions, 892 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-06 06:28:02,493 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 274 flow [2022-12-06 06:28:02,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2022-12-06 06:28:02,493 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-06 06:28:02,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:02,493 INFO L89 Accepts]: Start accepts. Operand has 58 places, 41 transitions, 274 flow [2022-12-06 06:28:02,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:02,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:02,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 41 transitions, 274 flow [2022-12-06 06:28:02,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 41 transitions, 274 flow [2022-12-06 06:28:02,509 INFO L130 PetriNetUnfolder]: 92/221 cut-off events. [2022-12-06 06:28:02,509 INFO L131 PetriNetUnfolder]: For 427/472 co-relation queries the response was YES. [2022-12-06 06:28:02,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 221 events. 92/221 cut-off events. For 427/472 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1041 event pairs, 5 based on Foata normal form. 15/223 useless extension candidates. Maximal degree in co-relation 705. Up to 76 conditions per place. [2022-12-06 06:28:02,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 274 flow [2022-12-06 06:28:02,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:28:02,533 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:02,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 06:28:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 274 flow [2022-12-06 06:28:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:02,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:02,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:28:02,534 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1308912106, now seen corresponding path program 1 times [2022-12-06 06:28:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:02,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143163404] [2022-12-06 06:28:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:28:02,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:28:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:28:02,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:28:02,661 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:28:02,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:28:02,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:28:02,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:28:02,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:28:02,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:28:02,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:28:02,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:28:02,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:28:02,665 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:02,670 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:28:02,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:28:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:28:02 BasicIcfg [2022-12-06 06:28:02,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:28:02,737 INFO L158 Benchmark]: Toolchain (without parser) took 30781.39ms. Allocated memory was 209.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 184.0MB in the beginning and 568.5MB in the end (delta: -384.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 06:28:02,737 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory was 186.8MB in the beginning and 186.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:28:02,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.84ms. Allocated memory is still 209.7MB. Free memory was 183.5MB in the beginning and 155.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:28:02,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.12ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 152.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:02,738 INFO L158 Benchmark]: Boogie Preprocessor took 64.16ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:02,738 INFO L158 Benchmark]: RCFGBuilder took 735.37ms. Allocated memory is still 209.7MB. Free memory was 150.5MB in the beginning and 112.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:28:02,738 INFO L158 Benchmark]: TraceAbstraction took 29264.36ms. Allocated memory was 209.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 112.2MB in the beginning and 568.5MB in the end (delta: -456.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 06:28:02,739 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.13ms. Allocated memory is still 209.7MB. Free memory was 186.8MB in the beginning and 186.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 654.84ms. Allocated memory is still 209.7MB. Free memory was 183.5MB in the beginning and 155.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.12ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 152.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.16ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 735.37ms. Allocated memory is still 209.7MB. Free memory was 150.5MB in the beginning and 112.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 29264.36ms. Allocated memory was 209.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 112.2MB in the beginning and 568.5MB in the end (delta: -456.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 140 PlacesBefore, 48 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2609, independent: 2535, independent conditional: 2535, 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: 2609, independent: 2535, independent conditional: 0, independent unconditional: 2535, 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: 2609, independent: 2535, independent conditional: 0, independent unconditional: 2535, 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: 2609, independent: 2535, independent conditional: 0, independent unconditional: 2535, 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: 2105, independent: 2056, independent conditional: 0, independent unconditional: 2056, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2105, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2609, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 2105, unknown conditional: 0, unknown unconditional: 2105] , Statistics on independence cache: Total cache size (in pairs): 3058, Positive cache size: 3009, Positive conditional cache size: 0, Positive unconditional cache size: 3009, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 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: 179, independent: 149, independent conditional: 149, 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: 179, independent: 149, independent conditional: 20, independent unconditional: 129, 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: 179, independent: 149, independent conditional: 20, independent unconditional: 129, 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: 179, independent: 149, independent conditional: 20, independent unconditional: 129, 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: 166, independent: 141, independent conditional: 19, independent unconditional: 122, 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: 166, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 170, dependent conditional: 65, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 166, unknown conditional: 29, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 141, Positive conditional cache size: 19, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 105, independent conditional: 15, independent unconditional: 90, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 158, Positive conditional cache size: 19, Positive unconditional cache size: 139, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, 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, 37 TransitionsBefore, 37 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 119, independent conditional: 13, independent unconditional: 106, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 8, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 85, independent conditional: 3, independent unconditional: 82, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 85, independent conditional: 3, independent unconditional: 82, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 85, independent conditional: 3, independent unconditional: 82, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 82, independent conditional: 3, independent unconditional: 79, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 788 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 29, dependent conditional: 0, dependent unconditional: 29, 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: 104, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 166, Positive conditional cache size: 19, Positive unconditional cache size: 147, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, 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.0s, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, 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: 24, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 166, Positive conditional cache size: 19, Positive unconditional cache size: 147, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, 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, 61 PlacesBefore, 61 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 27, independent unconditional: 26, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 53, independent conditional: 24, independent unconditional: 29, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 24, independent unconditional: 29, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 65, independent: 46, independent conditional: 23, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 176, Positive conditional cache size: 20, Positive unconditional cache size: 156, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1050 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 15, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 176, Positive conditional cache size: 20, Positive unconditional cache size: 156, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, 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, 69 PlacesBefore, 69 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 48, independent conditional: 48, 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: 54, independent: 48, independent conditional: 23, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 48, independent conditional: 21, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 48, independent conditional: 21, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 48, independent conditional: 21, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 179, Positive conditional cache size: 20, Positive unconditional cache size: 159, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 70 PlacesBefore, 67 PlacesAfterwards, 62 TransitionsBefore, 59 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 111, independent conditional: 111, 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: 117, independent: 111, independent conditional: 63, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 111, independent conditional: 60, independent unconditional: 51, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 111, independent conditional: 60, independent unconditional: 51, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 117, independent: 100, independent conditional: 58, independent unconditional: 42, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 243, Positive conditional cache size: 28, Positive unconditional cache size: 215, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 36, independent conditional: 31, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 31, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 30, independent conditional: 27, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 258, Positive conditional cache size: 32, Positive unconditional cache size: 226, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 63 PlacesBefore, 60 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 129, independent conditional: 129, 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: 144, independent: 129, independent conditional: 123, independent unconditional: 6, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 129, independent conditional: 75, independent unconditional: 54, 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: 144, independent: 129, independent conditional: 75, independent unconditional: 54, 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: 21, independent: 19, independent conditional: 11, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 110, independent conditional: 64, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 21, unknown conditional: 11, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 330, Positive conditional cache size: 45, Positive unconditional cache size: 285, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 337, Positive conditional cache size: 52, Positive unconditional cache size: 285, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1129, ((void *)0), P0, ((void *)0))=-2, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1130, ((void *)0), P1, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1131, ((void *)0), P2, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1132, ((void *)0), P3, ((void *)0))=1, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L784] 2 x = 1 [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, z=0] [L804] 3 y = 1 [L807] 3 z = 1 [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 15 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=9, InterpolantAutomatonStates: 60, 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.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:28:02,762 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...