/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:06:47,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:06:47,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:06:47,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:06:47,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:06:47,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:06:47,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:06:47,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:06:47,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:06:47,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:06:47,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:06:47,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:06:47,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:06:47,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:06:47,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:06:47,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:06:47,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:06:47,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:06:47,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:06:47,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:06:47,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:06:47,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:06:47,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:06:47,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:06:47,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:06:47,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:06:47,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:06:47,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:06:47,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:06:47,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:06:47,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:06:47,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:06:47,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:06:47,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:06:47,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:06:47,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:06:47,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:06:47,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:06:47,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:06:47,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:06:47,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:06:47,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:06:47,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:06:47,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:06:47,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:06:47,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:06:47,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:06:47,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:06:47,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:47,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:06:47,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:06:47,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:06:47,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:06:47,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:06:47,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:06:47,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:06:47,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:06:47,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:06:47,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:06:47,586 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:06:47,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-06 04:06:48,764 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:06:49,008 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:06:49,008 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-06 04:06:49,022 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a06912ab/b4fa185d6abb43b0bd877d10f287b0fa/FLAG67d8263a2 [2022-12-06 04:06:49,034 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a06912ab/b4fa185d6abb43b0bd877d10f287b0fa [2022-12-06 04:06:49,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:06:49,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:06:49,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:49,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:06:49,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:06:49,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189b69de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49, skipping insertion in model container [2022-12-06 04:06:49,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:06:49,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:06:49,236 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/mix002.opt.i[944,957] [2022-12-06 04:06:49,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:49,470 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:06:49,482 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/mix002.opt.i[944,957] [2022-12-06 04:06:49,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:49,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:49,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:49,585 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:06:49,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49 WrapperNode [2022-12-06 04:06:49,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:49,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:49,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:06:49,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:06:49,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,654 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-06 04:06:49,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:49,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:06:49,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:06:49,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:06:49,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,687 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:06:49,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:06:49,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:06:49,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:06:49,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (1/1) ... [2022-12-06 04:06:49,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:49,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:06:49,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:06:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:06:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:06:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:06:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:06:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:06:49,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:06:49,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:06:49,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:06:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:06:49,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:06:49,749 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:06:49,864 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:06:49,866 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:50,246 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:50,378 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:50,378 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:06:50,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:50 BoogieIcfgContainer [2022-12-06 04:06:50,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:50,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:50,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:50,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:50,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:06:49" (1/3) ... [2022-12-06 04:06:50,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7067da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:50, skipping insertion in model container [2022-12-06 04:06:50,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:49" (2/3) ... [2022-12-06 04:06:50,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7067da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:50, skipping insertion in model container [2022-12-06 04:06:50,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:50" (3/3) ... [2022-12-06 04:06:50,391 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-12-06 04:06:50,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:50,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:06:50,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:50,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:06:50,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-06 04:06:50,570 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-06 04:06:50,570 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:50,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 04:06:50,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-06 04:06:50,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-06 04:06:50,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:50,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-06 04:06:50,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-06 04:06:50,651 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-06 04:06:50,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:50,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 04:06:50,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-06 04:06:50,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-06 04:06:55,331 INFO L203 LiptonReduction]: Total number of compositions: 88 [2022-12-06 04:06:55,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:55,359 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;@11487649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:55,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:06:55,373 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-06 04:06:55,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:55,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:55,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:55,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1709377215, now seen corresponding path program 1 times [2022-12-06 04:06:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:55,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598032445] [2022-12-06 04:06:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:55,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598032445] [2022-12-06 04:06:55,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598032445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:55,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:55,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:06:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145022069] [2022-12-06 04:06:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:55,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:55,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:06:55,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 04:06:55,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:55,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:06:55,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:56,101 INFO L130 PetriNetUnfolder]: 777/1250 cut-off events. [2022-12-06 04:06:56,102 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:06:56,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1250 events. 777/1250 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6581 event pairs, 129 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 2444. Up to 937 conditions per place. [2022-12-06 04:06:56,114 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 24 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2022-12-06 04:06:56,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 137 flow [2022-12-06 04:06:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 04:06:56,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-06 04:06:56,127 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 47 transitions. [2022-12-06 04:06:56,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 137 flow [2022-12-06 04:06:56,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:56,134 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-06 04:06:56,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:06:56,138 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:06:56,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:56,139 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 54 flow [2022-12-06 04:06:56,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:56,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:56,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 54 flow [2022-12-06 04:06:56,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 04:06:56,150 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:06:56,150 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:56,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:06:56,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 04:06:56,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 04:06:56,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:56,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 04:06:56,261 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 04:06:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 04:06:56,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:56,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:56,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:56,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2034012140, now seen corresponding path program 1 times [2022-12-06 04:06:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:56,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066516184] [2022-12-06 04:06:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066516184] [2022-12-06 04:06:56,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066516184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:56,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:56,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:06:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203334462] [2022-12-06 04:06:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:56,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:56,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:06:56,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:56,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:06:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:56,612 INFO L130 PetriNetUnfolder]: 580/909 cut-off events. [2022-12-06 04:06:56,612 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:06:56,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 909 events. 580/909 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4215 event pairs, 196 based on Foata normal form. 30/936 useless extension candidates. Maximal degree in co-relation 1882. Up to 613 conditions per place. [2022-12-06 04:06:56,617 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:06:56,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 136 flow [2022-12-06 04:06:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:06:56,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 04:06:56,620 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:06:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 136 flow [2022-12-06 04:06:56,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:56,622 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-06 04:06:56,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 04:06:56,622 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-06 04:06:56,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:56,623 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 04:06:56,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:56,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:56,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 04:06:56,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 04:06:56,627 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:06:56,627 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:56,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:06:56,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 04:06:56,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 04:06:56,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:56,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 04:06:56,683 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 04:06:56,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:56,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:56,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:56,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1464992352, now seen corresponding path program 1 times [2022-12-06 04:06:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:56,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166815074] [2022-12-06 04:06:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166815074] [2022-12-06 04:06:56,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166815074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:56,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:56,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454430638] [2022-12-06 04:06:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:56,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:06:56,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:56,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:06:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:57,044 INFO L130 PetriNetUnfolder]: 926/1391 cut-off events. [2022-12-06 04:06:57,045 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-12-06 04:06:57,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1391 events. 926/1391 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5807 event pairs, 311 based on Foata normal form. 36/1427 useless extension candidates. Maximal degree in co-relation 3082. Up to 952 conditions per place. [2022-12-06 04:06:57,053 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 04:06:57,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 161 flow [2022-12-06 04:06:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:06:57,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:06:57,055 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:06:57,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 161 flow [2022-12-06 04:06:57,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:57,057 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2022-12-06 04:06:57,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:06:57,058 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-06 04:06:57,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:57,058 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 04:06:57,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:57,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:57,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 04:06:57,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 04:06:57,064 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:06:57,064 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:57,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:06:57,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 04:06:57,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 04:06:57,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:57,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 04:06:57,133 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2022-12-06 04:06:57,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:57,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:57,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:06:57,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2105396407, now seen corresponding path program 1 times [2022-12-06 04:06:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554344414] [2022-12-06 04:06:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:57,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554344414] [2022-12-06 04:06:57,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554344414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54787165] [2022-12-06 04:06:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:57,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:57,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:06:57,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:06:57,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:57,425 INFO L130 PetriNetUnfolder]: 706/1071 cut-off events. [2022-12-06 04:06:57,426 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 04:06:57,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 1071 events. 706/1071 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3910 event pairs, 242 based on Foata normal form. 18/1089 useless extension candidates. Maximal degree in co-relation 2494. Up to 720 conditions per place. [2022-12-06 04:06:57,432 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:06:57,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 134 flow [2022-12-06 04:06:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 04:06:57,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 04:06:57,434 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 3 states and 29 transitions. [2022-12-06 04:06:57,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 134 flow [2022-12-06 04:06:57,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:57,436 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 04:06:57,438 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-06 04:06:57,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:57,438 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:57,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:57,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,444 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:06:57,445 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:06:57,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 20 events. 0/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:06:57,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 04:06:57,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:57,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 04:06:57,505 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 62 flow [2022-12-06 04:06:57,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:57,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:57,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:57,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1284759889, now seen corresponding path program 1 times [2022-12-06 04:06:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:57,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233643761] [2022-12-06 04:06:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233643761] [2022-12-06 04:06:57,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233643761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784821693] [2022-12-06 04:06:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:57,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:06:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 04:06:57,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:06:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:57,757 INFO L130 PetriNetUnfolder]: 255/440 cut-off events. [2022-12-06 04:06:57,757 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 04:06:57,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 440 events. 255/440 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1680 event pairs, 69 based on Foata normal form. 24/463 useless extension candidates. Maximal degree in co-relation 1069. Up to 353 conditions per place. [2022-12-06 04:06:57,760 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 27 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-06 04:06:57,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 159 flow [2022-12-06 04:06:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:06:57,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 04:06:57,761 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 62 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:06:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 159 flow [2022-12-06 04:06:57,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:57,763 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 04:06:57,764 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:06:57,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:57,764 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:57,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:57,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,772 INFO L130 PetriNetUnfolder]: 14/56 cut-off events. [2022-12-06 04:06:57,772 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 04:06:57,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 56 events. 14/56 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 6 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 113. Up to 29 conditions per place. [2022-12-06 04:06:57,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 04:06:57,774 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:57,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 04:06:57,775 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 84 flow [2022-12-06 04:06:57,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 04:06:57,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:57,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:57,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1542065160, now seen corresponding path program 1 times [2022-12-06 04:06:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140902695] [2022-12-06 04:06:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140902695] [2022-12-06 04:06:57,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140902695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912457677] [2022-12-06 04:06:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:57,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:06:57,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 04:06:57,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:06:57,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:58,089 INFO L130 PetriNetUnfolder]: 457/785 cut-off events. [2022-12-06 04:06:58,090 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-12-06 04:06:58,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 785 events. 457/785 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3605 event pairs, 55 based on Foata normal form. 14/799 useless extension candidates. Maximal degree in co-relation 2157. Up to 438 conditions per place. [2022-12-06 04:06:58,095 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 38 selfloop transitions, 2 changer transitions 9/50 dead transitions. [2022-12-06 04:06:58,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 272 flow [2022-12-06 04:06:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 04:06:58,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 04:06:58,096 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 84 flow. Second operand 4 states and 46 transitions. [2022-12-06 04:06:58,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 272 flow [2022-12-06 04:06:58,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:58,100 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 04:06:58,102 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 04:06:58,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:58,103 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:58,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:58,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,114 INFO L130 PetriNetUnfolder]: 30/96 cut-off events. [2022-12-06 04:06:58,114 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 04:06:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 96 events. 30/96 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 383 event pairs, 13 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 204. Up to 60 conditions per place. [2022-12-06 04:06:58,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 04:06:58,116 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:58,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:06:58,117 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 93 flow [2022-12-06 04:06:58,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 04:06:58,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:58,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:58,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2006697472, now seen corresponding path program 2 times [2022-12-06 04:06:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052072511] [2022-12-06 04:06:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052072511] [2022-12-06 04:06:58,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052072511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:58,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:58,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053293389] [2022-12-06 04:06:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:58,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:06:58,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:58,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:58,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:06:58,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:58,428 INFO L130 PetriNetUnfolder]: 199/389 cut-off events. [2022-12-06 04:06:58,429 INFO L131 PetriNetUnfolder]: For 187/188 co-relation queries the response was YES. [2022-12-06 04:06:58,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 389 events. 199/389 cut-off events. For 187/188 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1593 event pairs, 54 based on Foata normal form. 40/418 useless extension candidates. Maximal degree in co-relation 1091. Up to 142 conditions per place. [2022-12-06 04:06:58,431 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2022-12-06 04:06:58,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 243 flow [2022-12-06 04:06:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:06:58,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-06 04:06:58,433 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 93 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:06:58,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 243 flow [2022-12-06 04:06:58,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:58,435 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 04:06:58,435 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-06 04:06:58,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:58,435 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:58,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:58,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,444 INFO L130 PetriNetUnfolder]: 16/69 cut-off events. [2022-12-06 04:06:58,445 INFO L131 PetriNetUnfolder]: For 55/95 co-relation queries the response was YES. [2022-12-06 04:06:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 69 events. 16/69 cut-off events. For 55/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 213 event pairs, 2 based on Foata normal form. 2/65 useless extension candidates. Maximal degree in co-relation 190. Up to 39 conditions per place. [2022-12-06 04:06:58,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:06:58,447 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:58,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:06:58,447 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 132 flow [2022-12-06 04:06:58,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:58,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:58,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:58,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:58,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1008659189, now seen corresponding path program 1 times [2022-12-06 04:06:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:58,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938622321] [2022-12-06 04:06:58,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938622321] [2022-12-06 04:06:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938622321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:58,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:58,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386654224] [2022-12-06 04:06:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:58,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:58,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:06:58,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:58,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:58,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:06:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:58,762 INFO L130 PetriNetUnfolder]: 162/312 cut-off events. [2022-12-06 04:06:58,762 INFO L131 PetriNetUnfolder]: For 331/332 co-relation queries the response was YES. [2022-12-06 04:06:58,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 312 events. 162/312 cut-off events. For 331/332 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1218 event pairs, 49 based on Foata normal form. 16/317 useless extension candidates. Maximal degree in co-relation 1016. Up to 133 conditions per place. [2022-12-06 04:06:58,764 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 10 changer transitions 2/45 dead transitions. [2022-12-06 04:06:58,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 268 flow [2022-12-06 04:06:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 04:06:58,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 04:06:58,779 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 132 flow. Second operand 5 states and 53 transitions. [2022-12-06 04:06:58,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 268 flow [2022-12-06 04:06:58,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 236 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 04:06:58,782 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 128 flow [2022-12-06 04:06:58,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:06:58,782 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-06 04:06:58,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:58,783 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 128 flow [2022-12-06 04:06:58,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:58,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:58,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 128 flow [2022-12-06 04:06:58,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 128 flow [2022-12-06 04:06:58,789 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 04:06:58,789 INFO L131 PetriNetUnfolder]: For 35/46 co-relation queries the response was YES. [2022-12-06 04:06:58,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 34 events. 6/34 cut-off events. For 35/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 87. Up to 13 conditions per place. [2022-12-06 04:06:58,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 128 flow [2022-12-06 04:06:58,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 04:06:59,521 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:06:59,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 739 [2022-12-06 04:06:59,522 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 122 flow [2022-12-06 04:06:59,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:59,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:59,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:59,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:06:59,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1175995214, now seen corresponding path program 1 times [2022-12-06 04:06:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415886350] [2022-12-06 04:06:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415886350] [2022-12-06 04:06:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415886350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:59,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:59,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296266169] [2022-12-06 04:06:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:59,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:59,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:06:59,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:59,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:59,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:06:59,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:59,878 INFO L130 PetriNetUnfolder]: 136/269 cut-off events. [2022-12-06 04:06:59,878 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-12-06 04:06:59,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 269 events. 136/269 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1007 event pairs, 18 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 887. Up to 183 conditions per place. [2022-12-06 04:06:59,880 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 33 selfloop transitions, 7 changer transitions 14/54 dead transitions. [2022-12-06 04:06:59,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 382 flow [2022-12-06 04:06:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 04:06:59,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 04:06:59,881 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 122 flow. Second operand 5 states and 41 transitions. [2022-12-06 04:06:59,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 382 flow [2022-12-06 04:06:59,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 324 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 04:06:59,884 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2022-12-06 04:06:59,885 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 04:06:59,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:59,885 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:59,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:59,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,896 INFO L130 PetriNetUnfolder]: 20/78 cut-off events. [2022-12-06 04:06:59,896 INFO L131 PetriNetUnfolder]: For 78/85 co-relation queries the response was YES. [2022-12-06 04:06:59,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 78 events. 20/78 cut-off events. For 78/85 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 272 event pairs, 2 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 211. Up to 24 conditions per place. [2022-12-06 04:06:59,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 04:06:59,898 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:59,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:06:59,899 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 145 flow [2022-12-06 04:06:59,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:59,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:59,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:59,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:06:59,900 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2103198328, now seen corresponding path program 2 times [2022-12-06 04:06:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:59,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512820104] [2022-12-06 04:06:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512820104] [2022-12-06 04:07:00,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512820104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:00,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:00,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:07:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933925092] [2022-12-06 04:07:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:07:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:07:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:07:00,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:07:00,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:00,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:00,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:07:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:00,190 INFO L130 PetriNetUnfolder]: 126/272 cut-off events. [2022-12-06 04:07:00,191 INFO L131 PetriNetUnfolder]: For 482/488 co-relation queries the response was YES. [2022-12-06 04:07:00,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 272 events. 126/272 cut-off events. For 482/488 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1123 event pairs, 30 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 988. Up to 145 conditions per place. [2022-12-06 04:07:00,192 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 23 selfloop transitions, 1 changer transitions 25/50 dead transitions. [2022-12-06 04:07:00,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 347 flow [2022-12-06 04:07:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:07:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:07:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 04:07:00,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-06 04:07:00,196 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 145 flow. Second operand 4 states and 37 transitions. [2022-12-06 04:07:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 347 flow [2022-12-06 04:07:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:07:00,199 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 117 flow [2022-12-06 04:07:00,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2022-12-06 04:07:00,201 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 04:07:00,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:00,201 INFO L89 Accepts]: Start accepts. Operand has 43 places, 23 transitions, 117 flow [2022-12-06 04:07:00,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:00,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:00,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 23 transitions, 117 flow [2022-12-06 04:07:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 117 flow [2022-12-06 04:07:00,210 INFO L130 PetriNetUnfolder]: 7/37 cut-off events. [2022-12-06 04:07:00,210 INFO L131 PetriNetUnfolder]: For 62/67 co-relation queries the response was YES. [2022-12-06 04:07:00,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 37 events. 7/37 cut-off events. For 62/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 99. Up to 12 conditions per place. [2022-12-06 04:07:00,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 117 flow [2022-12-06 04:07:00,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:07:00,885 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:07:00,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 685 [2022-12-06 04:07:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 111 flow [2022-12-06 04:07:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:00,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:00,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:07:00,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:07:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1319114460, now seen corresponding path program 1 times [2022-12-06 04:07:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510089372] [2022-12-06 04:07:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510089372] [2022-12-06 04:07:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510089372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:01,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:01,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:07:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355141686] [2022-12-06 04:07:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:07:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:07:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:07:01,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:07:01,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 111 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:01,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:01,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:07:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:01,661 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2022-12-06 04:07:01,661 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-06 04:07:01,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 72 events. 26/72 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 223 event pairs, 3 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 272. Up to 32 conditions per place. [2022-12-06 04:07:01,662 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 16/37 dead transitions. [2022-12-06 04:07:01,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 284 flow [2022-12-06 04:07:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:07:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:07:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-12-06 04:07:01,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 04:07:01,664 INFO L175 Difference]: Start difference. First operand has 38 places, 20 transitions, 111 flow. Second operand 6 states and 24 transitions. [2022-12-06 04:07:01,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 284 flow [2022-12-06 04:07:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 266 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 04:07:01,674 INFO L231 Difference]: Finished difference. Result has 41 places, 20 transitions, 111 flow [2022-12-06 04:07:01,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=20} [2022-12-06 04:07:01,674 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 04:07:01,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:01,674 INFO L89 Accepts]: Start accepts. Operand has 41 places, 20 transitions, 111 flow [2022-12-06 04:07:01,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:01,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:01,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 20 transitions, 111 flow [2022-12-06 04:07:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 20 transitions, 111 flow [2022-12-06 04:07:01,681 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 04:07:01,681 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 04:07:01,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 29 events. 6/29 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 81. Up to 10 conditions per place. [2022-12-06 04:07:01,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 20 transitions, 111 flow [2022-12-06 04:07:01,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 04:07:02,199 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:07:02,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-06 04:07:02,200 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 125 flow [2022-12-06 04:07:02,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:02,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:02,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:02,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:07:02,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:07:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -641203843, now seen corresponding path program 1 times [2022-12-06 04:07:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796950577] [2022-12-06 04:07:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:07:02,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:07:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:07:02,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:07:02,296 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:07:02,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:07:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:07:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:07:02,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:07:02,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:07:02,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:07:02,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:07:02,304 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:02,309 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:07:02,309 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:07:02,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:07:02 BasicIcfg [2022-12-06 04:07:02,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:07:02,382 INFO L158 Benchmark]: Toolchain (without parser) took 13345.08ms. Allocated memory was 188.7MB in the beginning and 348.1MB in the end (delta: 159.4MB). Free memory was 163.7MB in the beginning and 236.1MB in the end (delta: -72.4MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,383 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:07:02,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.86ms. Allocated memory is still 188.7MB. Free memory was 163.4MB in the beginning and 135.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.95ms. Allocated memory is still 188.7MB. Free memory was 135.6MB in the beginning and 133.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,387 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,387 INFO L158 Benchmark]: RCFGBuilder took 686.79ms. Allocated memory is still 188.7MB. Free memory was 130.9MB in the beginning and 93.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,388 INFO L158 Benchmark]: TraceAbstraction took 11999.33ms. Allocated memory was 188.7MB in the beginning and 348.1MB in the end (delta: 159.4MB). Free memory was 93.1MB in the beginning and 236.1MB in the end (delta: -143.0MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,389 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.12ms. Allocated memory is still 188.7MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 547.86ms. Allocated memory is still 188.7MB. Free memory was 163.4MB in the beginning and 135.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.95ms. Allocated memory is still 188.7MB. Free memory was 135.6MB in the beginning and 133.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 686.79ms. Allocated memory is still 188.7MB. Free memory was 130.9MB in the beginning and 93.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11999.33ms. Allocated memory was 188.7MB in the beginning and 348.1MB in the end (delta: 159.4MB). Free memory was 93.1MB in the beginning and 236.1MB in the end (delta: -143.0MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 120 PlacesBefore, 36 PlacesAfterwards, 112 TransitionsBefore, 27 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1815, independent: 1752, independent conditional: 1752, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1815, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1815, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1815, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1468, independent: 1419, independent conditional: 0, independent unconditional: 1419, 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: 1468, independent: 1407, independent conditional: 0, independent unconditional: 1407, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1815, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1468, unknown conditional: 0, unknown unconditional: 1468] , Statistics on independence cache: Total cache size (in pairs): 2386, Positive cache size: 2337, Positive conditional cache size: 0, Positive unconditional cache size: 2337, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 149, independent conditional: 14, independent unconditional: 135, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 149, independent conditional: 14, independent unconditional: 135, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 149, independent conditional: 14, independent unconditional: 135, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, independent: 129, independent conditional: 12, independent unconditional: 117, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 97, dependent conditional: 37, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 149, unknown conditional: 16, unknown unconditional: 133] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 129, Positive conditional cache size: 12, Positive unconditional cache size: 117, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, 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, 32 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 312, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 312, independent: 271, independent conditional: 22, independent unconditional: 249, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 312, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 312, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 312, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 167, Positive conditional cache size: 13, Positive unconditional cache size: 154, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 129, independent conditional: 23, independent unconditional: 106, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 7, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 195, Positive conditional cache size: 15, Positive unconditional cache size: 180, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 4, independent unconditional: 54, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 47, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 200, Positive conditional cache size: 15, Positive unconditional cache size: 185, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, 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.0s, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 3, independent unconditional: 37, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 40, independent conditional: 3, independent unconditional: 37, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 3, independent unconditional: 37, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 54, independent: 38, independent conditional: 3, independent unconditional: 35, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 202, Positive conditional cache size: 15, Positive unconditional cache size: 187, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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: 7, independent unconditional: 46, 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: 7, independent unconditional: 46, 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: 7, independent unconditional: 46, 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: 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: 65, independent: 50, independent conditional: 7, independent unconditional: 43, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 205, Positive conditional cache size: 15, Positive unconditional cache size: 190, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 79, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 205, Positive conditional cache size: 15, Positive unconditional cache size: 190, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 39 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 90, independent conditional: 90, 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: 116, independent: 90, independent conditional: 38, independent unconditional: 52, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 90, independent conditional: 38, independent unconditional: 52, 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: 116, independent: 90, independent conditional: 38, independent unconditional: 52, 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: 9, independent: 4, independent conditional: 1, 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: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 86, independent conditional: 37, independent unconditional: 49, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 222, Positive conditional cache size: 16, Positive unconditional cache size: 206, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, 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, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 33, independent conditional: 21, independent unconditional: 12, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 33, independent conditional: 14, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 33, independent conditional: 14, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 33, independent conditional: 14, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 222, Positive conditional cache size: 16, Positive unconditional cache size: 206, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 41 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 16, independent conditional: 13, independent unconditional: 3, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 16, independent conditional: 13, independent unconditional: 3, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 16, independent conditional: 13, independent unconditional: 3, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 264, Positive conditional cache size: 17, Positive unconditional cache size: 247, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, 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.5s, 39 PlacesBefore, 38 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 325, Positive conditional cache size: 18, Positive unconditional cache size: 307, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 [L756] 1 x = 1 [L759] 1 __unbuffered_p0_EAX = x [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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 7 procedures, 144 locations, 6 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: 11.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 11 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:07:02,434 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...