/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:10:11,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:10:11,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:10:11,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:10:11,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:10:11,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:10:11,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:10:11,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:10:11,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:10:11,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:10:11,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:10:11,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:10:11,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:10:11,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:10:11,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:10:11,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:10:11,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:10:11,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:10:11,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:10:11,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:10:11,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:10:11,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:10:11,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:10:11,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:10:11,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:10:11,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:10:12,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:10:12,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:10:12,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:10:12,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:10:12,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:10:12,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:10:12,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:10:12,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:10:12,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:10:12,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:10:12,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:10:12,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:10:12,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:10:12,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:10:12,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:10:12,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:10:12,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:10:12,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:10:12,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:10:12,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:10:12,066 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:10:12,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:10:12,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:10:12,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:10:12,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:10:12,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:10:12,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:10:12,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:12,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:10:12,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:10:12,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:10:12,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:10:12,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:10:12,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:10:12,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:10:12,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:10:12,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:10:12,407 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:10:12,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:10:13,264 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:10:13,539 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:10:13,539 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:10:13,554 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0314a6f/3b04bbd04a1a4495b6dfbd9087bd333e/FLAGe11856af9 [2022-12-06 04:10:13,578 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0314a6f/3b04bbd04a1a4495b6dfbd9087bd333e [2022-12-06 04:10:13,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:10:13,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:10:13,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:13,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:10:13,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:10:13,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:13" (1/1) ... [2022-12-06 04:10:13,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566823c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:13, skipping insertion in model container [2022-12-06 04:10:13,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:13" (1/1) ... [2022-12-06 04:10:13,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:10:13,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:10:13,778 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:10:13,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:13,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:13,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:13,977 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:10:13,987 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:10:14,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:14,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:14,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:14,064 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:10:14,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14 WrapperNode [2022-12-06 04:10:14,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:14,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:14,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:10:14,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:10:14,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,127 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:10:14,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:14,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:10:14,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:10:14,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:10:14,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,166 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:10:14,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:10:14,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:10:14,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:10:14,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (1/1) ... [2022-12-06 04:10:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:10:14,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:10:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:10:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:10:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:10:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:10:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:10:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:10:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:10:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:10:14,258 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:10:14,431 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:10:14,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:10:14,720 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:10:14,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:10:14,797 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:10:14,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:14 BoogieIcfgContainer [2022-12-06 04:10:14,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:10:14,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:10:14,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:10:14,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:10:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:13" (1/3) ... [2022-12-06 04:10:14,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5085c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:14, skipping insertion in model container [2022-12-06 04:10:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:14" (2/3) ... [2022-12-06 04:10:14,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5085c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:14, skipping insertion in model container [2022-12-06 04:10:14,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:14" (3/3) ... [2022-12-06 04:10:14,806 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:10:14,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:10:14,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:10:14,820 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:10:14,862 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:10:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:10:14,969 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:10:14,969 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:14,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:10:14,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:10:14,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 04:10:14,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:15,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:10:15,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 04:10:15,037 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:10:15,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:15,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:10:15,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:10:15,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-06 04:10:19,189 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:10:19,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:10:19,210 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;@caa22c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:10:19,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:10:19,223 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:10:19,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:19,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:19,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:19,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash 355409804, now seen corresponding path program 1 times [2022-12-06 04:10:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:19,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077532389] [2022-12-06 04:10:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:19,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077532389] [2022-12-06 04:10:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077532389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298291814] [2022-12-06 04:10:19,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:19,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-06 04:10:19,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:19,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:19,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-06 04:10:19,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:20,156 INFO L130 PetriNetUnfolder]: 3519/5055 cut-off events. [2022-12-06 04:10:20,157 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 04:10:20,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10035 conditions, 5055 events. 3519/5055 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 27046 event pairs, 954 based on Foata normal form. 0/4559 useless extension candidates. Maximal degree in co-relation 10023. Up to 3826 conditions per place. [2022-12-06 04:10:20,181 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-06 04:10:20,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-06 04:10:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 04:10:20,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-06 04:10:20,191 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 61 transitions. [2022-12-06 04:10:20,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2022-12-06 04:10:20,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:20,197 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:20,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:10:20,203 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-06 04:10:20,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:20,204 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:20,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:20,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:20,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:20,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:20,219 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:10:20,219 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:20,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:20,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:10:20,308 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:20,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 04:10:20,310 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:20,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:20,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:20,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:20,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:10:20,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1618198780, now seen corresponding path program 1 times [2022-12-06 04:10:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:20,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685629366] [2022-12-06 04:10:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685629366] [2022-12-06 04:10:20,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685629366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:20,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:20,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733470668] [2022-12-06 04:10:20,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:20,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:20,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:20,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:20,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:20,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:20,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:21,728 INFO L130 PetriNetUnfolder]: 12556/17185 cut-off events. [2022-12-06 04:10:21,728 INFO L131 PetriNetUnfolder]: For 752/752 co-relation queries the response was YES. [2022-12-06 04:10:21,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 17185 events. 12556/17185 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 88795 event pairs, 4324 based on Foata normal form. 484/17669 useless extension candidates. Maximal degree in co-relation 35522. Up to 10805 conditions per place. [2022-12-06 04:10:21,820 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2022-12-06 04:10:21,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-06 04:10:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:10:21,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 04:10:21,823 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:10:21,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-06 04:10:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:21,827 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2022-12-06 04:10:21,828 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2022-12-06 04:10:21,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:21,828 INFO L89 Accepts]: Start accepts. Operand has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:21,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:21,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,929 INFO L130 PetriNetUnfolder]: 347/798 cut-off events. [2022-12-06 04:10:21,929 INFO L131 PetriNetUnfolder]: For 114/128 co-relation queries the response was YES. [2022-12-06 04:10:21,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 798 events. 347/798 cut-off events. For 114/128 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5208 event pairs, 149 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1622. Up to 377 conditions per place. [2022-12-06 04:10:21,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 04:10:21,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:21,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 04:10:21,995 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 132 flow [2022-12-06 04:10:21,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:21,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:21,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:21,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:10:21,999 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1375444729, now seen corresponding path program 1 times [2022-12-06 04:10:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317944995] [2022-12-06 04:10:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:22,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317944995] [2022-12-06 04:10:22,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317944995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:22,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:22,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570702838] [2022-12-06 04:10:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:22,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:22,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:22,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 132 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:22,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:22,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:22,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:23,286 INFO L130 PetriNetUnfolder]: 12350/16907 cut-off events. [2022-12-06 04:10:23,286 INFO L131 PetriNetUnfolder]: For 7509/7509 co-relation queries the response was YES. [2022-12-06 04:10:23,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44467 conditions, 16907 events. 12350/16907 cut-off events. For 7509/7509 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 86588 event pairs, 966 based on Foata normal form. 32/16939 useless extension candidates. Maximal degree in co-relation 44455. Up to 10049 conditions per place. [2022-12-06 04:10:23,385 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 53 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2022-12-06 04:10:23,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 364 flow [2022-12-06 04:10:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:10:23,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-06 04:10:23,388 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 132 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:10:23,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 364 flow [2022-12-06 04:10:23,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:23,415 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2022-12-06 04:10:23,417 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-06 04:10:23,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:23,417 INFO L89 Accepts]: Start accepts. Operand has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:23,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:23,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,455 INFO L130 PetriNetUnfolder]: 318/711 cut-off events. [2022-12-06 04:10:23,455 INFO L131 PetriNetUnfolder]: For 569/663 co-relation queries the response was YES. [2022-12-06 04:10:23,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 711 events. 318/711 cut-off events. For 569/663 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4498 event pairs, 118 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 1821. Up to 351 conditions per place. [2022-12-06 04:10:23,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 04:10:23,568 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:23,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 04:10:23,570 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 212 flow [2022-12-06 04:10:23,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:23,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:23,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:23,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:10:23,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1375444853, now seen corresponding path program 1 times [2022-12-06 04:10:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260732769] [2022-12-06 04:10:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:23,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260732769] [2022-12-06 04:10:23,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260732769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:23,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:23,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331296160] [2022-12-06 04:10:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:23,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:23,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:23,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 212 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:23,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:23,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:23,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:24,902 INFO L130 PetriNetUnfolder]: 12050/16507 cut-off events. [2022-12-06 04:10:24,903 INFO L131 PetriNetUnfolder]: For 14839/14839 co-relation queries the response was YES. [2022-12-06 04:10:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47522 conditions, 16507 events. 12050/16507 cut-off events. For 14839/14839 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 84793 event pairs, 2371 based on Foata normal form. 50/16557 useless extension candidates. Maximal degree in co-relation 47507. Up to 9909 conditions per place. [2022-12-06 04:10:24,999 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2022-12-06 04:10:24,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 532 flow [2022-12-06 04:10:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 04:10:25,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 04:10:25,001 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 212 flow. Second operand 4 states and 70 transitions. [2022-12-06 04:10:25,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 532 flow [2022-12-06 04:10:25,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:25,030 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2022-12-06 04:10:25,031 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-06 04:10:25,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:25,032 INFO L89 Accepts]: Start accepts. Operand has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:25,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:25,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,081 INFO L130 PetriNetUnfolder]: 289/693 cut-off events. [2022-12-06 04:10:25,081 INFO L131 PetriNetUnfolder]: For 1273/1416 co-relation queries the response was YES. [2022-12-06 04:10:25,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 693 events. 289/693 cut-off events. For 1273/1416 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4438 event pairs, 77 based on Foata normal form. 2/682 useless extension candidates. Maximal degree in co-relation 2255. Up to 325 conditions per place. [2022-12-06 04:10:25,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-06 04:10:25,093 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:25,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:10:25,099 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 378 flow [2022-12-06 04:10:25,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:25,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:25,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:25,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:10:25,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -310886880, now seen corresponding path program 1 times [2022-12-06 04:10:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:25,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113636308] [2022-12-06 04:10:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:25,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113636308] [2022-12-06 04:10:25,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113636308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:25,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:25,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661816309] [2022-12-06 04:10:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:25,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:25,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:25,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 378 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:25,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:25,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:25,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:26,301 INFO L130 PetriNetUnfolder]: 11402/15627 cut-off events. [2022-12-06 04:10:26,301 INFO L131 PetriNetUnfolder]: For 36853/36853 co-relation queries the response was YES. [2022-12-06 04:10:26,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51741 conditions, 15627 events. 11402/15627 cut-off events. For 36853/36853 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 77982 event pairs, 2783 based on Foata normal form. 138/15765 useless extension candidates. Maximal degree in co-relation 51721. Up to 6865 conditions per place. [2022-12-06 04:10:26,383 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 72 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2022-12-06 04:10:26,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 722 flow [2022-12-06 04:10:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 04:10:26,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 04:10:26,385 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 378 flow. Second operand 4 states and 57 transitions. [2022-12-06 04:10:26,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 722 flow [2022-12-06 04:10:26,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 722 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:26,452 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2022-12-06 04:10:26,453 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-06 04:10:26,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:26,453 INFO L89 Accepts]: Start accepts. Operand has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:26,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:26,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,487 INFO L130 PetriNetUnfolder]: 224/542 cut-off events. [2022-12-06 04:10:26,487 INFO L131 PetriNetUnfolder]: For 1840/1942 co-relation queries the response was YES. [2022-12-06 04:10:26,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 542 events. 224/542 cut-off events. For 1840/1942 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3162 event pairs, 55 based on Foata normal form. 3/534 useless extension candidates. Maximal degree in co-relation 2142. Up to 249 conditions per place. [2022-12-06 04:10:26,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-06 04:10:26,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:26,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:10:26,502 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 546 flow [2022-12-06 04:10:26,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:26,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:26,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:26,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:10:26,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 914962179, now seen corresponding path program 1 times [2022-12-06 04:10:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:26,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229152360] [2022-12-06 04:10:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229152360] [2022-12-06 04:10:26,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229152360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:26,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:26,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103878945] [2022-12-06 04:10:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:26,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:26,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 546 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:26,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:26,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:26,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:27,897 INFO L130 PetriNetUnfolder]: 10830/14847 cut-off events. [2022-12-06 04:10:27,898 INFO L131 PetriNetUnfolder]: For 56909/56909 co-relation queries the response was YES. [2022-12-06 04:10:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53817 conditions, 14847 events. 10830/14847 cut-off events. For 56909/56909 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 75979 event pairs, 2445 based on Foata normal form. 120/14967 useless extension candidates. Maximal degree in co-relation 53792. Up to 6357 conditions per place. [2022-12-06 04:10:28,006 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 87 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2022-12-06 04:10:28,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 1002 flow [2022-12-06 04:10:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:10:28,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:10:28,007 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 546 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:10:28,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 1002 flow [2022-12-06 04:10:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 996 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:28,166 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=773, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-06 04:10:28,166 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2022-12-06 04:10:28,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:28,166 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:28,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:28,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,203 INFO L130 PetriNetUnfolder]: 188/472 cut-off events. [2022-12-06 04:10:28,204 INFO L131 PetriNetUnfolder]: For 2402/2546 co-relation queries the response was YES. [2022-12-06 04:10:28,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 472 events. 188/472 cut-off events. For 2402/2546 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2673 event pairs, 35 based on Foata normal form. 4/467 useless extension candidates. Maximal degree in co-relation 2126. Up to 207 conditions per place. [2022-12-06 04:10:28,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-06 04:10:28,216 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:28,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:10:28,217 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 773 flow [2022-12-06 04:10:28,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:28,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:28,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:28,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:10:28,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1703628487, now seen corresponding path program 1 times [2022-12-06 04:10:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:28,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901000527] [2022-12-06 04:10:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901000527] [2022-12-06 04:10:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901000527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:28,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:28,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316313996] [2022-12-06 04:10:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:28,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:28,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-06 04:10:28,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:28,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:28,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-06 04:10:28,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:29,442 INFO L130 PetriNetUnfolder]: 6646/10009 cut-off events. [2022-12-06 04:10:29,442 INFO L131 PetriNetUnfolder]: For 42120/44576 co-relation queries the response was YES. [2022-12-06 04:10:29,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33869 conditions, 10009 events. 6646/10009 cut-off events. For 42120/44576 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 63925 event pairs, 1122 based on Foata normal form. 1229/10794 useless extension candidates. Maximal degree in co-relation 33840. Up to 6139 conditions per place. [2022-12-06 04:10:29,499 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 116 selfloop transitions, 10 changer transitions 0/158 dead transitions. [2022-12-06 04:10:29,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 158 transitions, 1785 flow [2022-12-06 04:10:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 04:10:29,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2022-12-06 04:10:29,501 INFO L175 Difference]: Start difference. First operand has 61 places, 71 transitions, 773 flow. Second operand 5 states and 89 transitions. [2022-12-06 04:10:29,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 158 transitions, 1785 flow [2022-12-06 04:10:29,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 158 transitions, 1780 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:29,537 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 843 flow [2022-12-06 04:10:29,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=843, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2022-12-06 04:10:29,538 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2022-12-06 04:10:29,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:29,538 INFO L89 Accepts]: Start accepts. Operand has 67 places, 80 transitions, 843 flow [2022-12-06 04:10:29,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:29,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:29,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 80 transitions, 843 flow [2022-12-06 04:10:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 80 transitions, 843 flow [2022-12-06 04:10:29,661 INFO L130 PetriNetUnfolder]: 904/1865 cut-off events. [2022-12-06 04:10:29,661 INFO L131 PetriNetUnfolder]: For 4468/5431 co-relation queries the response was YES. [2022-12-06 04:10:29,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1865 events. 904/1865 cut-off events. For 4468/5431 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 14627 event pairs, 363 based on Foata normal form. 32/1671 useless extension candidates. Maximal degree in co-relation 6533. Up to 1132 conditions per place. [2022-12-06 04:10:29,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 80 transitions, 843 flow [2022-12-06 04:10:29,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 1388 [2022-12-06 04:10:29,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L866-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_93 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [485] L787-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_15| 0) (= |v_P1Thread1of1ForFork3_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_15|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:10:29,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L866-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_93 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [442] L819-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-06 04:10:29,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L866-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_93 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [468] L842-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P3Thread1of1ForFork2_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_11|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:10:29,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L866-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_93 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:10:29,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:29,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 04:10:29,849 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 79 transitions, 853 flow [2022-12-06 04:10:29,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:29,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:29,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:10:29,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash -133878340, now seen corresponding path program 1 times [2022-12-06 04:10:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:29,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8740020] [2022-12-06 04:10:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:29,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8740020] [2022-12-06 04:10:29,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8740020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:29,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:29,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:29,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930089060] [2022-12-06 04:10:29,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:29,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:29,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-06 04:10:29,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 79 transitions, 853 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:29,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-06 04:10:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:30,705 INFO L130 PetriNetUnfolder]: 4658/7393 cut-off events. [2022-12-06 04:10:30,705 INFO L131 PetriNetUnfolder]: For 34408/35980 co-relation queries the response was YES. [2022-12-06 04:10:30,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30688 conditions, 7393 events. 4658/7393 cut-off events. For 34408/35980 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 48459 event pairs, 479 based on Foata normal form. 915/8019 useless extension candidates. Maximal degree in co-relation 30655. Up to 2864 conditions per place. [2022-12-06 04:10:30,752 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 127 selfloop transitions, 18 changer transitions 3/180 dead transitions. [2022-12-06 04:10:30,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 180 transitions, 2059 flow [2022-12-06 04:10:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 04:10:30,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2022-12-06 04:10:30,753 INFO L175 Difference]: Start difference. First operand has 66 places, 79 transitions, 853 flow. Second operand 6 states and 113 transitions. [2022-12-06 04:10:30,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 180 transitions, 2059 flow [2022-12-06 04:10:30,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 180 transitions, 2046 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:30,787 INFO L231 Difference]: Finished difference. Result has 73 places, 88 transitions, 972 flow [2022-12-06 04:10:30,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=972, PETRI_PLACES=73, PETRI_TRANSITIONS=88} [2022-12-06 04:10:30,790 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-06 04:10:30,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:30,790 INFO L89 Accepts]: Start accepts. Operand has 73 places, 88 transitions, 972 flow [2022-12-06 04:10:30,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:30,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:30,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 88 transitions, 972 flow [2022-12-06 04:10:30,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 88 transitions, 972 flow [2022-12-06 04:10:30,904 INFO L130 PetriNetUnfolder]: 675/1575 cut-off events. [2022-12-06 04:10:30,904 INFO L131 PetriNetUnfolder]: For 7594/10938 co-relation queries the response was YES. [2022-12-06 04:10:30,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7577 conditions, 1575 events. 675/1575 cut-off events. For 7594/10938 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12692 event pairs, 97 based on Foata normal form. 34/1471 useless extension candidates. Maximal degree in co-relation 7543. Up to 1095 conditions per place. [2022-12-06 04:10:30,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 88 transitions, 972 flow [2022-12-06 04:10:30,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 04:10:31,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:31,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 605 [2022-12-06 04:10:31,395 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 87 transitions, 964 flow [2022-12-06 04:10:31,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:31,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:31,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:31,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:10:31,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1865938182, now seen corresponding path program 1 times [2022-12-06 04:10:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:31,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913700661] [2022-12-06 04:10:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:31,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913700661] [2022-12-06 04:10:31,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913700661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:31,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:31,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127887826] [2022-12-06 04:10:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:31,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:31,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:31,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-06 04:10:31,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 87 transitions, 964 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:31,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:31,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-06 04:10:31,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:32,186 INFO L130 PetriNetUnfolder]: 3272/5269 cut-off events. [2022-12-06 04:10:32,186 INFO L131 PetriNetUnfolder]: For 30750/32006 co-relation queries the response was YES. [2022-12-06 04:10:32,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24648 conditions, 5269 events. 3272/5269 cut-off events. For 30750/32006 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33211 event pairs, 382 based on Foata normal form. 519/5632 useless extension candidates. Maximal degree in co-relation 24611. Up to 1980 conditions per place. [2022-12-06 04:10:32,225 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 139 selfloop transitions, 26 changer transitions 13/210 dead transitions. [2022-12-06 04:10:32,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 210 transitions, 2438 flow [2022-12-06 04:10:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:10:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:10:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-12-06 04:10:32,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.592741935483871 [2022-12-06 04:10:32,226 INFO L175 Difference]: Start difference. First operand has 73 places, 87 transitions, 964 flow. Second operand 8 states and 147 transitions. [2022-12-06 04:10:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 210 transitions, 2438 flow [2022-12-06 04:10:32,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 210 transitions, 2386 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:32,352 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 1086 flow [2022-12-06 04:10:32,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1086, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2022-12-06 04:10:32,353 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2022-12-06 04:10:32,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:32,353 INFO L89 Accepts]: Start accepts. Operand has 80 places, 96 transitions, 1086 flow [2022-12-06 04:10:32,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:32,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:32,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 96 transitions, 1086 flow [2022-12-06 04:10:32,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 96 transitions, 1086 flow [2022-12-06 04:10:32,421 INFO L130 PetriNetUnfolder]: 436/1071 cut-off events. [2022-12-06 04:10:32,422 INFO L131 PetriNetUnfolder]: For 5949/6584 co-relation queries the response was YES. [2022-12-06 04:10:32,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5443 conditions, 1071 events. 436/1071 cut-off events. For 5949/6584 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7865 event pairs, 26 based on Foata normal form. 4/1015 useless extension candidates. Maximal degree in co-relation 5407. Up to 452 conditions per place. [2022-12-06 04:10:32,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 96 transitions, 1086 flow [2022-12-06 04:10:32,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 1668 [2022-12-06 04:10:32,529 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:32,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 04:10:32,530 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 1076 flow [2022-12-06 04:10:32,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:32,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:32,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:32,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:10:32,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash 746718509, now seen corresponding path program 1 times [2022-12-06 04:10:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:32,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356804102] [2022-12-06 04:10:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356804102] [2022-12-06 04:10:32,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356804102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:32,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:32,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88012856] [2022-12-06 04:10:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:32,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:32,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:10:32,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 1076 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:32,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:32,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:10:32,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:33,363 INFO L130 PetriNetUnfolder]: 4429/7079 cut-off events. [2022-12-06 04:10:33,363 INFO L131 PetriNetUnfolder]: For 50983/51794 co-relation queries the response was YES. [2022-12-06 04:10:33,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35371 conditions, 7079 events. 4429/7079 cut-off events. For 50983/51794 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 45579 event pairs, 700 based on Foata normal form. 308/7217 useless extension candidates. Maximal degree in co-relation 35332. Up to 3420 conditions per place. [2022-12-06 04:10:33,408 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 108 selfloop transitions, 2 changer transitions 43/181 dead transitions. [2022-12-06 04:10:33,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 181 transitions, 2226 flow [2022-12-06 04:10:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 04:10:33,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-06 04:10:33,410 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 1076 flow. Second operand 4 states and 81 transitions. [2022-12-06 04:10:33,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 181 transitions, 2226 flow [2022-12-06 04:10:33,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 181 transitions, 1916 flow, removed 105 selfloop flow, removed 6 redundant places. [2022-12-06 04:10:33,587 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 982 flow [2022-12-06 04:10:33,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=982, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2022-12-06 04:10:33,588 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-06 04:10:33,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:33,588 INFO L89 Accepts]: Start accepts. Operand has 79 places, 96 transitions, 982 flow [2022-12-06 04:10:33,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:33,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:33,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 96 transitions, 982 flow [2022-12-06 04:10:33,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 96 transitions, 982 flow [2022-12-06 04:10:33,664 INFO L130 PetriNetUnfolder]: 542/1298 cut-off events. [2022-12-06 04:10:33,664 INFO L131 PetriNetUnfolder]: For 3502/3669 co-relation queries the response was YES. [2022-12-06 04:10:33,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5172 conditions, 1298 events. 542/1298 cut-off events. For 3502/3669 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 9894 event pairs, 31 based on Foata normal form. 4/1238 useless extension candidates. Maximal degree in co-relation 5137. Up to 287 conditions per place. [2022-12-06 04:10:33,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 96 transitions, 982 flow [2022-12-06 04:10:33,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 1564 [2022-12-06 04:10:33,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:33,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 04:10:33,770 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 997 flow [2022-12-06 04:10:33,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:33,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:33,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:10:33,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -355478305, now seen corresponding path program 1 times [2022-12-06 04:10:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293023383] [2022-12-06 04:10:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293023383] [2022-12-06 04:10:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293023383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:33,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:33,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337065772] [2022-12-06 04:10:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:33,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:33,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 04:10:33,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 997 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:33,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:33,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 04:10:33,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:34,957 INFO L130 PetriNetUnfolder]: 8160/12312 cut-off events. [2022-12-06 04:10:34,957 INFO L131 PetriNetUnfolder]: For 78205/78205 co-relation queries the response was YES. [2022-12-06 04:10:35,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60991 conditions, 12312 events. 8160/12312 cut-off events. For 78205/78205 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 73956 event pairs, 1535 based on Foata normal form. 11/12323 useless extension candidates. Maximal degree in co-relation 60953. Up to 5964 conditions per place. [2022-12-06 04:10:35,030 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 88 selfloop transitions, 30 changer transitions 72/190 dead transitions. [2022-12-06 04:10:35,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 190 transitions, 2107 flow [2022-12-06 04:10:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 04:10:35,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-06 04:10:35,031 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 997 flow. Second operand 4 states and 86 transitions. [2022-12-06 04:10:35,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 190 transitions, 2107 flow [2022-12-06 04:10:35,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 190 transitions, 2097 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:35,251 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 929 flow [2022-12-06 04:10:35,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=929, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2022-12-06 04:10:35,251 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2022-12-06 04:10:35,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:35,251 INFO L89 Accepts]: Start accepts. Operand has 84 places, 76 transitions, 929 flow [2022-12-06 04:10:35,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:35,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:35,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 76 transitions, 929 flow [2022-12-06 04:10:35,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 76 transitions, 929 flow [2022-12-06 04:10:35,311 INFO L130 PetriNetUnfolder]: 357/904 cut-off events. [2022-12-06 04:10:35,311 INFO L131 PetriNetUnfolder]: For 3683/3896 co-relation queries the response was YES. [2022-12-06 04:10:35,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 904 events. 357/904 cut-off events. For 3683/3896 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6166 event pairs, 34 based on Foata normal form. 4/869 useless extension candidates. Maximal degree in co-relation 3762. Up to 337 conditions per place. [2022-12-06 04:10:35,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 76 transitions, 929 flow [2022-12-06 04:10:35,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 958 [2022-12-06 04:10:35,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:35,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 04:10:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 931 flow [2022-12-06 04:10:35,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:35,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:35,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:35,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:10:35,345 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1501219003, now seen corresponding path program 2 times [2022-12-06 04:10:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867322967] [2022-12-06 04:10:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:35,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867322967] [2022-12-06 04:10:35,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867322967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:35,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:35,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187473431] [2022-12-06 04:10:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:35,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:35,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:35,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:10:35,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:35,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:35,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:10:35,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:36,065 INFO L130 PetriNetUnfolder]: 4014/6583 cut-off events. [2022-12-06 04:10:36,065 INFO L131 PetriNetUnfolder]: For 41237/41351 co-relation queries the response was YES. [2022-12-06 04:10:36,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30620 conditions, 6583 events. 4014/6583 cut-off events. For 41237/41351 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 40805 event pairs, 1571 based on Foata normal form. 95/6535 useless extension candidates. Maximal degree in co-relation 30578. Up to 3196 conditions per place. [2022-12-06 04:10:36,103 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 9 changer transitions 29/111 dead transitions. [2022-12-06 04:10:36,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 1387 flow [2022-12-06 04:10:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 04:10:36,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2022-12-06 04:10:36,105 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 931 flow. Second operand 3 states and 59 transitions. [2022-12-06 04:10:36,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 1387 flow [2022-12-06 04:10:36,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 1329 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:36,257 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 620 flow [2022-12-06 04:10:36,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2022-12-06 04:10:36,257 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-06 04:10:36,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:36,258 INFO L89 Accepts]: Start accepts. Operand has 79 places, 60 transitions, 620 flow [2022-12-06 04:10:36,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:36,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:36,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 60 transitions, 620 flow [2022-12-06 04:10:36,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 60 transitions, 620 flow [2022-12-06 04:10:36,310 INFO L130 PetriNetUnfolder]: 293/791 cut-off events. [2022-12-06 04:10:36,310 INFO L131 PetriNetUnfolder]: For 3386/3477 co-relation queries the response was YES. [2022-12-06 04:10:36,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 791 events. 293/791 cut-off events. For 3386/3477 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5414 event pairs, 37 based on Foata normal form. 3/758 useless extension candidates. Maximal degree in co-relation 3017. Up to 309 conditions per place. [2022-12-06 04:10:36,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 60 transitions, 620 flow [2022-12-06 04:10:36,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 04:10:36,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [360] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [467] $Ultimate##0-->L768: Formula: (and (= v_~x~0_36 2) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 04:10:36,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:36,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 04:10:36,337 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 624 flow [2022-12-06 04:10:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:36,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:36,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:36,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:10:36,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1895426789, now seen corresponding path program 1 times [2022-12-06 04:10:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928895676] [2022-12-06 04:10:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:36,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928895676] [2022-12-06 04:10:36,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928895676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:36,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:36,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450833281] [2022-12-06 04:10:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:36,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:36,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-06 04:10:36,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 624 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:36,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:36,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-06 04:10:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:37,435 INFO L130 PetriNetUnfolder]: 2507/4512 cut-off events. [2022-12-06 04:10:37,436 INFO L131 PetriNetUnfolder]: For 22904/23119 co-relation queries the response was YES. [2022-12-06 04:10:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18985 conditions, 4512 events. 2507/4512 cut-off events. For 22904/23119 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 30854 event pairs, 370 based on Foata normal form. 46/4489 useless extension candidates. Maximal degree in co-relation 18944. Up to 1690 conditions per place. [2022-12-06 04:10:37,464 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 95 selfloop transitions, 7 changer transitions 48/161 dead transitions. [2022-12-06 04:10:37,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 161 transitions, 1725 flow [2022-12-06 04:10:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:10:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:10:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-06 04:10:37,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2022-12-06 04:10:37,466 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 624 flow. Second operand 7 states and 113 transitions. [2022-12-06 04:10:37,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 161 transitions, 1725 flow [2022-12-06 04:10:37,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 161 transitions, 1561 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:37,534 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 576 flow [2022-12-06 04:10:37,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2022-12-06 04:10:37,534 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2022-12-06 04:10:37,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:37,534 INFO L89 Accepts]: Start accepts. Operand has 84 places, 64 transitions, 576 flow [2022-12-06 04:10:37,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:37,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:37,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 64 transitions, 576 flow [2022-12-06 04:10:37,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 64 transitions, 576 flow [2022-12-06 04:10:37,623 INFO L130 PetriNetUnfolder]: 446/1164 cut-off events. [2022-12-06 04:10:37,623 INFO L131 PetriNetUnfolder]: For 3957/4068 co-relation queries the response was YES. [2022-12-06 04:10:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 1164 events. 446/1164 cut-off events. For 3957/4068 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8715 event pairs, 40 based on Foata normal form. 5/1099 useless extension candidates. Maximal degree in co-relation 4230. Up to 454 conditions per place. [2022-12-06 04:10:37,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 64 transitions, 576 flow [2022-12-06 04:10:37,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-06 04:10:37,996 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:10:37,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-06 04:10:37,997 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 591 flow [2022-12-06 04:10:37,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:37,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:37,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:10:37,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1224675220, now seen corresponding path program 1 times [2022-12-06 04:10:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:37,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416069951] [2022-12-06 04:10:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:38,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416069951] [2022-12-06 04:10:38,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416069951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:38,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:38,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:10:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77909846] [2022-12-06 04:10:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:38,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:10:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:10:38,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:10:38,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-06 04:10:38,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:38,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:38,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-06 04:10:38,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:38,600 INFO L130 PetriNetUnfolder]: 2128/3742 cut-off events. [2022-12-06 04:10:38,600 INFO L131 PetriNetUnfolder]: For 14724/14981 co-relation queries the response was YES. [2022-12-06 04:10:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15909 conditions, 3742 events. 2128/3742 cut-off events. For 14724/14981 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24273 event pairs, 396 based on Foata normal form. 156/3847 useless extension candidates. Maximal degree in co-relation 15872. Up to 1332 conditions per place. [2022-12-06 04:10:38,619 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 39 selfloop transitions, 17 changer transitions 81/140 dead transitions. [2022-12-06 04:10:38,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 140 transitions, 1461 flow [2022-12-06 04:10:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:10:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:10:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-06 04:10:38,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:10:38,620 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 591 flow. Second operand 8 states and 136 transitions. [2022-12-06 04:10:38,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 140 transitions, 1461 flow [2022-12-06 04:10:38,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 140 transitions, 1432 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:38,690 INFO L231 Difference]: Finished difference. Result has 88 places, 39 transitions, 297 flow [2022-12-06 04:10:38,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=297, PETRI_PLACES=88, PETRI_TRANSITIONS=39} [2022-12-06 04:10:38,690 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2022-12-06 04:10:38,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:38,690 INFO L89 Accepts]: Start accepts. Operand has 88 places, 39 transitions, 297 flow [2022-12-06 04:10:38,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:38,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:38,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 39 transitions, 297 flow [2022-12-06 04:10:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 39 transitions, 297 flow [2022-12-06 04:10:38,699 INFO L130 PetriNetUnfolder]: 34/96 cut-off events. [2022-12-06 04:10:38,699 INFO L131 PetriNetUnfolder]: For 168/178 co-relation queries the response was YES. [2022-12-06 04:10:38,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 96 events. 34/96 cut-off events. For 168/178 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 286 event pairs, 1 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 371. Up to 36 conditions per place. [2022-12-06 04:10:38,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 39 transitions, 297 flow [2022-12-06 04:10:38,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 04:10:39,318 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:10:39,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 629 [2022-12-06 04:10:39,319 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 33 transitions, 279 flow [2022-12-06 04:10:39,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:39,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:39,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:10:39,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1279346952, now seen corresponding path program 1 times [2022-12-06 04:10:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552047361] [2022-12-06 04:10:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:39,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:10:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:39,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:10:39,459 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:10:39,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:10:39,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:10:39,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:10:39,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:10:39,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:10:39,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:10:39,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:10:39,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:10:39,461 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:39,465 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:10:39,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:10:39,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:10:39 BasicIcfg [2022-12-06 04:10:39,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:10:39,541 INFO L158 Benchmark]: Toolchain (without parser) took 25960.68ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 152.0MB in the beginning and 923.5MB in the end (delta: -771.5MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 04:10:39,541 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:39,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.99ms. Allocated memory is still 178.3MB. Free memory was 151.5MB in the beginning and 124.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:39,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 178.3MB. Free memory was 124.2MB in the beginning and 121.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:39,542 INFO L158 Benchmark]: Boogie Preprocessor took 42.06ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 119.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:39,542 INFO L158 Benchmark]: RCFGBuilder took 630.65ms. Allocated memory is still 178.3MB. Free memory was 119.5MB in the beginning and 86.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 04:10:39,542 INFO L158 Benchmark]: TraceAbstraction took 24738.12ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 85.4MB in the beginning and 923.5MB in the end (delta: -838.1MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-06 04:10:39,543 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.10ms. Allocated memory is still 178.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.99ms. Allocated memory is still 178.3MB. Free memory was 151.5MB in the beginning and 124.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 178.3MB. Free memory was 124.2MB in the beginning and 121.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.06ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 119.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.65ms. Allocated memory is still 178.3MB. Free memory was 119.5MB in the beginning and 86.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24738.12ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 85.4MB in the beginning and 923.5MB in the end (delta: -838.1MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 45 PlacesAfterwards, 126 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2259, independent: 2190, independent conditional: 2190, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2259, independent: 2190, independent conditional: 0, independent unconditional: 2190, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2259, independent: 2190, independent conditional: 0, independent unconditional: 2190, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2259, independent: 2190, independent conditional: 0, independent unconditional: 2190, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1825, independent: 1773, independent conditional: 0, independent unconditional: 1773, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1759, independent conditional: 0, independent unconditional: 1759, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2259, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 2947, Positive cache size: 2895, Positive conditional cache size: 0, Positive unconditional cache size: 2895, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 162, independent conditional: 12, independent unconditional: 150, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 190, independent: 162, independent conditional: 12, independent unconditional: 150, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 162, independent conditional: 12, independent unconditional: 150, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 170, independent: 147, independent conditional: 11, independent unconditional: 136, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 170, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 78, dependent conditional: 12, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, independent: 15, independent conditional: 1, independent unconditional: 14, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 170, unknown conditional: 13, unknown unconditional: 157] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 147, Positive conditional cache size: 11, Positive unconditional cache size: 136, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 95, independent conditional: 19, independent unconditional: 76, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 95, independent conditional: 7, independent unconditional: 88, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 95, independent conditional: 7, independent unconditional: 88, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 157, Positive conditional cache size: 11, Positive unconditional cache size: 146, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 255, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 255, independent: 234, independent conditional: 48, independent unconditional: 186, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 255, independent: 234, independent conditional: 6, independent unconditional: 228, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 255, independent: 234, independent conditional: 6, independent unconditional: 228, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 255, independent: 218, independent conditional: 6, independent unconditional: 212, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 11, Positive unconditional cache size: 162, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 343, independent: 318, independent conditional: 318, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 343, independent: 318, independent conditional: 116, independent unconditional: 202, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 343, independent: 318, independent conditional: 9, independent unconditional: 309, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 343, independent: 318, independent conditional: 9, independent unconditional: 309, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 343, independent: 318, independent conditional: 9, independent unconditional: 309, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 11, Positive unconditional cache size: 162, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 107, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 439, independent: 407, independent conditional: 407, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 439, independent: 407, independent conditional: 163, independent unconditional: 244, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 439, independent: 407, independent conditional: 18, independent unconditional: 389, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 439, independent: 407, independent conditional: 18, independent unconditional: 389, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 439, independent: 407, independent conditional: 18, independent unconditional: 389, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 11, Positive unconditional cache size: 162, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 145, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 363, independent: 321, independent conditional: 321, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 363, independent: 321, independent conditional: 137, independent unconditional: 184, dependent: 42, dependent conditional: 28, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 427, independent: 321, independent conditional: 34, independent unconditional: 287, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 427, independent: 321, independent conditional: 34, independent unconditional: 287, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 427, independent: 312, independent conditional: 34, independent unconditional: 278, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 182, Positive conditional cache size: 11, Positive unconditional cache size: 171, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 195, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 67 PlacesBefore, 66 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1330, independent: 1258, independent conditional: 1258, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1330, independent: 1258, independent conditional: 734, independent unconditional: 524, dependent: 72, dependent conditional: 12, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1366, independent: 1258, independent conditional: 362, independent unconditional: 896, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1366, independent: 1258, independent conditional: 362, independent unconditional: 896, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1366, independent: 1248, independent conditional: 354, independent unconditional: 894, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 198, Positive conditional cache size: 19, Positive unconditional cache size: 179, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 420, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 73 PlacesBefore, 73 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1156, independent: 1084, independent conditional: 1084, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1156, independent: 1084, independent conditional: 600, independent unconditional: 484, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1156, independent: 1084, independent conditional: 226, independent unconditional: 858, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1156, independent: 1084, independent conditional: 226, independent unconditional: 858, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, 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: 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: 1156, independent: 1075, independent conditional: 218, independent unconditional: 857, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 207, Positive conditional cache size: 27, Positive unconditional cache size: 180, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 374, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1158, independent: 1078, independent conditional: 1078, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1158, independent: 1078, independent conditional: 618, independent unconditional: 460, dependent: 80, dependent conditional: 20, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1218, independent: 1078, independent conditional: 242, independent unconditional: 836, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1218, independent: 1078, independent conditional: 242, independent unconditional: 836, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1218, independent: 1068, independent conditional: 233, independent unconditional: 835, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 217, Positive conditional cache size: 36, Positive unconditional cache size: 181, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 456, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 79 PlacesBefore, 79 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 1564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 795, independent: 735, independent conditional: 735, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 795, independent: 735, independent conditional: 445, independent unconditional: 290, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 795, independent: 735, independent conditional: 255, independent unconditional: 480, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 795, independent: 735, independent conditional: 255, independent unconditional: 480, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 795, independent: 733, independent conditional: 253, independent unconditional: 480, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 329, Positive conditional cache size: 43, Positive unconditional cache size: 286, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 190, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 958 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 159, independent conditional: 159, 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: 183, independent: 159, independent conditional: 95, independent unconditional: 64, 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: 183, independent: 159, independent conditional: 74, independent unconditional: 85, 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: 183, independent: 159, independent conditional: 74, independent unconditional: 85, 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: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 156, independent conditional: 73, independent unconditional: 83, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 354, Positive conditional cache size: 45, Positive unconditional cache size: 309, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 170, independent conditional: 106, independent unconditional: 64, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 170, independent conditional: 40, independent unconditional: 130, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 170, independent conditional: 40, independent unconditional: 130, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 167, independent conditional: 40, independent unconditional: 127, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 373, Positive conditional cache size: 46, Positive unconditional cache size: 327, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 82 PlacesBefore, 82 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 104, independent conditional: 104, 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: 104, independent: 104, independent conditional: 97, independent unconditional: 7, 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: 104, independent: 104, independent conditional: 94, independent unconditional: 10, 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: 104, independent: 104, independent conditional: 94, independent unconditional: 10, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 93, independent conditional: 86, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 450, Positive conditional cache size: 63, Positive unconditional cache size: 387, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 78 PlacesBefore, 72 PlacesAfterwards, 39 TransitionsBefore, 33 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 25, independent unconditional: 9, 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: 34, independent: 34, independent conditional: 20, independent unconditional: 14, 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: 34, independent: 34, independent conditional: 20, independent unconditional: 14, 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: 34, independent: 34, independent conditional: 20, independent unconditional: 14, 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): 556, Positive cache size: 525, Positive conditional cache size: 71, Positive unconditional cache size: 454, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=-3, t605={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t606, ((void *)0), P1, ((void *)0))=-2, t605={5:0}, t606={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t607, ((void *)0), P2, ((void *)0))=-1, t605={5:0}, t606={6:0}, t607={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t608, ((void *)0), P3, ((void *)0))=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 4 z = 2 [L831] 4 __unbuffered_p3_EAX = z [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 [L755] 1 x = 1 [L767] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 __unbuffered_p1_EAX = x [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L814] 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) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 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 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 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 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 862]: 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: 866]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1432 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 39 mSDtfsCounter, 1432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1086occurred in iteration=9, InterpolantAutomatonStates: 67, 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, 1.9s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:10:39,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...