/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:36:05,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:36:05,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:36:05,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:36:05,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:36:05,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:36:06,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:36:06,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:36:06,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:36:06,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:36:06,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:36:06,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:36:06,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:36:06,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:36:06,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:36:06,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:36:06,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:36:06,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:36:06,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:36:06,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:36:06,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:36:06,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:36:06,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:36:06,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:36:06,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:36:06,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:36:06,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:36:06,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:36:06,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:36:06,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:36:06,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:36:06,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:36:06,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:36:06,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:36:06,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:36:06,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:36:06,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:36:06,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:36:06,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:36:06,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:36:06,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:36:06,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:36:06,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:36:06,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:36:06,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:36:06,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:36:06,073 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:36:06,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:36:06,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:36:06,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:36:06,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:36:06,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:36:06,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:36:06,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:36:06,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:36:06,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:36:06,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:36:06,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:36:06,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:36:06,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:36:06,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:36:06,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:36:06,385 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:36:06,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2022-12-06 04:36:07,474 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:36:07,763 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:36:07,763 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2022-12-06 04:36:07,774 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89632139/b2acca49fb204108a2d5d17ece3fa820/FLAG3fd27a028 [2022-12-06 04:36:07,789 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89632139/b2acca49fb204108a2d5d17ece3fa820 [2022-12-06 04:36:07,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:36:07,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:36:07,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:36:07,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:36:07,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:36:07,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:07" (1/1) ... [2022-12-06 04:36:07,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0f00f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:07, skipping insertion in model container [2022-12-06 04:36:07,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:07" (1/1) ... [2022-12-06 04:36:07,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:36:07,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:36:07,976 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/thin002_rmo.i[988,1001] [2022-12-06 04:36:08,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:36:08,192 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:36:08,201 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/thin002_rmo.i[988,1001] [2022-12-06 04:36:08,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:08,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:08,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:36:08,273 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:36:08,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08 WrapperNode [2022-12-06 04:36:08,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:36:08,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:36:08,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:36:08,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:36:08,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,323 INFO L138 Inliner]: procedures = 177, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-12-06 04:36:08,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:36:08,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:36:08,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:36:08,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:36:08,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:36:08,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:36:08,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:36:08,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:36:08,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (1/1) ... [2022-12-06 04:36:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:36:08,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:36:08,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:36:08,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:36:08,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:36:08,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:36:08,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:36:08,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:36:08,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:36:08,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:36:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:36:08,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:36:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:36:08,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:36:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:36:08,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:36:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:36:08,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:36:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:36:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:36:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:36:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:36:08,493 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:36:08,681 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:36:08,682 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:36:08,989 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:36:09,134 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:36:09,134 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:36:09,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:09 BoogieIcfgContainer [2022-12-06 04:36:09,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:36:09,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:36:09,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:36:09,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:36:09,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:36:07" (1/3) ... [2022-12-06 04:36:09,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdabb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:09, skipping insertion in model container [2022-12-06 04:36:09,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:08" (2/3) ... [2022-12-06 04:36:09,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdabb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:09, skipping insertion in model container [2022-12-06 04:36:09,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:09" (3/3) ... [2022-12-06 04:36:09,142 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-12-06 04:36:09,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:36:09,171 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:36:09,171 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:36:09,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:36:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-12-06 04:36:09,340 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-12-06 04:36:09,340 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:09,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-12-06 04:36:09,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2022-12-06 04:36:09,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 270 flow [2022-12-06 04:36:09,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:09,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-06 04:36:09,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 129 transitions, 270 flow [2022-12-06 04:36:09,434 INFO L130 PetriNetUnfolder]: 1/129 cut-off events. [2022-12-06 04:36:09,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:09,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 1/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:36:09,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-06 04:36:09,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 1822 [2022-12-06 04:36:16,110 INFO L203 LiptonReduction]: Total number of compositions: 106 [2022-12-06 04:36:16,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:36:16,137 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;@5b9180a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:36:16,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:36:16,141 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:36:16,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:16,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:16,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:16,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -288492246, now seen corresponding path program 1 times [2022-12-06 04:36:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:16,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386790263] [2022-12-06 04:36:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386790263] [2022-12-06 04:36:16,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386790263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:16,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:16,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:36:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827385089] [2022-12-06 04:36:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:16,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:36:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:36:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:36:16,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-06 04:36:16,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:16,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:16,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-06 04:36:16,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:16,585 INFO L130 PetriNetUnfolder]: 1217/1808 cut-off events. [2022-12-06 04:36:16,585 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 04:36:16,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1808 events. 1217/1808 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8613 event pairs, 1217 based on Foata normal form. 0/1768 useless extension candidates. Maximal degree in co-relation 3610. Up to 1729 conditions per place. [2022-12-06 04:36:16,597 INFO L137 encePairwiseOnDemand]: 24/25 looper letters, 20 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-12-06 04:36:16,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 100 flow [2022-12-06 04:36:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:36:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:36:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2022-12-06 04:36:16,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 04:36:16,606 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 2 states and 29 transitions. [2022-12-06 04:36:16,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 100 flow [2022-12-06 04:36:16,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:36:16,609 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 56 flow [2022-12-06 04:36:16,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 04:36:16,612 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:36:16,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:16,613 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 56 flow [2022-12-06 04:36:16,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:16,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:16,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 56 flow [2022-12-06 04:36:16,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 56 flow [2022-12-06 04:36:16,620 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:36:16,620 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:16,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:36:16,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 56 flow [2022-12-06 04:36:16,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 04:36:16,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:36:16,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 04:36:16,730 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 56 flow [2022-12-06 04:36:16,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:16,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:16,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:16,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:36:16,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1931842549, now seen corresponding path program 1 times [2022-12-06 04:36:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:16,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151965857] [2022-12-06 04:36:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:16,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:17,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151965857] [2022-12-06 04:36:17,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151965857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:17,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:36:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836053051] [2022-12-06 04:36:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:17,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:36:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:36:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:36:17,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 04:36:17,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 56 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-06 04:36:17,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:17,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 04:36:17,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:17,270 INFO L130 PetriNetUnfolder]: 1106/1733 cut-off events. [2022-12-06 04:36:17,270 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1733 events. 1106/1733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8978 event pairs, 278 based on Foata normal form. 36/1756 useless extension candidates. Maximal degree in co-relation 3388. Up to 1189 conditions per place. [2022-12-06 04:36:17,284 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 29 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 04:36:17,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 142 flow [2022-12-06 04:36:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:36:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:36:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:36:17,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:36:17,285 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 56 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:36:17,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 142 flow [2022-12-06 04:36:17,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:36:17,287 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-06 04:36:17,288 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-06 04:36:17,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:17,288 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:17,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:17,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,296 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:36:17,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:36:17,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 24 events. 0/24 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/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:17,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 04:36:17,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:36:17,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 04:36:17,300 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 64 flow [2022-12-06 04:36:17,300 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-06 04:36:17,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:17,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:17,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:36:17,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash -242423398, now seen corresponding path program 1 times [2022-12-06 04:36:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:17,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110218301] [2022-12-06 04:36:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:17,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110218301] [2022-12-06 04:36:17,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110218301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:17,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:17,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:36:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455903677] [2022-12-06 04:36:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:17,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:36:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:36:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:36:17,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:36:17,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:17,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:17,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:36:17,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:17,861 INFO L130 PetriNetUnfolder]: 1725/2610 cut-off events. [2022-12-06 04:36:17,861 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2022-12-06 04:36:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 2610 events. 1725/2610 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13986 event pairs, 595 based on Foata normal form. 96/2681 useless extension candidates. Maximal degree in co-relation 5592. Up to 878 conditions per place. [2022-12-06 04:36:17,872 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 39 selfloop transitions, 3 changer transitions 3/48 dead transitions. [2022-12-06 04:36:17,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 211 flow [2022-12-06 04:36:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:36:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:36:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 04:36:17,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-06 04:36:17,875 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 64 flow. Second operand 4 states and 59 transitions. [2022-12-06 04:36:17,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 211 flow [2022-12-06 04:36:17,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:36:17,877 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 74 flow [2022-12-06 04:36:17,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 04:36:17,879 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:36:17,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:17,879 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 04:36:17,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:17,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:17,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 04:36:17,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 04:36:17,885 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:36:17,885 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 04:36:17,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 0/24 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:17,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 04:36:17,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 04:36:17,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:17,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 04:36:17,912 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2022-12-06 04:36:17,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:17,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:17,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:36:17,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1301878050, now seen corresponding path program 1 times [2022-12-06 04:36:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:17,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305897207] [2022-12-06 04:36:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305897207] [2022-12-06 04:36:18,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305897207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:18,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:18,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:36:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599960610] [2022-12-06 04:36:18,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:18,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:36:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:36:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:36:18,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:36:18,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:18,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:18,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:36:18,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:18,208 INFO L130 PetriNetUnfolder]: 750/1182 cut-off events. [2022-12-06 04:36:18,208 INFO L131 PetriNetUnfolder]: For 471/471 co-relation queries the response was YES. [2022-12-06 04:36:18,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 1182 events. 750/1182 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5426 event pairs, 222 based on Foata normal form. 12/1187 useless extension candidates. Maximal degree in co-relation 2805. Up to 778 conditions per place. [2022-12-06 04:36:18,214 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 04:36:18,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 152 flow [2022-12-06 04:36:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:36:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:36:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:36:18,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2022-12-06 04:36:18,216 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:36:18,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 152 flow [2022-12-06 04:36:18,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 135 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:36:18,217 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 04:36:18,218 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 04:36:18,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:18,218 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:18,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:18,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,222 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:36:18,223 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:36:18,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:18,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 04:36:18,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:36:18,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:36:18,271 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2022-12-06 04:36:18,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:18,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:18,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:36:18,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1346918910, now seen corresponding path program 1 times [2022-12-06 04:36:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222105981] [2022-12-06 04:36:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:18,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222105981] [2022-12-06 04:36:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222105981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:18,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:18,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:36:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153226232] [2022-12-06 04:36:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:18,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:36:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:36:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:36:18,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:36:18,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:18,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:18,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:36:18,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:18,614 INFO L130 PetriNetUnfolder]: 1323/2040 cut-off events. [2022-12-06 04:36:18,615 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2022-12-06 04:36:18,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4636 conditions, 2040 events. 1323/2040 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10348 event pairs, 489 based on Foata normal form. 48/2070 useless extension candidates. Maximal degree in co-relation 4624. Up to 694 conditions per place. [2022-12-06 04:36:18,622 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 39 selfloop transitions, 3 changer transitions 7/51 dead transitions. [2022-12-06 04:36:18,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 243 flow [2022-12-06 04:36:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:36:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:36:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 04:36:18,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2022-12-06 04:36:18,625 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 4 states and 59 transitions. [2022-12-06 04:36:18,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 243 flow [2022-12-06 04:36:18,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:36:18,627 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 78 flow [2022-12-06 04:36:18,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2022-12-06 04:36:18,629 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:36:18,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:18,629 INFO L89 Accepts]: Start accepts. Operand has 40 places, 23 transitions, 78 flow [2022-12-06 04:36:18,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:18,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:18,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 78 flow [2022-12-06 04:36:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 78 flow [2022-12-06 04:36:18,634 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:36:18,634 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 04:36:18,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 23 events. 0/23 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:18,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 78 flow [2022-12-06 04:36:18,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:36:19,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:19,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 449 [2022-12-06 04:36:19,078 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 76 flow [2022-12-06 04:36:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:19,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:19,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:36:19,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1648795833, now seen corresponding path program 1 times [2022-12-06 04:36:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:19,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299359768] [2022-12-06 04:36:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:19,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299359768] [2022-12-06 04:36:19,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299359768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:19,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:19,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:36:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623806434] [2022-12-06 04:36:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:19,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:36:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:36:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:36:19,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:36:19,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:19,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:19,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:36:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:19,413 INFO L130 PetriNetUnfolder]: 748/1177 cut-off events. [2022-12-06 04:36:19,414 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2022-12-06 04:36:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1177 events. 748/1177 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4911 event pairs, 316 based on Foata normal form. 36/1202 useless extension candidates. Maximal degree in co-relation 2703. Up to 475 conditions per place. [2022-12-06 04:36:19,417 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 29 selfloop transitions, 3 changer transitions 5/38 dead transitions. [2022-12-06 04:36:19,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 185 flow [2022-12-06 04:36:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:36:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:36:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:36:19,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2022-12-06 04:36:19,418 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 76 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:36:19,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 185 flow [2022-12-06 04:36:19,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 173 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:36:19,420 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 78 flow [2022-12-06 04:36:19,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-06 04:36:19,421 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:36:19,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:19,421 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 78 flow [2022-12-06 04:36:19,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:19,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:19,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 78 flow [2022-12-06 04:36:19,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 22 transitions, 78 flow [2022-12-06 04:36:19,425 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:36:19,425 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:36:19,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 22 events. 0/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:19,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 22 transitions, 78 flow [2022-12-06 04:36:19,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 04:36:19,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:19,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:36:19,440 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 76 flow [2022-12-06 04:36:19,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:19,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:19,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:19,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:36:19,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash 266508766, now seen corresponding path program 1 times [2022-12-06 04:36:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454268528] [2022-12-06 04:36:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:20,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454268528] [2022-12-06 04:36:20,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454268528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:20,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:20,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:36:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853303658] [2022-12-06 04:36:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:36:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:36:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:36:20,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:36:20,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 76 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:20,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:20,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:36:20,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:20,432 INFO L130 PetriNetUnfolder]: 386/602 cut-off events. [2022-12-06 04:36:20,432 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2022-12-06 04:36:20,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 602 events. 386/602 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1958 event pairs, 106 based on Foata normal form. 8/610 useless extension candidates. Maximal degree in co-relation 1501. Up to 305 conditions per place. [2022-12-06 04:36:20,434 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 04:36:20,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 176 flow [2022-12-06 04:36:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:36:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:36:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 04:36:20,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 04:36:20,435 INFO L175 Difference]: Start difference. First operand has 39 places, 21 transitions, 76 flow. Second operand 4 states and 35 transitions. [2022-12-06 04:36:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 176 flow [2022-12-06 04:36:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 160 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 04:36:20,438 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 70 flow [2022-12-06 04:36:20,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2022-12-06 04:36:20,438 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 04:36:20,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:20,438 INFO L89 Accepts]: Start accepts. Operand has 38 places, 21 transitions, 70 flow [2022-12-06 04:36:20,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:20,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:20,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 70 flow [2022-12-06 04:36:20,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 70 flow [2022-12-06 04:36:20,442 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:36:20,442 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:36:20,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:36:20,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 70 flow [2022-12-06 04:36:20,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 04:36:20,487 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:20,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:36:20,488 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 68 flow [2022-12-06 04:36:20,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:20,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:20,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:20,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:36:20,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2128923819, now seen corresponding path program 1 times [2022-12-06 04:36:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:20,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479236937] [2022-12-06 04:36:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:20,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479236937] [2022-12-06 04:36:20,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479236937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:20,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:20,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:36:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532444104] [2022-12-06 04:36:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:20,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:36:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:36:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:36:20,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:36:20,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:20,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:20,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:36:20,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:20,765 INFO L130 PetriNetUnfolder]: 341/558 cut-off events. [2022-12-06 04:36:20,765 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 04:36:20,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 558 events. 341/558 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2043 event pairs, 108 based on Foata normal form. 39/597 useless extension candidates. Maximal degree in co-relation 1348. Up to 432 conditions per place. [2022-12-06 04:36:20,768 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 29 selfloop transitions, 5 changer transitions 18/52 dead transitions. [2022-12-06 04:36:20,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 273 flow [2022-12-06 04:36:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:36:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:36:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 04:36:20,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 04:36:20,769 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 68 flow. Second operand 5 states and 54 transitions. [2022-12-06 04:36:20,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 273 flow [2022-12-06 04:36:20,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 251 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 04:36:20,770 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 103 flow [2022-12-06 04:36:20,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-12-06 04:36:20,771 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:36:20,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:20,771 INFO L89 Accepts]: Start accepts. Operand has 40 places, 24 transitions, 103 flow [2022-12-06 04:36:20,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:20,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:20,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 103 flow [2022-12-06 04:36:20,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 103 flow [2022-12-06 04:36:20,785 INFO L130 PetriNetUnfolder]: 73/146 cut-off events. [2022-12-06 04:36:20,785 INFO L131 PetriNetUnfolder]: For 80/158 co-relation queries the response was YES. [2022-12-06 04:36:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 146 events. 73/146 cut-off events. For 80/158 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 561 event pairs, 40 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 390. Up to 104 conditions per place. [2022-12-06 04:36:20,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 103 flow [2022-12-06 04:36:20,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 04:36:21,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:21,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 507 [2022-12-06 04:36:21,278 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 104 flow [2022-12-06 04:36:21,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:21,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:21,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:21,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:36:21,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash -605545116, now seen corresponding path program 1 times [2022-12-06 04:36:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:21,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521491876] [2022-12-06 04:36:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521491876] [2022-12-06 04:36:21,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521491876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:21,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:21,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:36:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870828987] [2022-12-06 04:36:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:36:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:36:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:36:21,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:36:21,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:21,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:21,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:36:21,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:21,574 INFO L130 PetriNetUnfolder]: 235/413 cut-off events. [2022-12-06 04:36:21,575 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-12-06 04:36:21,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 413 events. 235/413 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1485 event pairs, 37 based on Foata normal form. 33/446 useless extension candidates. Maximal degree in co-relation 1441. Up to 242 conditions per place. [2022-12-06 04:36:21,577 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 36 selfloop transitions, 9 changer transitions 16/61 dead transitions. [2022-12-06 04:36:21,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 380 flow [2022-12-06 04:36:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:36:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:36:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 04:36:21,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:36:21,580 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 104 flow. Second operand 6 states and 63 transitions. [2022-12-06 04:36:21,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 380 flow [2022-12-06 04:36:21,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 373 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:36:21,584 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 169 flow [2022-12-06 04:36:21,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:36:21,584 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 04:36:21,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:21,585 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 169 flow [2022-12-06 04:36:21,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:21,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:21,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 169 flow [2022-12-06 04:36:21,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 169 flow [2022-12-06 04:36:21,597 INFO L130 PetriNetUnfolder]: 49/114 cut-off events. [2022-12-06 04:36:21,598 INFO L131 PetriNetUnfolder]: For 248/344 co-relation queries the response was YES. [2022-12-06 04:36:21,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 114 events. 49/114 cut-off events. For 248/344 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 391 event pairs, 13 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 440. Up to 76 conditions per place. [2022-12-06 04:36:21,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 169 flow [2022-12-06 04:36:21,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:36:21,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:36:21,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:36:21,633 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 171 flow [2022-12-06 04:36:21,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:21,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:21,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:21,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:36:21,633 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1938812737, now seen corresponding path program 1 times [2022-12-06 04:36:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20304301] [2022-12-06 04:36:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:21,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20304301] [2022-12-06 04:36:21,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20304301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:21,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:21,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:36:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517552944] [2022-12-06 04:36:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:36:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:36:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:36:21,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:36:21,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:21,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:21,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:36:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:22,025 INFO L130 PetriNetUnfolder]: 140/270 cut-off events. [2022-12-06 04:36:22,025 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-06 04:36:22,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 270 events. 140/270 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 899 event pairs, 15 based on Foata normal form. 20/290 useless extension candidates. Maximal degree in co-relation 1177. Up to 147 conditions per place. [2022-12-06 04:36:22,028 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 40 selfloop transitions, 13 changer transitions 14/67 dead transitions. [2022-12-06 04:36:22,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 513 flow [2022-12-06 04:36:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:36:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:36:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-06 04:36:22,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44805194805194803 [2022-12-06 04:36:22,029 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 171 flow. Second operand 7 states and 69 transitions. [2022-12-06 04:36:22,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 513 flow [2022-12-06 04:36:22,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 451 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 04:36:22,032 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 221 flow [2022-12-06 04:36:22,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-12-06 04:36:22,033 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-06 04:36:22,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:22,033 INFO L89 Accepts]: Start accepts. Operand has 47 places, 32 transitions, 221 flow [2022-12-06 04:36:22,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:22,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:22,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 221 flow [2022-12-06 04:36:22,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 221 flow [2022-12-06 04:36:22,045 INFO L130 PetriNetUnfolder]: 25/75 cut-off events. [2022-12-06 04:36:22,045 INFO L131 PetriNetUnfolder]: For 163/187 co-relation queries the response was YES. [2022-12-06 04:36:22,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 75 events. 25/75 cut-off events. For 163/187 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 202 event pairs, 2 based on Foata normal form. 4/75 useless extension candidates. Maximal degree in co-relation 281. Up to 42 conditions per place. [2022-12-06 04:36:22,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 221 flow [2022-12-06 04:36:22,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 04:36:22,047 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:36:22,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:36:22,048 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 221 flow [2022-12-06 04:36:22,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:22,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:22,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:22,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:36:22,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -28802460, now seen corresponding path program 1 times [2022-12-06 04:36:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429866144] [2022-12-06 04:36:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:36:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:36:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:36:22,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429866144] [2022-12-06 04:36:22,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429866144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:36:22,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:36:22,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:36:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982404723] [2022-12-06 04:36:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:36:22,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:36:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:36:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:36:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:36:22,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:36:22,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:22,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:36:22,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:36:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:36:22,504 INFO L130 PetriNetUnfolder]: 104/204 cut-off events. [2022-12-06 04:36:22,504 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 04:36:22,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 204 events. 104/204 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 613 event pairs, 12 based on Foata normal form. 7/211 useless extension candidates. Maximal degree in co-relation 835. Up to 86 conditions per place. [2022-12-06 04:36:22,507 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 36 selfloop transitions, 17 changer transitions 7/60 dead transitions. [2022-12-06 04:36:22,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 469 flow [2022-12-06 04:36:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:36:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:36:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-12-06 04:36:22,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2022-12-06 04:36:22,508 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 221 flow. Second operand 8 states and 62 transitions. [2022-12-06 04:36:22,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 469 flow [2022-12-06 04:36:22,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 399 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-12-06 04:36:22,513 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 211 flow [2022-12-06 04:36:22,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2022-12-06 04:36:22,513 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-06 04:36:22,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:36:22,514 INFO L89 Accepts]: Start accepts. Operand has 49 places, 32 transitions, 211 flow [2022-12-06 04:36:22,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:36:22,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:22,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 211 flow [2022-12-06 04:36:22,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 211 flow [2022-12-06 04:36:22,524 INFO L130 PetriNetUnfolder]: 17/55 cut-off events. [2022-12-06 04:36:22,525 INFO L131 PetriNetUnfolder]: For 93/102 co-relation queries the response was YES. [2022-12-06 04:36:22,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 55 events. 17/55 cut-off events. For 93/102 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 110 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 171. Up to 18 conditions per place. [2022-12-06 04:36:22,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 211 flow [2022-12-06 04:36:22,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 04:36:25,338 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:36:25,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2825 [2022-12-06 04:36:25,339 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 208 flow [2022-12-06 04:36:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:36:25,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:36:25,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:25,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:36:25,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:36:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:36:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1364404570, now seen corresponding path program 1 times [2022-12-06 04:36:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:36:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960248707] [2022-12-06 04:36:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:36:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:36:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:36:25,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:36:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:36:25,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:36:25,496 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:36:25,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:36:25,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 04:36:25,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:36:25,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:36:25,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 04:36:25,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:36:25,498 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:36:25,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:36:25,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:36:25,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:36:25 BasicIcfg [2022-12-06 04:36:25,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:36:25,595 INFO L158 Benchmark]: Toolchain (without parser) took 17803.53ms. Allocated memory was 199.2MB in the beginning and 519.0MB in the end (delta: 319.8MB). Free memory was 173.4MB in the beginning and 382.9MB in the end (delta: -209.4MB). Peak memory consumption was 109.8MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,595 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory was 175.8MB in the beginning and 175.7MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:36:25,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.20ms. Allocated memory is still 199.2MB. Free memory was 172.9MB in the beginning and 146.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.96ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,596 INFO L158 Benchmark]: Boogie Preprocessor took 53.11ms. Allocated memory is still 199.2MB. Free memory was 143.5MB in the beginning and 141.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,596 INFO L158 Benchmark]: RCFGBuilder took 758.89ms. Allocated memory was 199.2MB in the beginning and 249.6MB in the end (delta: 50.3MB). Free memory was 141.5MB in the beginning and 222.6MB in the end (delta: -81.1MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,597 INFO L158 Benchmark]: TraceAbstraction took 16456.64ms. Allocated memory was 249.6MB in the beginning and 519.0MB in the end (delta: 269.5MB). Free memory was 221.5MB in the beginning and 382.9MB in the end (delta: -161.4MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-12-06 04:36:25,598 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory was 175.8MB in the beginning and 175.7MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.20ms. Allocated memory is still 199.2MB. Free memory was 172.9MB in the beginning and 146.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.96ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.11ms. Allocated memory is still 199.2MB. Free memory was 143.5MB in the beginning and 141.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 758.89ms. Allocated memory was 199.2MB in the beginning and 249.6MB in the end (delta: 50.3MB). Free memory was 141.5MB in the beginning and 222.6MB in the end (delta: -81.1MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16456.64ms. Allocated memory was 249.6MB in the beginning and 519.0MB in the end (delta: 269.5MB). Free memory was 221.5MB in the beginning and 382.9MB in the end (delta: -161.4MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 141 PlacesBefore, 37 PlacesAfterwards, 129 TransitionsBefore, 25 TransitionsAfterwards, 1822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 106 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1308, independent: 1252, independent conditional: 1252, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1308, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1308, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1308, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1098, independent: 1056, independent conditional: 0, independent unconditional: 1056, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1098, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1308, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1098, unknown conditional: 0, unknown unconditional: 1098] , Statistics on independence cache: Total cache size (in pairs): 1520, Positive cache size: 1478, Positive conditional cache size: 0, Positive unconditional cache size: 1478, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 100, unknown conditional: 0, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 2, independent unconditional: 79, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 101, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 19, Negative conditional cache size: 0, 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: 0.0s, 39 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 159, independent conditional: 23, independent unconditional: 136, dependent: 35, dependent conditional: 2, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 38, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 64, 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: 80, independent: 64, independent conditional: 6, independent unconditional: 58, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 64, independent conditional: 0, independent unconditional: 64, 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: 80, independent: 64, independent conditional: 0, independent unconditional: 64, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 123, independent conditional: 34, independent unconditional: 89, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 150, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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, 40 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 66, independent conditional: 10, independent unconditional: 56, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 37 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 66, independent conditional: 20, independent unconditional: 46, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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.5s, 38 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 16, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 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: 28, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 189, Positive conditional cache size: 1, Positive unconditional cache size: 188, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 23, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 39, independent conditional: 21, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 21, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 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: 47, independent: 37, independent conditional: 20, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 198, Positive conditional cache size: 2, Positive unconditional cache size: 196, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 27, independent conditional: 22, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 206, Positive conditional cache size: 10, Positive unconditional cache size: 196, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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: 2.8s, 47 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 39, independent conditional: 20, independent unconditional: 19, 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: 39, independent: 39, independent conditional: 20, independent unconditional: 19, 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: 2, 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: 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: 39, independent: 35, independent conditional: 18, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 249, Positive conditional cache size: 12, Positive unconditional cache size: 237, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=10, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=11, t2721={7:0}, t2722={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=12, t2721={7:0}, t2722={8:0}, t2723={9:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=13, t2721={7:0}, t2722={8:0}, t2723={9:0}, t2724={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x [L805] 2 y = 1 [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L817] 3 __unbuffered_p2_EAX = y [L820] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z [L835] 4 a = 1 [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 5 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: 16.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 3 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:36:25,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...