/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:03:55,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:03:55,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:03:55,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:03:55,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:03:55,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:03:55,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:03:55,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:03:55,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:03:55,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:03:55,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:03:55,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:03:56,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:03:56,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:03:56,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:03:56,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:03:56,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:03:56,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:03:56,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:03:56,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:03:56,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:03:56,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:03:56,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:03:56,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:03:56,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:03:56,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:03:56,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:03:56,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:03:56,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:03:56,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:03:56,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:03:56,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:03:56,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:03:56,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:03:56,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:03:56,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:03:56,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:03:56,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:03:56,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:03:56,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:03:56,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:03:56,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:03:56,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:03:56,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:03:56,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:03:56,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:03:56,071 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:03:56,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:03:56,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:03:56,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:03:56,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:03:56,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:03:56,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:03:56,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:03:56,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:03:56,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:03:56,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:03:56,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:03:56,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:03:56,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:03:56,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:03:56,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:03:56,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:03:56,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:03:56,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:03:56,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:03:56,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:03:56,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:03:56,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:03:56,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:03:56,391 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:03:56,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-12-05 23:03:57,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:03:57,737 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:03:57,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-12-05 23:03:57,764 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/705c520ce/05b3e746f0b64be59ef9602fb9a24ab1/FLAGbb58e84f2 [2022-12-05 23:03:57,775 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/705c520ce/05b3e746f0b64be59ef9602fb9a24ab1 [2022-12-05 23:03:57,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:03:57,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:03:57,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:03:57,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:03:57,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:03:57,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:03:57" (1/1) ... [2022-12-05 23:03:57,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c57b2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:57, skipping insertion in model container [2022-12-05 23:03:57,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:03:57" (1/1) ... [2022-12-05 23:03:57,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:03:57,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:03:57,942 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i[944,957] [2022-12-05 23:03:58,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:03:58,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:03:58,116 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i[944,957] [2022-12-05 23:03:58,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:58,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:58,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:03:58,190 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:03:58,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58 WrapperNode [2022-12-05 23:03:58,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:03:58,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:03:58,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:03:58,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:03:58,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,253 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-12-05 23:03:58,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:03:58,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:03:58,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:03:58,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:03:58,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:03:58,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:03:58,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:03:58,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:03:58,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (1/1) ... [2022-12-05 23:03:58,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:03:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:03:58,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:03:58,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:03:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:03:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:03:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:03:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:03:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:03:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:03:58,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:03:58,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:03:58,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:03:58,380 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:03:58,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:03:58,380 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:03:58,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:03:58,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:03:58,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:03:58,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:03:58,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:03:58,382 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:03:58,578 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:03:58,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:03:58,925 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:03:59,045 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:03:59,045 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:03:59,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:03:59 BoogieIcfgContainer [2022-12-05 23:03:59,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:03:59,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:03:59,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:03:59,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:03:59,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:03:57" (1/3) ... [2022-12-05 23:03:59,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d29706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:03:59, skipping insertion in model container [2022-12-05 23:03:59,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:58" (2/3) ... [2022-12-05 23:03:59,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d29706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:03:59, skipping insertion in model container [2022-12-05 23:03:59,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:03:59" (3/3) ... [2022-12-05 23:03:59,055 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-12-05 23:03:59,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:03:59,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:03:59,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:03:59,124 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:03:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-05 23:03:59,266 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-05 23:03:59,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:59,271 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 70 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-05 23:03:59,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-05 23:03:59,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-05 23:03:59,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:03:59,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-05 23:03:59,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-05 23:03:59,362 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-05 23:03:59,362 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:59,364 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 70 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-05 23:03:59,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-05 23:03:59,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-05 23:04:04,891 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 23:04:04,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:04:04,917 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;@1cb6b85f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:04:04,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:04:04,929 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-12-05 23:04:04,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:04,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:04,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:04,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1196429622, now seen corresponding path program 1 times [2022-12-05 23:04:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:04,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566631485] [2022-12-05 23:04:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:05,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566631485] [2022-12-05 23:04:05,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566631485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:05,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:05,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738265751] [2022-12-05 23:04:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:05,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:05,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:04:05,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:05,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:05,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:04:05,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:05,998 INFO L130 PetriNetUnfolder]: 3113/4531 cut-off events. [2022-12-05 23:04:05,998 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 23:04:06,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8925 conditions, 4531 events. 3113/4531 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24507 event pairs, 593 based on Foata normal form. 0/4158 useless extension candidates. Maximal degree in co-relation 8913. Up to 3385 conditions per place. [2022-12-05 23:04:06,028 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 23:04:06,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-05 23:04:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 23:04:06,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-05 23:04:06,040 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-05 23:04:06,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-05 23:04:06,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:06,046 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:06,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 23:04:06,052 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-05 23:04:06,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:06,053 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:06,056 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:06,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:06,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-05 23:04:06,063 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-05 23:04:06,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:06,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:04:06,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-05 23:04:06,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:04:06,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:06,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-05 23:04:06,272 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-05 23:04:06,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:06,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:06,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:06,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:04:06,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1282367066, now seen corresponding path program 1 times [2022-12-05 23:04:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:06,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253082392] [2022-12-05 23:04:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:06,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253082392] [2022-12-05 23:04:06,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253082392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:06,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:06,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842374253] [2022-12-05 23:04:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:06,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:06,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:06,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:06,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:06,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:06,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:06,843 INFO L130 PetriNetUnfolder]: 2185/3180 cut-off events. [2022-12-05 23:04:06,843 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-05 23:04:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 3180 events. 2185/3180 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15736 event pairs, 721 based on Foata normal form. 32/3200 useless extension candidates. Maximal degree in co-relation 6538. Up to 2745 conditions per place. [2022-12-05 23:04:06,859 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-05 23:04:06,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 182 flow [2022-12-05 23:04:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 23:04:06,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-05 23:04:06,862 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 49 transitions. [2022-12-05 23:04:06,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 182 flow [2022-12-05 23:04:06,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:06,864 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-05 23:04:06,865 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2022-12-05 23:04:06,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:06,865 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,866 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:06,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:06,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,871 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-05 23:04:06,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:06,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2022-12-05 23:04:06,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-05 23:04:06,886 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:06,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 23:04:06,889 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2022-12-05 23:04:06,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:06,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:06,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:06,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:04:06,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1098673660, now seen corresponding path program 1 times [2022-12-05 23:04:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:06,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608310175] [2022-12-05 23:04:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:07,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608310175] [2022-12-05 23:04:07,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608310175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:07,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:07,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283079672] [2022-12-05 23:04:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:07,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:04:07,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:07,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:07,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:04:07,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:08,402 INFO L130 PetriNetUnfolder]: 5967/8248 cut-off events. [2022-12-05 23:04:08,402 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2022-12-05 23:04:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18164 conditions, 8248 events. 5967/8248 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38449 event pairs, 1024 based on Foata normal form. 230/8478 useless extension candidates. Maximal degree in co-relation 18153. Up to 5483 conditions per place. [2022-12-05 23:04:08,442 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 44 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-05 23:04:08,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 251 flow [2022-12-05 23:04:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 23:04:08,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-05 23:04:08,445 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 52 transitions. [2022-12-05 23:04:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 251 flow [2022-12-05 23:04:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:08,447 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-05 23:04:08,449 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2022-12-05 23:04:08,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:08,449 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,451 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:08,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:08,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,501 INFO L130 PetriNetUnfolder]: 258/505 cut-off events. [2022-12-05 23:04:08,501 INFO L131 PetriNetUnfolder]: For 215/244 co-relation queries the response was YES. [2022-12-05 23:04:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 505 events. 258/505 cut-off events. For 215/244 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2711 event pairs, 129 based on Foata normal form. 8/498 useless extension candidates. Maximal degree in co-relation 1224. Up to 354 conditions per place. [2022-12-05 23:04:08,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-05 23:04:08,518 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:08,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-05 23:04:08,519 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2022-12-05 23:04:08,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:08,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:08,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:08,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:04:08,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1217429285, now seen corresponding path program 1 times [2022-12-05 23:04:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:08,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591928379] [2022-12-05 23:04:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:09,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591928379] [2022-12-05 23:04:09,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591928379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:09,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:09,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435576807] [2022-12-05 23:04:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:09,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:09,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:09,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:09,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:09,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:09,648 INFO L130 PetriNetUnfolder]: 4407/6438 cut-off events. [2022-12-05 23:04:09,648 INFO L131 PetriNetUnfolder]: For 4927/4962 co-relation queries the response was YES. [2022-12-05 23:04:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17488 conditions, 6438 events. 4407/6438 cut-off events. For 4927/4962 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34273 event pairs, 1154 based on Foata normal form. 76/6328 useless extension candidates. Maximal degree in co-relation 17473. Up to 4687 conditions per place. [2022-12-05 23:04:09,701 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 46 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2022-12-05 23:04:09,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 348 flow [2022-12-05 23:04:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:04:09,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:04:09,703 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:04:09,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 348 flow [2022-12-05 23:04:09,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 341 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:09,712 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-05 23:04:09,713 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-12-05 23:04:09,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:09,714 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,715 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:09,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:09,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,778 INFO L130 PetriNetUnfolder]: 334/675 cut-off events. [2022-12-05 23:04:09,779 INFO L131 PetriNetUnfolder]: For 452/515 co-relation queries the response was YES. [2022-12-05 23:04:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 675 events. 334/675 cut-off events. For 452/515 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3887 event pairs, 162 based on Foata normal form. 14/653 useless extension candidates. Maximal degree in co-relation 1731. Up to 448 conditions per place. [2022-12-05 23:04:09,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-05 23:04:09,792 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:09,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-05 23:04:09,800 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 200 flow [2022-12-05 23:04:09,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:09,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:09,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:09,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:04:09,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -244114842, now seen corresponding path program 1 times [2022-12-05 23:04:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:09,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344496925] [2022-12-05 23:04:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344496925] [2022-12-05 23:04:10,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344496925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:10,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:10,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261263136] [2022-12-05 23:04:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:10,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:10,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:10,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:10,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:10,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:10,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:10,916 INFO L130 PetriNetUnfolder]: 5819/8676 cut-off events. [2022-12-05 23:04:10,917 INFO L131 PetriNetUnfolder]: For 8841/8876 co-relation queries the response was YES. [2022-12-05 23:04:10,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25370 conditions, 8676 events. 5819/8676 cut-off events. For 8841/8876 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 50750 event pairs, 1333 based on Foata normal form. 132/8607 useless extension candidates. Maximal degree in co-relation 25352. Up to 4335 conditions per place. [2022-12-05 23:04:10,974 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 63 selfloop transitions, 3 changer transitions 1/76 dead transitions. [2022-12-05 23:04:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 505 flow [2022-12-05 23:04:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 23:04:10,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:04:10,975 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 200 flow. Second operand 4 states and 60 transitions. [2022-12-05 23:04:10,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 505 flow [2022-12-05 23:04:10,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 505 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:10,990 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:10,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-05 23:04:10,990 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2022-12-05 23:04:10,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:10,991 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:10,992 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:10,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:10,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:10,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:11,072 INFO L130 PetriNetUnfolder]: 424/926 cut-off events. [2022-12-05 23:04:11,072 INFO L131 PetriNetUnfolder]: For 955/1015 co-relation queries the response was YES. [2022-12-05 23:04:11,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 926 events. 424/926 cut-off events. For 955/1015 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6218 event pairs, 197 based on Foata normal form. 16/893 useless extension candidates. Maximal degree in co-relation 2519. Up to 576 conditions per place. [2022-12-05 23:04:11,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:11,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-05 23:04:11,092 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:11,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-05 23:04:11,093 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 227 flow [2022-12-05 23:04:11,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:11,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:11,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:11,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:04:11,093 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1721521446, now seen corresponding path program 1 times [2022-12-05 23:04:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:11,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715630010] [2022-12-05 23:04:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:11,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715630010] [2022-12-05 23:04:11,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715630010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:11,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:11,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924874794] [2022-12-05 23:04:11,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:11,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:11,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:11,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:11,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-05 23:04:11,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:11,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:11,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:12,572 INFO L130 PetriNetUnfolder]: 7391/10738 cut-off events. [2022-12-05 23:04:12,572 INFO L131 PetriNetUnfolder]: For 12606/12904 co-relation queries the response was YES. [2022-12-05 23:04:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32386 conditions, 10738 events. 7391/10738 cut-off events. For 12606/12904 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 62768 event pairs, 4030 based on Foata normal form. 169/10547 useless extension candidates. Maximal degree in co-relation 32365. Up to 7990 conditions per place. [2022-12-05 23:04:12,652 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 47 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2022-12-05 23:04:12,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 496 flow [2022-12-05 23:04:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 23:04:12,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.472 [2022-12-05 23:04:12,654 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 227 flow. Second operand 5 states and 59 transitions. [2022-12-05 23:04:12,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 496 flow [2022-12-05 23:04:12,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:12,668 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-05 23:04:12,669 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2022-12-05 23:04:12,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:12,669 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,670 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:12,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:12,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,812 INFO L130 PetriNetUnfolder]: 623/1200 cut-off events. [2022-12-05 23:04:12,813 INFO L131 PetriNetUnfolder]: For 2050/2160 co-relation queries the response was YES. [2022-12-05 23:04:12,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 1200 events. 623/1200 cut-off events. For 2050/2160 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7798 event pairs, 181 based on Foata normal form. 62/1187 useless extension candidates. Maximal degree in co-relation 4140. Up to 808 conditions per place. [2022-12-05 23:04:12,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-05 23:04:12,842 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:12,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-05 23:04:12,843 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 369 flow [2022-12-05 23:04:12,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-05 23:04:12,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:12,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:12,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:04:12,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash -696383198, now seen corresponding path program 2 times [2022-12-05 23:04:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:12,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497554234] [2022-12-05 23:04:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:13,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497554234] [2022-12-05 23:04:13,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497554234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:13,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:13,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:13,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776333809] [2022-12-05 23:04:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:13,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:13,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:13,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:13,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:13,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-05 23:04:13,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:13,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:14,332 INFO L130 PetriNetUnfolder]: 7414/10833 cut-off events. [2022-12-05 23:04:14,332 INFO L131 PetriNetUnfolder]: For 20173/20677 co-relation queries the response was YES. [2022-12-05 23:04:14,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37932 conditions, 10833 events. 7414/10833 cut-off events. For 20173/20677 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 63650 event pairs, 1198 based on Foata normal form. 414/10908 useless extension candidates. Maximal degree in co-relation 37908. Up to 6986 conditions per place. [2022-12-05 23:04:14,390 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 56 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2022-12-05 23:04:14,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 658 flow [2022-12-05 23:04:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-05 23:04:14,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:04:14,393 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 369 flow. Second operand 6 states and 70 transitions. [2022-12-05 23:04:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 658 flow [2022-12-05 23:04:14,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 643 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:14,477 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 472 flow [2022-12-05 23:04:14,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2022-12-05 23:04:14,478 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2022-12-05 23:04:14,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:14,478 INFO L89 Accepts]: Start accepts. Operand has 61 places, 61 transitions, 472 flow [2022-12-05 23:04:14,480 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:14,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:14,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 61 transitions, 472 flow [2022-12-05 23:04:14,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 472 flow [2022-12-05 23:04:14,601 INFO L130 PetriNetUnfolder]: 653/1256 cut-off events. [2022-12-05 23:04:14,601 INFO L131 PetriNetUnfolder]: For 2574/2687 co-relation queries the response was YES. [2022-12-05 23:04:14,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4903 conditions, 1256 events. 653/1256 cut-off events. For 2574/2687 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8184 event pairs, 152 based on Foata normal form. 72/1250 useless extension candidates. Maximal degree in co-relation 4880. Up to 850 conditions per place. [2022-12-05 23:04:14,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 61 transitions, 472 flow [2022-12-05 23:04:14,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 626 [2022-12-05 23:04:15,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [467] L2-1-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_98 256) 0))) (.cse3 (not (= 0 (mod v_~z$r_buff1_thd0~0_102 256))))) (let ((.cse2 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_170 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_188 256) 0)) .cse5))) (and (= v_~z$r_buff0_thd0~0_97 (ite .cse0 0 v_~z$r_buff0_thd0~0_98)) (= (ite .cse1 v_~z$w_buff0~0_106 (ite .cse2 v_~z$w_buff1~0_108 v_~z~0_132)) v_~z~0_131) (= v_~z$w_buff1_used~0_169 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_170)) (= (ite .cse1 0 v_~z$w_buff0_used~0_188) v_~z$w_buff0_used~0_187) (= v_~z$r_buff1_thd0~0_101 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_169 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_97 256) 0)))) 0 v_~z$r_buff1_thd0~0_102))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_98, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_188, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_102, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_170, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_132} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_187, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_169, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_131} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:04:15,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:16,077 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:04:16,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1600 [2022-12-05 23:04:16,078 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 502 flow [2022-12-05 23:04:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-05 23:04:16,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:16,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:16,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:04:16,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1217386040, now seen corresponding path program 1 times [2022-12-05 23:04:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:16,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238290875] [2022-12-05 23:04:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:16,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238290875] [2022-12-05 23:04:16,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238290875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:16,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28542793] [2022-12-05 23:04:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:16,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:16,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:16,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:16,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:16,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:16,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:17,564 INFO L130 PetriNetUnfolder]: 8059/11833 cut-off events. [2022-12-05 23:04:17,564 INFO L131 PetriNetUnfolder]: For 32295/32808 co-relation queries the response was YES. [2022-12-05 23:04:17,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45291 conditions, 11833 events. 8059/11833 cut-off events. For 32295/32808 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 71758 event pairs, 1110 based on Foata normal form. 211/11617 useless extension candidates. Maximal degree in co-relation 45265. Up to 8383 conditions per place. [2022-12-05 23:04:17,682 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 65 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-12-05 23:04:17,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 791 flow [2022-12-05 23:04:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-05 23:04:17,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46 [2022-12-05 23:04:17,685 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 502 flow. Second operand 5 states and 69 transitions. [2022-12-05 23:04:17,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 791 flow [2022-12-05 23:04:17,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 774 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:17,771 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 575 flow [2022-12-05 23:04:17,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2022-12-05 23:04:17,774 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-05 23:04:17,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:17,774 INFO L89 Accepts]: Start accepts. Operand has 64 places, 65 transitions, 575 flow [2022-12-05 23:04:17,775 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:17,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:17,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 575 flow [2022-12-05 23:04:17,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 575 flow [2022-12-05 23:04:17,943 INFO L130 PetriNetUnfolder]: 733/1434 cut-off events. [2022-12-05 23:04:17,944 INFO L131 PetriNetUnfolder]: For 4057/4207 co-relation queries the response was YES. [2022-12-05 23:04:17,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 1434 events. 733/1434 cut-off events. For 4057/4207 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 9815 event pairs, 157 based on Foata normal form. 67/1423 useless extension candidates. Maximal degree in co-relation 6045. Up to 971 conditions per place. [2022-12-05 23:04:17,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 575 flow [2022-12-05 23:04:17,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-05 23:04:18,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:18,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1017 [2022-12-05 23:04:18,791 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 585 flow [2022-12-05 23:04:18,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:18,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:18,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:18,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:04:18,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:18,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 915708200, now seen corresponding path program 1 times [2022-12-05 23:04:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895341464] [2022-12-05 23:04:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:19,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:19,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895341464] [2022-12-05 23:04:19,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895341464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:19,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:19,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715091804] [2022-12-05 23:04:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:19,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:19,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:19,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:19,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:19,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:19,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:20,341 INFO L130 PetriNetUnfolder]: 8022/11856 cut-off events. [2022-12-05 23:04:20,341 INFO L131 PetriNetUnfolder]: For 42756/43236 co-relation queries the response was YES. [2022-12-05 23:04:20,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48177 conditions, 11856 events. 8022/11856 cut-off events. For 42756/43236 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 72730 event pairs, 1528 based on Foata normal form. 251/11703 useless extension candidates. Maximal degree in co-relation 48149. Up to 6964 conditions per place. [2022-12-05 23:04:20,425 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 56 selfloop transitions, 26 changer transitions 0/92 dead transitions. [2022-12-05 23:04:20,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 892 flow [2022-12-05 23:04:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 23:04:20,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-05 23:04:20,427 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 585 flow. Second operand 4 states and 61 transitions. [2022-12-05 23:04:20,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 892 flow [2022-12-05 23:04:20,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 856 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:20,548 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=681, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2022-12-05 23:04:20,548 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-05 23:04:20,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:20,549 INFO L89 Accepts]: Start accepts. Operand has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,550 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:20,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:20,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,641 INFO L130 PetriNetUnfolder]: 693/1407 cut-off events. [2022-12-05 23:04:20,641 INFO L131 PetriNetUnfolder]: For 4705/4867 co-relation queries the response was YES. [2022-12-05 23:04:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6307 conditions, 1407 events. 693/1407 cut-off events. For 4705/4867 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 10010 event pairs, 163 based on Foata normal form. 73/1402 useless extension candidates. Maximal degree in co-relation 6283. Up to 931 conditions per place. [2022-12-05 23:04:20,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-05 23:04:20,664 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:20,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-05 23:04:20,664 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 70 transitions, 681 flow [2022-12-05 23:04:20,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:20,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:20,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:20,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:04:20,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash 915735077, now seen corresponding path program 1 times [2022-12-05 23:04:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:20,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817751358] [2022-12-05 23:04:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:21,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817751358] [2022-12-05 23:04:21,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817751358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:21,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:21,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723847173] [2022-12-05 23:04:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:21,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:21,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:04:21,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:21,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:21,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:04:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:22,344 INFO L130 PetriNetUnfolder]: 8543/12673 cut-off events. [2022-12-05 23:04:22,344 INFO L131 PetriNetUnfolder]: For 51009/51502 co-relation queries the response was YES. [2022-12-05 23:04:22,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54466 conditions, 12673 events. 8543/12673 cut-off events. For 51009/51502 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 79331 event pairs, 1624 based on Foata normal form. 183/12438 useless extension candidates. Maximal degree in co-relation 54439. Up to 6026 conditions per place. [2022-12-05 23:04:22,423 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 66 selfloop transitions, 42 changer transitions 0/118 dead transitions. [2022-12-05 23:04:22,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1200 flow [2022-12-05 23:04:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-05 23:04:22,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2022-12-05 23:04:22,425 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 681 flow. Second operand 6 states and 81 transitions. [2022-12-05 23:04:22,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1200 flow [2022-12-05 23:04:22,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 1145 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:22,574 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 937 flow [2022-12-05 23:04:22,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2022-12-05 23:04:22,574 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2022-12-05 23:04:22,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:22,575 INFO L89 Accepts]: Start accepts. Operand has 69 places, 83 transitions, 937 flow [2022-12-05 23:04:22,576 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:22,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:22,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 83 transitions, 937 flow [2022-12-05 23:04:22,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 83 transitions, 937 flow [2022-12-05 23:04:22,766 INFO L130 PetriNetUnfolder]: 773/1586 cut-off events. [2022-12-05 23:04:22,766 INFO L131 PetriNetUnfolder]: For 7298/7443 co-relation queries the response was YES. [2022-12-05 23:04:22,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1586 events. 773/1586 cut-off events. For 7298/7443 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 11673 event pairs, 177 based on Foata normal form. 50/1555 useless extension candidates. Maximal degree in co-relation 7574. Up to 1039 conditions per place. [2022-12-05 23:04:22,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 83 transitions, 937 flow [2022-12-05 23:04:22,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 782 [2022-12-05 23:04:23,518 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:23,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 943 [2022-12-05 23:04:23,519 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 931 flow [2022-12-05 23:04:23,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:23,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:23,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:23,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:04:23,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1894967490, now seen corresponding path program 1 times [2022-12-05 23:04:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:23,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328485345] [2022-12-05 23:04:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:23,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328485345] [2022-12-05 23:04:23,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328485345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:23,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:23,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:23,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518459121] [2022-12-05 23:04:23,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:23,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:23,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:23,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:23,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:23,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 82 transitions, 931 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:23,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:23,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:23,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:25,130 INFO L130 PetriNetUnfolder]: 11965/17735 cut-off events. [2022-12-05 23:04:25,130 INFO L131 PetriNetUnfolder]: For 106193/106859 co-relation queries the response was YES. [2022-12-05 23:04:25,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82036 conditions, 17735 events. 11965/17735 cut-off events. For 106193/106859 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 118720 event pairs, 1972 based on Foata normal form. 540/17670 useless extension candidates. Maximal degree in co-relation 82007. Up to 8367 conditions per place. [2022-12-05 23:04:25,220 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 118 selfloop transitions, 3 changer transitions 47/178 dead transitions. [2022-12-05 23:04:25,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 178 transitions, 2394 flow [2022-12-05 23:04:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 23:04:25,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 23:04:25,223 INFO L175 Difference]: Start difference. First operand has 69 places, 82 transitions, 931 flow. Second operand 4 states and 73 transitions. [2022-12-05 23:04:25,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 178 transitions, 2394 flow [2022-12-05 23:04:25,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 178 transitions, 2313 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:25,368 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 917 flow [2022-12-05 23:04:25,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=917, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2022-12-05 23:04:25,369 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-12-05 23:04:25,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:25,369 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 917 flow [2022-12-05 23:04:25,370 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:25,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:25,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 917 flow [2022-12-05 23:04:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 917 flow [2022-12-05 23:04:25,530 INFO L130 PetriNetUnfolder]: 1128/2380 cut-off events. [2022-12-05 23:04:25,530 INFO L131 PetriNetUnfolder]: For 11506/11670 co-relation queries the response was YES. [2022-12-05 23:04:25,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11380 conditions, 2380 events. 1128/2380 cut-off events. For 11506/11670 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 19367 event pairs, 262 based on Foata normal form. 72/2354 useless extension candidates. Maximal degree in co-relation 11352. Up to 1530 conditions per place. [2022-12-05 23:04:25,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 917 flow [2022-12-05 23:04:25,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 786 [2022-12-05 23:04:25,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:25,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-05 23:04:25,632 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 923 flow [2022-12-05 23:04:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:25,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:25,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:25,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:04:25,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:25,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2085083328, now seen corresponding path program 2 times [2022-12-05 23:04:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933203266] [2022-12-05 23:04:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:25,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933203266] [2022-12-05 23:04:25,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933203266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:25,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:25,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44992091] [2022-12-05 23:04:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:25,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:25,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-05 23:04:25,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:25,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:25,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-05 23:04:25,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:28,072 INFO L130 PetriNetUnfolder]: 15301/22799 cut-off events. [2022-12-05 23:04:28,072 INFO L131 PetriNetUnfolder]: For 123610/124204 co-relation queries the response was YES. [2022-12-05 23:04:28,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102239 conditions, 22799 events. 15301/22799 cut-off events. For 123610/124204 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 158594 event pairs, 5236 based on Foata normal form. 557/22295 useless extension candidates. Maximal degree in co-relation 102208. Up to 10795 conditions per place. [2022-12-05 23:04:28,177 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 92 selfloop transitions, 5 changer transitions 18/124 dead transitions. [2022-12-05 23:04:28,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 1559 flow [2022-12-05 23:04:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-05 23:04:28,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-05 23:04:28,178 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 923 flow. Second operand 3 states and 59 transitions. [2022-12-05 23:04:28,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 1559 flow [2022-12-05 23:04:28,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 1556 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:28,489 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2022-12-05 23:04:28,489 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2022-12-05 23:04:28,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:28,490 INFO L89 Accepts]: Start accepts. Operand has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,490 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:28,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:28,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,689 INFO L130 PetriNetUnfolder]: 1249/2753 cut-off events. [2022-12-05 23:04:28,689 INFO L131 PetriNetUnfolder]: For 14833/14965 co-relation queries the response was YES. [2022-12-05 23:04:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13539 conditions, 2753 events. 1249/2753 cut-off events. For 14833/14965 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 23995 event pairs, 341 based on Foata normal form. 35/2685 useless extension candidates. Maximal degree in co-relation 13510. Up to 1784 conditions per place. [2022-12-05 23:04:28,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-05 23:04:28,737 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:28,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-05 23:04:28,738 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 889 flow [2022-12-05 23:04:28,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:28,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:28,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:04:28,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -696234212, now seen corresponding path program 1 times [2022-12-05 23:04:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:28,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153233218] [2022-12-05 23:04:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153233218] [2022-12-05 23:04:29,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153233218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:29,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:29,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238172956] [2022-12-05 23:04:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:29,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:29,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:29,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:04:29,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 889 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-05 23:04:29,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:29,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:04:29,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:31,565 INFO L130 PetriNetUnfolder]: 14435/21509 cut-off events. [2022-12-05 23:04:31,565 INFO L131 PetriNetUnfolder]: For 114154/114862 co-relation queries the response was YES. [2022-12-05 23:04:31,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98939 conditions, 21509 events. 14435/21509 cut-off events. For 114154/114862 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 146949 event pairs, 2798 based on Foata normal form. 183/20832 useless extension candidates. Maximal degree in co-relation 98907. Up to 12457 conditions per place. [2022-12-05 23:04:31,649 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 69 selfloop transitions, 27 changer transitions 10/113 dead transitions. [2022-12-05 23:04:31,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 1296 flow [2022-12-05 23:04:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-05 23:04:31,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2022-12-05 23:04:31,651 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 889 flow. Second operand 5 states and 72 transitions. [2022-12-05 23:04:31,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 1296 flow [2022-12-05 23:04:31,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 1278 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:31,907 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 997 flow [2022-12-05 23:04:31,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=997, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2022-12-05 23:04:31,908 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2022-12-05 23:04:31,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:31,908 INFO L89 Accepts]: Start accepts. Operand has 79 places, 81 transitions, 997 flow [2022-12-05 23:04:31,909 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:31,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:31,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 81 transitions, 997 flow [2022-12-05 23:04:31,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 997 flow [2022-12-05 23:04:32,009 INFO L130 PetriNetUnfolder]: 546/1411 cut-off events. [2022-12-05 23:04:32,009 INFO L131 PetriNetUnfolder]: For 8271/8333 co-relation queries the response was YES. [2022-12-05 23:04:32,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7134 conditions, 1411 events. 546/1411 cut-off events. For 8271/8333 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 12124 event pairs, 136 based on Foata normal form. 22/1397 useless extension candidates. Maximal degree in co-relation 7103. Up to 832 conditions per place. [2022-12-05 23:04:32,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 81 transitions, 997 flow [2022-12-05 23:04:32,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-05 23:04:32,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:32,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_368 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_226 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_221 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_369 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_331 256) 0)) .cse3)) (.cse0 (and .cse5 .cse4))) (and (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$r_buff0_thd0~0_220 (ite .cse0 0 v_~z$r_buff0_thd0~0_221)) (= v_~z~0_281 (ite .cse1 v_~z$w_buff0~0_240 (ite .cse2 v_~z$w_buff1~0_225 1))) (= v_~z$w_buff0_used~0_368 (ite .cse1 0 v_~z$w_buff0_used~0_369)) (= v_~y~0_34 1) (= v_~z$w_buff1_used~0_330 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_331)) (= v_~z$r_buff1_thd0~0_225 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_330 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_220 256) 0)))) 0 v_~z$r_buff1_thd0~0_226)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_221, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_369, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_226, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_331, ~z$w_buff1~0=v_~z$w_buff1~0_225, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_220, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_368, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_225, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_330, ~z$w_buff1~0=v_~z$w_buff1~0_225, ~z~0=v_~z~0_281, ~y~0=v_~y~0_34, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z~0, ~y~0] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:32,540 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:04:32,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 632 [2022-12-05 23:04:32,540 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 1023 flow [2022-12-05 23:04:32,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-05 23:04:32,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:32,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:32,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:04:32,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1718536518, now seen corresponding path program 1 times [2022-12-05 23:04:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:32,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762610355] [2022-12-05 23:04:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:32,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762610355] [2022-12-05 23:04:32,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762610355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:32,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:32,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430326043] [2022-12-05 23:04:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:32,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:32,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:32,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:32,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:32,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:32,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:33,407 INFO L130 PetriNetUnfolder]: 4201/6781 cut-off events. [2022-12-05 23:04:33,408 INFO L131 PetriNetUnfolder]: For 45590/45851 co-relation queries the response was YES. [2022-12-05 23:04:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31739 conditions, 6781 events. 4201/6781 cut-off events. For 45590/45851 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 45223 event pairs, 1073 based on Foata normal form. 318/6974 useless extension candidates. Maximal degree in co-relation 31705. Up to 6168 conditions per place. [2022-12-05 23:04:33,436 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 93 selfloop transitions, 5 changer transitions 11/116 dead transitions. [2022-12-05 23:04:33,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 1666 flow [2022-12-05 23:04:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 23:04:33,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:04:33,437 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 1023 flow. Second operand 3 states and 54 transitions. [2022-12-05 23:04:33,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 1666 flow [2022-12-05 23:04:33,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 116 transitions, 1552 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 23:04:33,466 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 825 flow [2022-12-05 23:04:33,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2022-12-05 23:04:33,466 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2022-12-05 23:04:33,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:33,467 INFO L89 Accepts]: Start accepts. Operand has 74 places, 74 transitions, 825 flow [2022-12-05 23:04:33,467 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:33,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:33,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 74 transitions, 825 flow [2022-12-05 23:04:33,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 74 transitions, 825 flow [2022-12-05 23:04:33,698 INFO L130 PetriNetUnfolder]: 1541/3212 cut-off events. [2022-12-05 23:04:33,698 INFO L131 PetriNetUnfolder]: For 10084/10440 co-relation queries the response was YES. [2022-12-05 23:04:33,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12020 conditions, 3212 events. 1541/3212 cut-off events. For 10084/10440 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 28234 event pairs, 619 based on Foata normal form. 72/2988 useless extension candidates. Maximal degree in co-relation 11991. Up to 1890 conditions per place. [2022-12-05 23:04:33,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 74 transitions, 825 flow [2022-12-05 23:04:33,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-05 23:04:33,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_368 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_226 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_221 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_369 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_331 256) 0)) .cse3)) (.cse0 (and .cse5 .cse4))) (and (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$r_buff0_thd0~0_220 (ite .cse0 0 v_~z$r_buff0_thd0~0_221)) (= v_~z~0_281 (ite .cse1 v_~z$w_buff0~0_240 (ite .cse2 v_~z$w_buff1~0_225 1))) (= v_~z$w_buff0_used~0_368 (ite .cse1 0 v_~z$w_buff0_used~0_369)) (= v_~y~0_34 1) (= v_~z$w_buff1_used~0_330 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_331)) (= v_~z$r_buff1_thd0~0_225 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_330 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_220 256) 0)))) 0 v_~z$r_buff1_thd0~0_226)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_221, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_369, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_226, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_331, ~z$w_buff1~0=v_~z$w_buff1~0_225, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_220, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_368, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_225, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_330, ~z$w_buff1~0=v_~z$w_buff1~0_225, ~z~0=v_~z~0_281, ~y~0=v_~y~0_34, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z~0, ~y~0] and [519] L786-->L819: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff0_thd3~0_120 256) 0)))) (let ((.cse1 (and .cse2 (not (= (mod v_~z$w_buff0_used~0_386 256) 0)))) (.cse0 (not (= (mod v_~z$w_buff1_used~0_346 256) 0)))) (and (= v_~z$r_buff0_thd4~0_134 1) (= v_~z$w_buff0_used~0_384 1) (= |v_P3Thread1of1ForFork2_~arg#1.offset_30| |v_P3Thread1of1ForFork2_#in~arg#1.offset_30|) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_384 256) 0)) .cse0)) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34|) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff1_thd4~0_102) (= v_~z$r_buff0_thd1~0_50 v_~z$r_buff1_thd1~0_56) (= v_~a~0_51 1) (= v_~z$w_buff1_used~0_346 (ite .cse1 0 v_~z$w_buff0_used~0_386)) (= v_~z$r_buff0_thd0~0_236 v_~z$r_buff1_thd0~0_241) (= v_~z$w_buff0~0_251 v_~z$w_buff1~0_235) (= v_~z$w_buff0~0_250 2) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_34| 0)) (= v_~z$r_buff0_thd2~0_54 v_~z$r_buff1_thd2~0_54) (= v_~a~0_51 v_~__unbuffered_p3_EAX~0_93) (= (ite .cse1 v_~z$w_buff0~0_251 (ite (and (not (= 0 (mod v_~z$r_buff1_thd3~0_119 256))) (not (= (mod v_~z$w_buff1_used~0_348 256) 0))) v_~z$w_buff1~0_236 v_~z~0_296)) v_~z~0_295) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_34|) (= (ite (and .cse2 .cse0) 0 v_~z$r_buff0_thd3~0_120) v_~z$r_buff0_thd3~0_119) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff1_thd3~0_117) (= |v_P3Thread1of1ForFork2_~arg#1.base_30| |v_P3Thread1of1ForFork2_#in~arg#1.base_30|)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_251, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_30|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_348, ~z$w_buff1~0=v_~z$w_buff1~0_236, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_236, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_30|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_120, ~z~0=v_~z~0_296, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_384, ~z$w_buff0~0=v_~z$w_buff0~0_250, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_117, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_30|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_346, ~z$w_buff1~0=v_~z$w_buff1~0_235, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34|, ~a~0=v_~a~0_51, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_34|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_236, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_30|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_30|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_241, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_56, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_30|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~z~0=v_~z~0_295, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:04:34,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L853-3-->L2-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_87 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [520] $Ultimate##0-->L819: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff0_thd0~0_239 256) 0)))) (let ((.cse2 (not (= (mod v_~z$w_buff1_used~0_352 256) 0))) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_392 256) 0)) .cse1))) (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36| 0)) (= v_~z$w_buff0~0_255 v_~z$w_buff1~0_239) (= v_~z$w_buff0_used~0_390 1) (= |v_P3Thread1of1ForFork2_~arg#1.offset_32| |v_P3Thread1of1ForFork2_#in~arg#1.offset_32|) (= v_~z$w_buff0~0_254 2) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff1_thd4~0_104) (= v_~a~0_53 1) (= v_~a~0_53 v_~__unbuffered_p3_EAX~0_95) (= (ite .cse0 v_~z$w_buff0~0_255 (ite (and (not (= (mod v_~z$r_buff1_thd0~0_245 256) 0)) (not (= (mod v_~z$w_buff1_used~0_354 256) 0))) v_~z$w_buff1~0_240 1)) v_~z~0_299) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= (ite (and .cse1 .cse2) 0 v_~z$r_buff0_thd0~0_239) v_~z$r_buff0_thd0~0_238) (= v_~z$r_buff0_thd0~0_238 v_~z$r_buff1_thd0~0_243) (= v_~z$r_buff0_thd4~0_138 1) (= v_~z$r_buff0_thd2~0_56 v_~z$r_buff1_thd2~0_56) (= v_~z$r_buff0_thd3~0_123 v_~z$r_buff1_thd3~0_123) (= v_~y~0_36 1) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_390 256) 0)) .cse2)) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|) (= (ite .cse0 0 v_~z$w_buff0_used~0_392) v_~z$w_buff1_used~0_352) (= |v_P3Thread1of1ForFork2_~arg#1.base_32| |v_P3Thread1of1ForFork2_#in~arg#1.base_32|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|) (= v_~z$r_buff0_thd1~0_52 v_~z$r_buff1_thd1~0_58)))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_392, ~z$w_buff0~0=v_~z$w_buff0~0_255, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_32|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_354, ~z$w_buff1~0=v_~z$w_buff1~0_240, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_239, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_245, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_104, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~z$w_buff1~0=v_~z$w_buff1~0_239, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|, ~a~0=v_~a~0_53, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_238, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_32|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_243, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_95, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~y~0=v_~y~0_36, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_390, ~z$w_buff0~0=v_~z$w_buff0~0_254, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_352, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_32|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_123, ~z~0=v_~z~0_299, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~y~0] [2022-12-05 23:04:34,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L853-3-->L2-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_87 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [522] $Ultimate##0-->L819: Formula: (let ((.cse8 (not (= (mod v_~z$r_buff0_thd0~0_243 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff0_used~0_402 256) 0)) .cse8))) (let ((.cse4 (ite .cse3 0 v_~z$w_buff0_used~0_402))) (let ((.cse7 (not (= (mod .cse4 256) 0))) (.cse6 (not (= (mod v_~z$r_buff0_thd3~0_126 256) 0)))) (let ((.cse0 (and .cse7 .cse6)) (.cse2 (and .cse7 .cse8)) (.cse5 (not (= (mod v_~z$w_buff1_used~0_362 256) 0)))) (and (= v_~z~0_305 (ite .cse0 v_~z$w_buff0~0_261 (let ((.cse1 (and (not (= (mod v_~z$r_buff1_thd0~0_251 256) 0)) (not (= (mod v_~z$w_buff1_used~0_364 256) 0))))) (ite (and (not (= (mod v_~z$r_buff1_thd3~0_126 256) 0)) (not (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_364) 256) 0))) v_~z$w_buff1~0_246 (ite .cse3 v_~z$w_buff0~0_261 (ite .cse1 v_~z$w_buff1~0_246 1)))))) (= v_~z$w_buff0~0_261 v_~z$w_buff1~0_245) (= v_~z$r_buff0_thd4~0_146 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38| 0)) (= (ite .cse0 0 .cse4) v_~z$w_buff1_used~0_362) (= (ite (and .cse5 .cse6) 0 v_~z$r_buff0_thd3~0_126) v_~z$r_buff0_thd3~0_125) (= v_~y~0_38 1) (= v_~z$r_buff0_thd3~0_125 v_~z$r_buff1_thd3~0_125) (= v_~z$r_buff0_thd1~0_54 v_~z$r_buff1_thd1~0_60) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~z$r_buff0_thd0~0_242 (ite .cse2 0 v_~z$r_buff0_thd0~0_243)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|) (= v_~z$w_buff0~0_260 2) (= v_~z$r_buff0_thd0~0_242 v_~z$r_buff1_thd0~0_249) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~z$r_buff0_thd4~0_147 v_~z$r_buff1_thd4~0_110) (= |v_P3Thread1of1ForFork2_~arg#1.base_34| |v_P3Thread1of1ForFork2_#in~arg#1.base_34|) (= v_~z$w_buff0_used~0_400 1) (= v_~a~0_55 v_~__unbuffered_p3_EAX~0_97) (= |v_P3Thread1of1ForFork2_~arg#1.offset_34| |v_P3Thread1of1ForFork2_#in~arg#1.offset_34|) (= v_~a~0_55 1) (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff1_thd2~0_58) (= (ite (not (and .cse5 (not (= (mod v_~z$w_buff0_used~0_400 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_402, ~z$w_buff0~0=v_~z$w_buff0~0_261, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_364, ~z$w_buff1~0=v_~z$w_buff1~0_246, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_243, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_147, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_126, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_245, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|, ~a~0=v_~a~0_55, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_242, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_97, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_146, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_260, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_125, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_362, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_34|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_60, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_125, ~z~0=v_~z~0_305, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_54, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$r_buff0_thd3~0, ~z~0, ~y~0] [2022-12-05 23:04:34,705 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:04:34,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1239 [2022-12-05 23:04:34,706 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 827 flow [2022-12-05 23:04:34,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:34,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:34,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:34,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:04:34,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 828618288, now seen corresponding path program 1 times [2022-12-05 23:04:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:34,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776863777] [2022-12-05 23:04:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776863777] [2022-12-05 23:04:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776863777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:34,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807612614] [2022-12-05 23:04:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:34,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:34,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:34,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 827 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:34,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:34,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:34,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:35,236 INFO L130 PetriNetUnfolder]: 2108/3671 cut-off events. [2022-12-05 23:04:35,237 INFO L131 PetriNetUnfolder]: For 21905/22081 co-relation queries the response was YES. [2022-12-05 23:04:35,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18655 conditions, 3671 events. 2108/3671 cut-off events. For 21905/22081 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 23879 event pairs, 269 based on Foata normal form. 439/4051 useless extension candidates. Maximal degree in co-relation 18623. Up to 2435 conditions per place. [2022-12-05 23:04:35,250 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 103 selfloop transitions, 9 changer transitions 14/132 dead transitions. [2022-12-05 23:04:35,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 1726 flow [2022-12-05 23:04:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 23:04:35,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-05 23:04:35,252 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 827 flow. Second operand 4 states and 69 transitions. [2022-12-05 23:04:35,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 1726 flow [2022-12-05 23:04:35,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 132 transitions, 1707 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:35,263 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 723 flow [2022-12-05 23:04:35,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=723, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-05 23:04:35,263 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2022-12-05 23:04:35,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:35,264 INFO L89 Accepts]: Start accepts. Operand has 75 places, 68 transitions, 723 flow [2022-12-05 23:04:35,264 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:35,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:35,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 68 transitions, 723 flow [2022-12-05 23:04:35,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 68 transitions, 723 flow [2022-12-05 23:04:35,374 INFO L130 PetriNetUnfolder]: 776/1807 cut-off events. [2022-12-05 23:04:35,374 INFO L131 PetriNetUnfolder]: For 6284/6909 co-relation queries the response was YES. [2022-12-05 23:04:35,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 1807 events. 776/1807 cut-off events. For 6284/6909 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 14821 event pairs, 150 based on Foata normal form. 118/1836 useless extension candidates. Maximal degree in co-relation 7917. Up to 1099 conditions per place. [2022-12-05 23:04:35,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 723 flow [2022-12-05 23:04:35,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-05 23:04:36,097 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:36,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 835 [2022-12-05 23:04:36,098 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 747 flow [2022-12-05 23:04:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:36,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:36,098 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-05 23:04:36,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:04:36,098 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1033835227, now seen corresponding path program 1 times [2022-12-05 23:04:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:36,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079100431] [2022-12-05 23:04:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:36,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079100431] [2022-12-05 23:04:36,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079100431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:36,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:36,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:36,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60461022] [2022-12-05 23:04:36,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:36,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:36,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:36,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:36,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:36,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:36,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:36,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:36,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:36,577 INFO L130 PetriNetUnfolder]: 1290/2281 cut-off events. [2022-12-05 23:04:36,578 INFO L131 PetriNetUnfolder]: For 14943/15129 co-relation queries the response was YES. [2022-12-05 23:04:36,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12768 conditions, 2281 events. 1290/2281 cut-off events. For 14943/15129 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13940 event pairs, 99 based on Foata normal form. 361/2590 useless extension candidates. Maximal degree in co-relation 12735. Up to 1132 conditions per place. [2022-12-05 23:04:36,591 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 98 selfloop transitions, 13 changer transitions 19/135 dead transitions. [2022-12-05 23:04:36,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 1749 flow [2022-12-05 23:04:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-05 23:04:36,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-05 23:04:36,593 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 747 flow. Second operand 5 states and 82 transitions. [2022-12-05 23:04:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 1749 flow [2022-12-05 23:04:36,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 135 transitions, 1645 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-05 23:04:36,608 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 605 flow [2022-12-05 23:04:36,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=605, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2022-12-05 23:04:36,608 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2022-12-05 23:04:36,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:36,608 INFO L89 Accepts]: Start accepts. Operand has 75 places, 61 transitions, 605 flow [2022-12-05 23:04:36,609 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:36,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:36,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 61 transitions, 605 flow [2022-12-05 23:04:36,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 61 transitions, 605 flow [2022-12-05 23:04:36,691 INFO L130 PetriNetUnfolder]: 416/1010 cut-off events. [2022-12-05 23:04:36,692 INFO L131 PetriNetUnfolder]: For 3574/3900 co-relation queries the response was YES. [2022-12-05 23:04:36,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1010 events. 416/1010 cut-off events. For 3574/3900 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 7426 event pairs, 40 based on Foata normal form. 93/1045 useless extension candidates. Maximal degree in co-relation 4536. Up to 565 conditions per place. [2022-12-05 23:04:36,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 61 transitions, 605 flow [2022-12-05 23:04:36,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-05 23:04:37,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:37,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 431 [2022-12-05 23:04:37,039 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 611 flow [2022-12-05 23:04:37,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:37,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:37,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:37,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:04:37,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1294341986, now seen corresponding path program 1 times [2022-12-05 23:04:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061487937] [2022-12-05 23:04:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:37,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061487937] [2022-12-05 23:04:37,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061487937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:37,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:37,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:04:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331294402] [2022-12-05 23:04:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:37,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:37,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 23:04:37,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:37,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:37,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 23:04:37,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:37,498 INFO L130 PetriNetUnfolder]: 1141/1979 cut-off events. [2022-12-05 23:04:37,498 INFO L131 PetriNetUnfolder]: For 11871/12024 co-relation queries the response was YES. [2022-12-05 23:04:37,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11086 conditions, 1979 events. 1141/1979 cut-off events. For 11871/12024 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 11853 event pairs, 87 based on Foata normal form. 149/2079 useless extension candidates. Maximal degree in co-relation 11054. Up to 716 conditions per place. [2022-12-05 23:04:37,509 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 46 selfloop transitions, 17 changer transitions 64/131 dead transitions. [2022-12-05 23:04:37,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 131 transitions, 1629 flow [2022-12-05 23:04:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-05 23:04:37,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2022-12-05 23:04:37,510 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 611 flow. Second operand 6 states and 83 transitions. [2022-12-05 23:04:37,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 131 transitions, 1629 flow [2022-12-05 23:04:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1373 flow, removed 35 selfloop flow, removed 8 redundant places. [2022-12-05 23:04:37,556 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 322 flow [2022-12-05 23:04:37,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2022-12-05 23:04:37,556 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-12-05 23:04:37,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:37,556 INFO L89 Accepts]: Start accepts. Operand has 73 places, 43 transitions, 322 flow [2022-12-05 23:04:37,557 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:37,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:37,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 43 transitions, 322 flow [2022-12-05 23:04:37,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 43 transitions, 322 flow [2022-12-05 23:04:37,572 INFO L130 PetriNetUnfolder]: 65/177 cut-off events. [2022-12-05 23:04:37,572 INFO L131 PetriNetUnfolder]: For 379/404 co-relation queries the response was YES. [2022-12-05 23:04:37,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 177 events. 65/177 cut-off events. For 379/404 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 819 event pairs, 7 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 686. Up to 60 conditions per place. [2022-12-05 23:04:37,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 43 transitions, 322 flow [2022-12-05 23:04:37,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-05 23:04:38,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L756: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_97 1) (= v_~b~0_56 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{~b~0=v_~b~0_56, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_97, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [472] $Ultimate##0-->L768: Formula: (and (= v_~x~0_33 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_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-05 23:04:52,624 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:04:52,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15069 [2022-12-05 23:04:52,625 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 40 transitions, 327 flow [2022-12-05 23:04:52,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:52,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:52,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:04:52,625 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:52,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1674737470, now seen corresponding path program 1 times [2022-12-05 23:04:52,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:52,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476856594] [2022-12-05 23:04:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:52,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:04:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:52,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:04:52,698 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:04:52,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:04:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:04:52,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 23:04:52,701 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:52,705 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:04:52,705 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:04:52,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:04:52 BasicIcfg [2022-12-05 23:04:52,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:04:52,792 INFO L158 Benchmark]: Toolchain (without parser) took 55013.67ms. Allocated memory was 198.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 172.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-05 23:04:52,792 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:04:52,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.12ms. Allocated memory is still 198.2MB. Free memory was 172.0MB in the beginning and 144.2MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:04:52,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.29ms. Allocated memory is still 198.2MB. Free memory was 144.2MB in the beginning and 141.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:04:52,793 INFO L158 Benchmark]: Boogie Preprocessor took 38.20ms. Allocated memory is still 198.2MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:04:52,793 INFO L158 Benchmark]: RCFGBuilder took 753.68ms. Allocated memory is still 198.2MB. Free memory was 139.5MB in the beginning and 106.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-05 23:04:52,793 INFO L158 Benchmark]: TraceAbstraction took 53739.17ms. Allocated memory was 198.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 104.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-05 23:04:52,794 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 412.12ms. Allocated memory is still 198.2MB. Free memory was 172.0MB in the beginning and 144.2MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.29ms. Allocated memory is still 198.2MB. Free memory was 144.2MB in the beginning and 141.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.20ms. Allocated memory is still 198.2MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 753.68ms. Allocated memory is still 198.2MB. Free memory was 139.5MB in the beginning and 106.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 53739.17ms. Allocated memory was 198.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 104.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 2132, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1774, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1774, independent: 1722, independent conditional: 0, independent unconditional: 1722, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 196, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2195, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1774, unknown conditional: 0, unknown unconditional: 1774] , Statistics on independence cache: Total cache size (in pairs): 2775, Positive cache size: 2735, Positive conditional cache size: 0, Positive unconditional cache size: 2735, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 381, independent: 332, independent conditional: 332, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 381, independent: 332, independent conditional: 30, independent unconditional: 302, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 381, independent: 332, independent conditional: 30, independent unconditional: 302, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 332, independent conditional: 30, independent unconditional: 302, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 186, independent: 166, independent conditional: 20, independent unconditional: 146, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 186, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 74, dependent conditional: 15, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 166, independent conditional: 10, independent unconditional: 156, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 186, unknown conditional: 23, unknown unconditional: 163] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 166, Positive conditional cache size: 20, Positive unconditional cache size: 146, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 191, independent conditional: 191, 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: 212, independent: 191, independent conditional: 27, independent unconditional: 164, 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: 212, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 212, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 180, Positive conditional cache size: 20, Positive unconditional cache size: 160, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 161, independent conditional: 28, independent unconditional: 133, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 185, Positive conditional cache size: 20, Positive unconditional cache size: 165, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 175, independent conditional: 43, independent unconditional: 132, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 190, independent: 175, independent conditional: 12, independent unconditional: 163, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 175, independent conditional: 12, independent unconditional: 163, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 190, independent: 173, independent conditional: 10, independent unconditional: 163, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 38, independent unconditional: 106, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 144, independent conditional: 18, independent unconditional: 126, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 18, independent unconditional: 126, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 144, independent conditional: 18, independent unconditional: 126, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 187, Positive conditional cache size: 22, Positive unconditional cache size: 165, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 240, independent conditional: 240, 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: 261, independent: 240, independent conditional: 86, independent unconditional: 154, 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: 261, independent: 240, independent conditional: 37, independent unconditional: 203, 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: 261, independent: 240, independent conditional: 37, independent unconditional: 203, 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: 4, independent: 4, independent conditional: 1, 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: 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 261, independent: 236, independent conditional: 36, independent unconditional: 200, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 191, Positive conditional cache size: 23, Positive unconditional cache size: 168, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 61 PlacesBefore, 60 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1129, independent: 1045, independent conditional: 1045, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1129, independent: 1045, independent conditional: 437, independent unconditional: 608, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1129, independent: 1045, independent conditional: 218, independent unconditional: 827, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1129, independent: 1045, independent conditional: 218, independent unconditional: 827, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 1129, independent: 1035, independent conditional: 215, independent unconditional: 820, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 272, Positive conditional cache size: 26, Positive unconditional cache size: 246, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 219, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 64 PlacesBefore, 64 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 710, independent: 644, independent conditional: 644, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 710, independent: 644, independent conditional: 200, independent unconditional: 444, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 710, independent: 644, independent conditional: 124, independent unconditional: 520, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 710, independent: 644, independent conditional: 124, independent unconditional: 520, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 710, independent: 641, independent conditional: 123, independent unconditional: 518, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 282, Positive conditional cache size: 27, Positive unconditional cache size: 255, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, independent: 421, independent conditional: 421, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 459, independent: 421, independent conditional: 161, independent unconditional: 260, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 459, independent: 421, independent conditional: 115, independent unconditional: 306, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 459, independent: 421, independent conditional: 115, independent unconditional: 306, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 459, independent: 420, independent conditional: 114, independent unconditional: 306, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 283, Positive conditional cache size: 28, Positive unconditional cache size: 255, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 69 PlacesBefore, 69 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1392, independent: 1298, independent conditional: 1298, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1392, independent: 1298, independent conditional: 612, independent unconditional: 686, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1392, independent: 1298, independent conditional: 498, independent unconditional: 800, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1392, independent: 1298, independent conditional: 498, independent unconditional: 800, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 1392, independent: 1294, independent conditional: 495, independent unconditional: 799, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 294, Positive conditional cache size: 31, Positive unconditional cache size: 263, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 73 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1074, independent: 1000, independent conditional: 1000, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1074, independent: 1000, independent conditional: 504, independent unconditional: 496, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1074, independent: 1000, independent conditional: 402, independent unconditional: 598, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1074, independent: 1000, independent conditional: 402, independent unconditional: 598, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1074, independent: 999, independent conditional: 401, independent unconditional: 598, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 363, Positive conditional cache size: 36, Positive unconditional cache size: 327, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 427, independent: 397, independent conditional: 397, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 427, independent: 397, independent conditional: 216, independent unconditional: 181, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 427, independent: 397, independent conditional: 126, independent unconditional: 271, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 427, independent: 397, independent conditional: 126, independent unconditional: 271, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 427, independent: 397, independent conditional: 126, independent unconditional: 271, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 363, Positive conditional cache size: 36, Positive unconditional cache size: 327, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 78 PlacesBefore, 77 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 980, independent: 910, independent conditional: 910, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 980, independent: 910, independent conditional: 518, independent unconditional: 392, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 980, independent: 910, independent conditional: 358, independent unconditional: 552, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 980, independent: 910, independent conditional: 358, independent unconditional: 552, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 980, independent: 903, independent conditional: 351, independent unconditional: 552, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 460, Positive conditional cache size: 47, Positive unconditional cache size: 413, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 74 PlacesBefore, 73 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 78, independent conditional: 78, 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: 78, independent: 78, independent conditional: 66, independent unconditional: 12, 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: 78, independent: 78, independent conditional: 46, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 78, independent conditional: 46, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 2, independent unconditional: 8, 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: 78, independent: 68, independent conditional: 44, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 501, Positive conditional cache size: 49, Positive unconditional cache size: 452, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 75 PlacesBefore, 75 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 67, independent conditional: 67, 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: 67, independent: 67, independent conditional: 54, independent unconditional: 13, 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: 67, independent: 67, independent conditional: 38, independent unconditional: 29, 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: 67, independent: 67, independent conditional: 38, independent unconditional: 29, 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: 67, independent: 67, independent conditional: 38, independent unconditional: 29, 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): 558, Positive cache size: 536, Positive conditional cache size: 49, Positive unconditional cache size: 487, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 75 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 12, independent unconditional: 2, 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: 14, independent: 14, independent conditional: 8, independent unconditional: 6, 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: 14, independent: 14, independent conditional: 8, independent unconditional: 6, 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: 14, independent: 14, independent conditional: 8, independent unconditional: 6, 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): 561, Positive cache size: 539, Positive conditional cache size: 49, Positive unconditional cache size: 490, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.1s, 69 PlacesBefore, 66 PlacesAfterwards, 43 TransitionsBefore, 40 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, 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: 57, independent: 57, independent conditional: 51, independent unconditional: 6, 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: 57, independent: 57, independent conditional: 27, independent unconditional: 30, 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: 57, independent: 57, independent conditional: 27, independent unconditional: 30, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 57, independent: 53, independent conditional: 27, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 658, Positive conditional cache size: 57, Positive unconditional cache size: 601, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-2, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=1, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 [L755] 1 x = 1 [L767] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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: 847]: 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: 53.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 16 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=13, InterpolantAutomatonStates: 74, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:04:52,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...