/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:30:34,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:30:34,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:30:34,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:30:34,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:30:34,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:30:34,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:30:34,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:30:34,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:30:34,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:30:34,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:30:34,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:30:34,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:30:34,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:30:34,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:30:34,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:30:34,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:30:34,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:30:34,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:30:34,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:30:34,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:30:34,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:30:34,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:30:34,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:30:34,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:30:34,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:30:34,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:30:34,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:30:34,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:30:34,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:30:34,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:30:34,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:30:34,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:30:34,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:30:34,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:30:34,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:30:34,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:30:34,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:30:34,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:30:34,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:30:34,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:30:34,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:30:34,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:30:34,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:30:34,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:30:34,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:30:34,580 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:30:34,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:30:34,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:30:34,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:30:34,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:30:34,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:30:34,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:30:34,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:30:34,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:30:34,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:30:34,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:30:34,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:30:34,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:34,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:30:34,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:30:34,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:30:34,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:30:34,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:30:34,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:30:34,933 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:30:34,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:30:36,130 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:30:36,424 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:30:36,424 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:30:36,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb14baa1b/30fd4d20a4224ad6a8ccaacd8029bd25/FLAGbecb83c75 [2022-12-06 06:30:36,460 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb14baa1b/30fd4d20a4224ad6a8ccaacd8029bd25 [2022-12-06 06:30:36,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:30:36,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:30:36,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:36,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:30:36,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:30:36,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:36" (1/1) ... [2022-12-06 06:30:36,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac7c05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:36, skipping insertion in model container [2022-12-06 06:30:36,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:36" (1/1) ... [2022-12-06 06:30:36,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:30:36,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:30:36,716 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 06:30:36,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:36,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:36,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:36,978 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:30:36,990 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 06:30:37,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:37,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:37,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:37,108 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:30:37,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37 WrapperNode [2022-12-06 06:30:37,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:37,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:37,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:30:37,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:30:37,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,182 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 06:30:37,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:37,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:30:37,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:30:37,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:30:37,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,227 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:30:37,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:30:37,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:30:37,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:30:37,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (1/1) ... [2022-12-06 06:30:37,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:30:37,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:30:37,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:30:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:30:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:30:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:30:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:30:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:30:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:30:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:30:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:30:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:30:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:30:37,340 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:30:37,521 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:30:37,523 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:30:37,812 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:30:37,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:30:37,979 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:30:37,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:37 BoogieIcfgContainer [2022-12-06 06:30:37,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:30:37,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:30:37,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:30:37,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:30:37,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:36" (1/3) ... [2022-12-06 06:30:37,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67264f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:37, skipping insertion in model container [2022-12-06 06:30:37,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:37" (2/3) ... [2022-12-06 06:30:37,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67264f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:37, skipping insertion in model container [2022-12-06 06:30:37,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:37" (3/3) ... [2022-12-06 06:30:37,989 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:30:38,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:30:38,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:30:38,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:30:38,113 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:30:38,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 06:30:38,209 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 06:30:38,209 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:38,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:30:38,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 06:30:38,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-06 06:30:38,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:38,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 06:30:38,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-06 06:30:38,282 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 06:30:38,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:38,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:30:38,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 06:30:38,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-06 06:30:43,701 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 06:30:43,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:30:43,721 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;@232629bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:30:43,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:30:43,726 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:30:43,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:43,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:43,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:43,727 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 06:30:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1783367948, now seen corresponding path program 1 times [2022-12-06 06:30:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:43,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134647109] [2022-12-06 06:30:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:44,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134647109] [2022-12-06 06:30:44,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134647109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:44,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:44,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091458197] [2022-12-06 06:30:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:44,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:44,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:44,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:30:44,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:44,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:44,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:30:44,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:44,466 INFO L130 PetriNetUnfolder]: 615/1011 cut-off events. [2022-12-06 06:30:44,467 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 06:30:44,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 1011 events. 615/1011 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5033 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1971. Up to 703 conditions per place. [2022-12-06 06:30:44,479 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 06:30:44,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-06 06:30:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:30:44,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:30:44,493 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:30:44,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-06 06:30:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:44,499 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 06:30:44,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, 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=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:30:44,506 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:30:44,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:44,507 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 06:30:44,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:44,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:44,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 06:30:44,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:30:44,520 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:30:44,520 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:44,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:30:44,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:30:44,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:30:44,656 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:44,658 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 06:30:44,658 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:30:44,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:44,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:44,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:44,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:30:44,659 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 06:30:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 124711454, now seen corresponding path program 1 times [2022-12-06 06:30:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825241055] [2022-12-06 06:30:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825241055] [2022-12-06 06:30:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825241055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:44,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:44,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883528444] [2022-12-06 06:30:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:44,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:44,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:44,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:30:44,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:44,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:44,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:30:44,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:45,122 INFO L130 PetriNetUnfolder]: 545/892 cut-off events. [2022-12-06 06:30:45,122 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 06:30:45,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 892 events. 545/892 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4140 event pairs, 125 based on Foata normal form. 8/897 useless extension candidates. Maximal degree in co-relation 1824. Up to 775 conditions per place. [2022-12-06 06:30:45,129 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 06:30:45,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2022-12-06 06:30:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:30:45,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:30:45,132 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:30:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2022-12-06 06:30:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:45,135 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 06:30:45,136 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 06:30:45,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:45,136 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:45,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:45,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,143 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:30:45,144 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:45,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 06:30:45,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:30:45,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:45,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:30:45,158 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 06:30:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:45,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:45,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:45,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:30:45,159 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 06:30:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash -428912885, now seen corresponding path program 1 times [2022-12-06 06:30:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:45,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708301860] [2022-12-06 06:30:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:45,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708301860] [2022-12-06 06:30:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708301860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:45,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:45,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165316647] [2022-12-06 06:30:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:45,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:30:45,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:45,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:45,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:30:45,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:45,974 INFO L130 PetriNetUnfolder]: 617/1019 cut-off events. [2022-12-06 06:30:45,974 INFO L131 PetriNetUnfolder]: For 119/120 co-relation queries the response was YES. [2022-12-06 06:30:45,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 1019 events. 617/1019 cut-off events. For 119/120 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4550 event pairs, 134 based on Foata normal form. 10/1028 useless extension candidates. Maximal degree in co-relation 2179. Up to 823 conditions per place. [2022-12-06 06:30:45,983 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2022-12-06 06:30:45,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 184 flow [2022-12-06 06:30:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:30:45,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:30:45,985 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:30:45,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 184 flow [2022-12-06 06:30:45,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:45,987 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 103 flow [2022-12-06 06:30:45,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-06 06:30:45,989 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 06:30:45,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:45,989 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 103 flow [2022-12-06 06:30:45,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:45,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:45,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 103 flow [2022-12-06 06:30:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 103 flow [2022-12-06 06:30:46,017 INFO L130 PetriNetUnfolder]: 24/100 cut-off events. [2022-12-06 06:30:46,018 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 06:30:46,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 100 events. 24/100 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 430 event pairs, 5 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 193. Up to 35 conditions per place. [2022-12-06 06:30:46,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 103 flow [2022-12-06 06:30:46,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:30:46,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [372] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 06:30:46,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [208] L823-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_54 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_58 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_112 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_76)) v_~y~0_75) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_57 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_54) v_~y$r_buff1_thd0~0_53) (= (ite .cse0 0 v_~y$w_buff0_used~0_112) v_~y$w_buff0_used~0_111) (= (ite .cse4 0 v_~y$r_buff0_thd0~0_58) v_~y$r_buff0_thd0~0_57) (= v_~y$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_103))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_58, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_76, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_75, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:30:46,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:46,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-06 06:30:46,347 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 107 flow [2022-12-06 06:30:46,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:46,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:46,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:46,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:30:46,348 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 06:30:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1186103354, now seen corresponding path program 1 times [2022-12-06 06:30:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:46,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955938061] [2022-12-06 06:30:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:46,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955938061] [2022-12-06 06:30:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955938061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:46,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:46,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207464983] [2022-12-06 06:30:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:46,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:46,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:30:46,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:46,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:46,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:30:46,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:46,999 INFO L130 PetriNetUnfolder]: 566/936 cut-off events. [2022-12-06 06:30:47,000 INFO L131 PetriNetUnfolder]: For 598/599 co-relation queries the response was YES. [2022-12-06 06:30:47,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 936 events. 566/936 cut-off events. For 598/599 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4205 event pairs, 74 based on Foata normal form. 12/947 useless extension candidates. Maximal degree in co-relation 2437. Up to 683 conditions per place. [2022-12-06 06:30:47,009 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2022-12-06 06:30:47,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 221 flow [2022-12-06 06:30:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:30:47,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 06:30:47,011 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 107 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:30:47,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 221 flow [2022-12-06 06:30:47,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:47,013 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-06 06:30:47,014 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 06:30:47,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:47,014 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:47,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:47,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,035 INFO L130 PetriNetUnfolder]: 23/89 cut-off events. [2022-12-06 06:30:47,036 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-12-06 06:30:47,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 89 events. 23/89 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 5 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 211. Up to 31 conditions per place. [2022-12-06 06:30:47,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 06:30:47,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:47,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:30:47,049 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 124 flow [2022-12-06 06:30:47,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:47,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:47,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:30:47,050 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 06:30:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1885278571, now seen corresponding path program 1 times [2022-12-06 06:30:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:47,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683376932] [2022-12-06 06:30:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:47,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683376932] [2022-12-06 06:30:47,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683376932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:47,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:47,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801636940] [2022-12-06 06:30:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:47,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:47,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:47,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:30:47,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:47,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:47,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:30:47,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:47,740 INFO L130 PetriNetUnfolder]: 539/881 cut-off events. [2022-12-06 06:30:47,741 INFO L131 PetriNetUnfolder]: For 970/971 co-relation queries the response was YES. [2022-12-06 06:30:47,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 881 events. 539/881 cut-off events. For 970/971 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3766 event pairs, 166 based on Foata normal form. 10/883 useless extension candidates. Maximal degree in co-relation 2462. Up to 643 conditions per place. [2022-12-06 06:30:47,747 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 06:30:47,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 235 flow [2022-12-06 06:30:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:30:47,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 06:30:47,749 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 124 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:30:47,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 235 flow [2022-12-06 06:30:47,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:47,753 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-06 06:30:47,754 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 06:30:47,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:47,754 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:47,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:47,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,770 INFO L130 PetriNetUnfolder]: 30/98 cut-off events. [2022-12-06 06:30:47,770 INFO L131 PetriNetUnfolder]: For 139/145 co-relation queries the response was YES. [2022-12-06 06:30:47,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 98 events. 30/98 cut-off events. For 139/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 381 event pairs, 7 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 256. Up to 37 conditions per place. [2022-12-06 06:30:47,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:30:47,773 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:47,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:30:47,774 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 132 flow [2022-12-06 06:30:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:47,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:47,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:47,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:30:47,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 06:30:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1685842223, now seen corresponding path program 1 times [2022-12-06 06:30:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:47,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536703533] [2022-12-06 06:30:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536703533] [2022-12-06 06:30:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536703533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078732288] [2022-12-06 06:30:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:48,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:30:48,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 06:30:48,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:48,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:30:48,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:48,455 INFO L130 PetriNetUnfolder]: 579/963 cut-off events. [2022-12-06 06:30:48,456 INFO L131 PetriNetUnfolder]: For 1131/1132 co-relation queries the response was YES. [2022-12-06 06:30:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 963 events. 579/963 cut-off events. For 1131/1132 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4388 event pairs, 114 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 2740. Up to 547 conditions per place. [2022-12-06 06:30:48,463 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 35 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2022-12-06 06:30:48,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 271 flow [2022-12-06 06:30:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:30:48,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:30:48,466 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 132 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:30:48,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 271 flow [2022-12-06 06:30:48,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:48,469 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 06:30:48,470 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 06:30:48,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:48,470 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:48,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:48,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,491 INFO L130 PetriNetUnfolder]: 32/108 cut-off events. [2022-12-06 06:30:48,491 INFO L131 PetriNetUnfolder]: For 187/193 co-relation queries the response was YES. [2022-12-06 06:30:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 108 events. 32/108 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 468 event pairs, 7 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 311. Up to 41 conditions per place. [2022-12-06 06:30:48,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:30:48,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:48,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:30:48,496 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 164 flow [2022-12-06 06:30:48,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 06:30:48,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:48,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:48,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:30:48,497 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 06:30:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1685845788, now seen corresponding path program 1 times [2022-12-06 06:30:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:48,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928857027] [2022-12-06 06:30:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928857027] [2022-12-06 06:30:49,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928857027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:49,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:49,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084997569] [2022-12-06 06:30:49,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:49,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:49,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:30:49,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 06:30:49,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:49,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:30:49,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:49,441 INFO L130 PetriNetUnfolder]: 561/937 cut-off events. [2022-12-06 06:30:49,442 INFO L131 PetriNetUnfolder]: For 1632/1633 co-relation queries the response was YES. [2022-12-06 06:30:49,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 937 events. 561/937 cut-off events. For 1632/1633 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4240 event pairs, 110 based on Foata normal form. 8/944 useless extension candidates. Maximal degree in co-relation 2834. Up to 471 conditions per place. [2022-12-06 06:30:49,449 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 35 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2022-12-06 06:30:49,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 292 flow [2022-12-06 06:30:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:30:49,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2022-12-06 06:30:49,451 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 164 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:30:49,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 292 flow [2022-12-06 06:30:49,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:49,455 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-06 06:30:49,456 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:30:49,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:49,456 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:49,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:49,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,471 INFO L130 PetriNetUnfolder]: 29/103 cut-off events. [2022-12-06 06:30:49,472 INFO L131 PetriNetUnfolder]: For 238/244 co-relation queries the response was YES. [2022-12-06 06:30:49,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 103 events. 29/103 cut-off events. For 238/244 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 451 event pairs, 7 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 320. Up to 37 conditions per place. [2022-12-06 06:30:49,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 06:30:49,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:49,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:30:49,476 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 178 flow [2022-12-06 06:30:49,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 06:30:49,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:49,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:49,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:30:49,476 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 06:30:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -723573878, now seen corresponding path program 1 times [2022-12-06 06:30:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:49,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277586964] [2022-12-06 06:30:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:49,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277586964] [2022-12-06 06:30:49,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277586964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:49,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:49,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917324402] [2022-12-06 06:30:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:49,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 06:30:49,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:49,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:49,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 06:30:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:49,734 INFO L130 PetriNetUnfolder]: 310/561 cut-off events. [2022-12-06 06:30:49,734 INFO L131 PetriNetUnfolder]: For 1372/1373 co-relation queries the response was YES. [2022-12-06 06:30:49,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 561 events. 310/561 cut-off events. For 1372/1373 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2407 event pairs, 85 based on Foata normal form. 33/592 useless extension candidates. Maximal degree in co-relation 1872. Up to 438 conditions per place. [2022-12-06 06:30:49,739 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-06 06:30:49,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 378 flow [2022-12-06 06:30:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 06:30:49,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-06 06:30:49,740 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 178 flow. Second operand 3 states and 44 transitions. [2022-12-06 06:30:49,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 378 flow [2022-12-06 06:30:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 352 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:49,744 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 190 flow [2022-12-06 06:30:49,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-06 06:30:49,745 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:30:49,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:49,745 INFO L89 Accepts]: Start accepts. Operand has 42 places, 33 transitions, 190 flow [2022-12-06 06:30:49,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:49,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:49,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 190 flow [2022-12-06 06:30:49,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 190 flow [2022-12-06 06:30:49,768 INFO L130 PetriNetUnfolder]: 64/176 cut-off events. [2022-12-06 06:30:49,768 INFO L131 PetriNetUnfolder]: For 349/361 co-relation queries the response was YES. [2022-12-06 06:30:49,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 176 events. 64/176 cut-off events. For 349/361 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 855 event pairs, 22 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 522. Up to 70 conditions per place. [2022-12-06 06:30:49,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 190 flow [2022-12-06 06:30:49,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 06:30:49,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L818-3-->L823: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= v_~main$tmp_guard0~0_56 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [439] L757-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_258 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_362 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_259 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff0_used~0_363 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_339 256) 0))))) (and (= v_~y$r_buff1_thd0~0_257 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_258 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_338 256) 0)))) 0 v_~y$r_buff1_thd0~0_258)) (= v_~y$r_buff0_thd0~0_258 (ite .cse2 0 v_~y$r_buff0_thd0~0_259)) (= (ite .cse3 0 v_~y$w_buff0_used~0_363) v_~y$w_buff0_used~0_362) (= v_~y~0_301 (ite .cse3 v_~y$w_buff0~0_240 (ite .cse4 v_~y$w_buff1~0_211 1))) (= v_~y$w_buff1_used~0_338 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_339))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_363, ~y$w_buff1~0=v_~y$w_buff1~0_211, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ~y$w_buff0~0=v_~y$w_buff0~0_240, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_258, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_339} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_362, ~y$w_buff1~0=v_~y$w_buff1~0_211, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_258, ~y$w_buff0~0=v_~y$w_buff0~0_240, ~y~0=v_~y~0_301, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_257, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_338} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:30:49,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:49,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 06:30:49,890 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 192 flow [2022-12-06 06:30:49,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:49,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:49,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:49,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:30:49,890 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 06:30:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1560035438, now seen corresponding path program 1 times [2022-12-06 06:30:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:49,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668400576] [2022-12-06 06:30:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668400576] [2022-12-06 06:30:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668400576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653764849] [2022-12-06 06:30:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:50,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:50,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:50,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 06:30:50,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:50,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:50,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 06:30:50,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:50,156 INFO L130 PetriNetUnfolder]: 154/317 cut-off events. [2022-12-06 06:30:50,156 INFO L131 PetriNetUnfolder]: For 563/564 co-relation queries the response was YES. [2022-12-06 06:30:50,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 317 events. 154/317 cut-off events. For 563/564 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1267 event pairs, 40 based on Foata normal form. 36/351 useless extension candidates. Maximal degree in co-relation 1130. Up to 107 conditions per place. [2022-12-06 06:30:50,159 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 47 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2022-12-06 06:30:50,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 423 flow [2022-12-06 06:30:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 06:30:50,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2022-12-06 06:30:50,161 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 192 flow. Second operand 4 states and 57 transitions. [2022-12-06 06:30:50,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 423 flow [2022-12-06 06:30:50,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 409 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:50,164 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-06 06:30:50,165 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 06:30:50,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:50,165 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:50,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:50,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,179 INFO L130 PetriNetUnfolder]: 24/95 cut-off events. [2022-12-06 06:30:50,180 INFO L131 PetriNetUnfolder]: For 160/186 co-relation queries the response was YES. [2022-12-06 06:30:50,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 95 events. 24/95 cut-off events. For 160/186 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 339 event pairs, 2 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 305. Up to 39 conditions per place. [2022-12-06 06:30:50,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 06:30:50,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:50,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:30:50,183 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 202 flow [2022-12-06 06:30:50,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:50,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:50,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:50,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:50,183 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 06:30:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1915970356, now seen corresponding path program 1 times [2022-12-06 06:30:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:50,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286378076] [2022-12-06 06:30:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:50,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:50,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286378076] [2022-12-06 06:30:50,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286378076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:50,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:50,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958366781] [2022-12-06 06:30:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:50,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:50,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:30:50,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:50,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:50,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:30:50,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:50,481 INFO L130 PetriNetUnfolder]: 253/508 cut-off events. [2022-12-06 06:30:50,481 INFO L131 PetriNetUnfolder]: For 1082/1082 co-relation queries the response was YES. [2022-12-06 06:30:50,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1866 conditions, 508 events. 253/508 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2366 event pairs, 39 based on Foata normal form. 8/515 useless extension candidates. Maximal degree in co-relation 1843. Up to 260 conditions per place. [2022-12-06 06:30:50,484 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 51 selfloop transitions, 2 changer transitions 18/74 dead transitions. [2022-12-06 06:30:50,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 593 flow [2022-12-06 06:30:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 06:30:50,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-06 06:30:50,486 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 202 flow. Second operand 4 states and 53 transitions. [2022-12-06 06:30:50,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 593 flow [2022-12-06 06:30:50,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 553 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:50,490 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-06 06:30:50,491 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-06 06:30:50,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:50,492 INFO L89 Accepts]: Start accepts. Operand has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:50,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:50,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,512 INFO L130 PetriNetUnfolder]: 40/150 cut-off events. [2022-12-06 06:30:50,513 INFO L131 PetriNetUnfolder]: For 206/228 co-relation queries the response was YES. [2022-12-06 06:30:50,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 150 events. 40/150 cut-off events. For 206/228 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 711 event pairs, 4 based on Foata normal form. 11/156 useless extension candidates. Maximal degree in co-relation 428. Up to 55 conditions per place. [2022-12-06 06:30:50,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:30:50,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:50,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:30:50,517 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 199 flow [2022-12-06 06:30:50,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:50,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:50,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:50,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:50,518 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 06:30:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1830802380, now seen corresponding path program 2 times [2022-12-06 06:30:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138946540] [2022-12-06 06:30:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138946540] [2022-12-06 06:30:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138946540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:50,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:50,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48756381] [2022-12-06 06:30:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:50,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:50,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:30:50,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 199 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:50,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:50,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:30:50,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:51,036 INFO L130 PetriNetUnfolder]: 432/812 cut-off events. [2022-12-06 06:30:51,036 INFO L131 PetriNetUnfolder]: For 1488/1488 co-relation queries the response was YES. [2022-12-06 06:30:51,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 812 events. 432/812 cut-off events. For 1488/1488 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3916 event pairs, 74 based on Foata normal form. 7/819 useless extension candidates. Maximal degree in co-relation 3012. Up to 454 conditions per place. [2022-12-06 06:30:51,042 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 40 selfloop transitions, 6 changer transitions 21/67 dead transitions. [2022-12-06 06:30:51,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 503 flow [2022-12-06 06:30:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:30:51,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-06 06:30:51,044 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 199 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:30:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 503 flow [2022-12-06 06:30:51,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:51,050 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 227 flow [2022-12-06 06:30:51,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-06 06:30:51,051 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-06 06:30:51,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:51,051 INFO L89 Accepts]: Start accepts. Operand has 52 places, 36 transitions, 227 flow [2022-12-06 06:30:51,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:51,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:51,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 227 flow [2022-12-06 06:30:51,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 36 transitions, 227 flow [2022-12-06 06:30:51,075 INFO L130 PetriNetUnfolder]: 32/137 cut-off events. [2022-12-06 06:30:51,075 INFO L131 PetriNetUnfolder]: For 219/230 co-relation queries the response was YES. [2022-12-06 06:30:51,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 137 events. 32/137 cut-off events. For 219/230 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 648 event pairs, 3 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 399. Up to 55 conditions per place. [2022-12-06 06:30:51,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 227 flow [2022-12-06 06:30:51,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 06:30:51,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= v_~z~0_50 1) (= v_~x~0_93 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, ~z~0=v_~z~0_50, ~x~0=v_~x~0_93, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [387] $Ultimate##0-->L757: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_28 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 06:30:51,165 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:51,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 06:30:51,166 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 230 flow [2022-12-06 06:30:51,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:51,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:51,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:51,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:30:51,168 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 06:30:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1539225206, now seen corresponding path program 1 times [2022-12-06 06:30:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:51,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612046983] [2022-12-06 06:30:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:51,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:51,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612046983] [2022-12-06 06:30:51,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612046983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:51,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:51,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491518780] [2022-12-06 06:30:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:51,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:30:51,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:51,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:51,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:30:51,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:51,494 INFO L130 PetriNetUnfolder]: 110/235 cut-off events. [2022-12-06 06:30:51,495 INFO L131 PetriNetUnfolder]: For 723/723 co-relation queries the response was YES. [2022-12-06 06:30:51,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 235 events. 110/235 cut-off events. For 723/723 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 958 event pairs, 20 based on Foata normal form. 17/250 useless extension candidates. Maximal degree in co-relation 947. Up to 98 conditions per place. [2022-12-06 06:30:51,496 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 10 changer transitions 22/55 dead transitions. [2022-12-06 06:30:51,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 470 flow [2022-12-06 06:30:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 06:30:51,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2022-12-06 06:30:51,498 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 230 flow. Second operand 5 states and 53 transitions. [2022-12-06 06:30:51,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 470 flow [2022-12-06 06:30:51,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 417 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 06:30:51,501 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 164 flow [2022-12-06 06:30:51,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2022-12-06 06:30:51,503 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 06:30:51,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:51,503 INFO L89 Accepts]: Start accepts. Operand has 50 places, 26 transitions, 164 flow [2022-12-06 06:30:51,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:51,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:51,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 26 transitions, 164 flow [2022-12-06 06:30:51,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 26 transitions, 164 flow [2022-12-06 06:30:51,511 INFO L130 PetriNetUnfolder]: 8/39 cut-off events. [2022-12-06 06:30:51,512 INFO L131 PetriNetUnfolder]: For 53/55 co-relation queries the response was YES. [2022-12-06 06:30:51,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 39 events. 8/39 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 126. Up to 15 conditions per place. [2022-12-06 06:30:51,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 26 transitions, 164 flow [2022-12-06 06:30:51,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 06:33:18,101 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:33:18,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146600 [2022-12-06 06:33:18,103 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 23 transitions, 158 flow [2022-12-06 06:33:18,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:18,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:33:18,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:33:18,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:33:18,103 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:33:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:33:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1024051898, now seen corresponding path program 1 times [2022-12-06 06:33:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:33:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202675238] [2022-12-06 06:33:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:33:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:33:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:33:18,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:33:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:33:18,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:33:18,184 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:33:18,184 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:33:18,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:33:18,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:33:18,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:33:18,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:33:18,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:33:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:33:18,188 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:33:18,193 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:33:18,193 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:33:18,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:33:18 BasicIcfg [2022-12-06 06:33:18,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:33:18,273 INFO L158 Benchmark]: Toolchain (without parser) took 161809.70ms. Allocated memory was 194.0MB in the beginning and 720.4MB in the end (delta: 526.4MB). Free memory was 169.0MB in the beginning and 346.0MB in the end (delta: -177.0MB). Peak memory consumption was 350.8MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,274 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:33:18,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.49ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 142.9MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.59ms. Allocated memory is still 194.0MB. Free memory was 142.6MB in the beginning and 140.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,274 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 194.0MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,275 INFO L158 Benchmark]: RCFGBuilder took 750.65ms. Allocated memory is still 194.0MB. Free memory was 137.9MB in the beginning and 107.0MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,275 INFO L158 Benchmark]: TraceAbstraction took 160288.92ms. Allocated memory was 194.0MB in the beginning and 720.4MB in the end (delta: 526.4MB). Free memory was 105.9MB in the beginning and 346.0MB in the end (delta: -240.1MB). Peak memory consumption was 287.8MB. Max. memory is 8.0GB. [2022-12-06 06:33:18,276 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 194.0MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 641.49ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 142.9MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.59ms. Allocated memory is still 194.0MB. Free memory was 142.6MB in the beginning and 140.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 194.0MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 750.65ms. Allocated memory is still 194.0MB. Free memory was 137.9MB in the beginning and 107.0MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 160288.92ms. Allocated memory was 194.0MB in the beginning and 720.4MB in the end (delta: 526.4MB). Free memory was 105.9MB in the beginning and 346.0MB in the end (delta: -240.1MB). Peak memory consumption was 287.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1379, independent: 1323, independent conditional: 1323, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1379, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1379, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1379, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1107, independent: 1069, independent conditional: 0, independent unconditional: 1069, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1054, independent conditional: 0, independent unconditional: 1054, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 256, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1379, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 1752, Positive cache size: 1714, Positive conditional cache size: 0, Positive unconditional cache size: 1714, Negative cache size: 38, Negative conditional cache size: 0, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 3, independent unconditional: 42, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 123, dependent conditional: 8, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 62, unknown conditional: 4, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 45, Positive conditional cache size: 3, Positive unconditional cache size: 42, Negative cache size: 17, Negative conditional cache size: 1, 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.0s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 10, independent unconditional: 75, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 64, Positive conditional cache size: 3, Positive unconditional cache size: 61, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 34 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 142, independent conditional: 142, 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: 166, independent: 142, independent conditional: 52, independent unconditional: 90, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 142, independent conditional: 12, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 142, independent conditional: 12, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 131, independent conditional: 12, independent unconditional: 119, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 87, Positive conditional cache size: 3, Positive unconditional cache size: 84, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 66, independent conditional: 66, 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: 78, independent: 66, independent conditional: 19, independent unconditional: 47, 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: 78, independent: 66, independent conditional: 11, independent unconditional: 55, 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: 78, independent: 66, independent conditional: 11, independent unconditional: 55, 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: 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 78, independent: 65, independent conditional: 11, independent unconditional: 54, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 88, Positive conditional cache size: 3, Positive unconditional cache size: 85, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 78, independent conditional: 78, 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: 90, independent: 78, independent conditional: 20, independent unconditional: 58, 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: 90, independent: 78, independent conditional: 8, independent unconditional: 70, 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: 90, independent: 78, independent conditional: 8, independent unconditional: 70, 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: 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: 90, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 88, Positive conditional cache size: 3, Positive unconditional cache size: 85, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, 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.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 78, independent conditional: 78, 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: 92, independent: 78, independent conditional: 20, independent unconditional: 58, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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): 107, Positive cache size: 88, Positive conditional cache size: 3, Positive unconditional cache size: 85, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 78, independent conditional: 78, 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: 92, independent: 78, independent conditional: 20, independent unconditional: 58, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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: 92, independent: 78, independent conditional: 6, independent unconditional: 72, 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): 107, Positive cache size: 88, Positive conditional cache size: 3, Positive unconditional cache size: 85, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 60, 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: 72, independent: 60, independent conditional: 29, independent unconditional: 31, 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: 72, independent: 60, independent conditional: 18, independent unconditional: 42, 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: 72, independent: 60, independent conditional: 18, independent unconditional: 42, 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: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 72, independent: 51, independent conditional: 14, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 101, Positive conditional cache size: 7, Positive unconditional cache size: 94, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 27, independent conditional: 27, 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: 34, independent: 27, independent conditional: 10, independent unconditional: 17, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 27, independent conditional: 6, independent unconditional: 21, 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: 34, independent: 27, independent conditional: 6, independent unconditional: 21, 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: 34, independent: 27, independent conditional: 6, independent unconditional: 21, 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): 120, Positive cache size: 101, Positive conditional cache size: 7, Positive unconditional cache size: 94, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 101, Positive conditional cache size: 7, Positive unconditional cache size: 94, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, 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, 51 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 35, independent unconditional: 20, 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: 55, independent: 55, independent conditional: 23, independent unconditional: 32, 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: 55, independent: 55, independent conditional: 23, independent unconditional: 32, 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: 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: 55, independent: 53, independent conditional: 23, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 133, Positive conditional cache size: 7, Positive unconditional cache size: 126, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, 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: 146.6s, 48 PlacesBefore, 45 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 12, Positive unconditional cache size: 131, Negative cache size: 23, Negative conditional cache size: 5, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 [L744] 1 x = 1 [L756] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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_p2_EAX=0, 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=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: 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, 132 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: 160.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 12 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=11, InterpolantAutomatonStates: 45, 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, 4.0s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:33:18,319 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...