/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/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:20:21,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:20:21,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:20:21,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:20:21,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:20:21,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:20:21,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:20:21,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:20:21,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:20:21,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:20:21,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:20:21,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:20:21,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:20:21,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:20:21,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:20:21,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:20:21,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:20:21,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:20:21,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:20:21,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:20:21,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:20:21,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:20:21,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:20:21,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:20:21,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:20:21,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:20:21,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:20:21,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:20:21,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:20:21,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:20:21,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:20:21,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:20:21,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:20:21,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:20:21,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:20:21,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:20:21,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:20:21,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:20:21,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:20:21,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:20:21,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:20:21,176 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-13 09:20:21,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:20:21,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:20:21,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:20:21,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:20:21,205 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:20:21,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:20:21,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:20:21,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:20:21,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:20:21,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:20:21,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:21,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:20:21,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:20:21,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:20:21,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:20:21,208 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-13 09:20:21,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:20:21,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:20:21,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:20:21,501 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:20:21,502 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:20:21,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-13 09:20:22,443 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:20:22,632 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:20:22,632 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-13 09:20:22,647 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4f9931d/e4f111d298a54f85adefe290273bf61d/FLAG726927040 [2022-12-13 09:20:22,660 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4f9931d/e4f111d298a54f85adefe290273bf61d [2022-12-13 09:20:22,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:20:22,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:20:22,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:22,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:20:22,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:20:22,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:22" (1/1) ... [2022-12-13 09:20:22,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ff9bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:22, skipping insertion in model container [2022-12-13 09:20:22,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:22" (1/1) ... [2022-12-13 09:20:22,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:20:22,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:20:22,842 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-13 09:20:22,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:22,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:22,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:23,049 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:20:23,057 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-13 09:20:23,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:23,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:23,125 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:20:23,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23 WrapperNode [2022-12-13 09:20:23,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:23,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:23,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:20:23,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:20:23,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,177 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 09:20:23,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:23,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:20:23,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:20:23,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:20:23,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,202 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:20:23,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:20:23,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:20:23,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:20:23,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (1/1) ... [2022-12-13 09:20:23,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:20:23,242 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-13 09:20:23,258 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-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:20:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:20:23,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:20:23,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:20:23,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:20:23,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:20:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:20:23,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:20:23,283 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:20:23,437 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:20:23,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:20:23,724 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:20:23,812 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:20:23,812 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:20:23,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:23 BoogieIcfgContainer [2022-12-13 09:20:23,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:20:23,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:20:23,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:20:23,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:20:23,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:20:22" (1/3) ... [2022-12-13 09:20:23,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:23, skipping insertion in model container [2022-12-13 09:20:23,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:23" (2/3) ... [2022-12-13 09:20:23,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:23, skipping insertion in model container [2022-12-13 09:20:23,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:23" (3/3) ... [2022-12-13 09:20:23,821 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-12-13 09:20:23,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:20:23,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:20:23,833 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:20:23,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:20:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 09:20:23,936 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:20:23,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 09:20:23,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 09:20:23,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 09:20:23,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:23,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 09:20:23,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 09:20:23,988 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:20:23,989 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:23,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 09:20:23,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 09:20:23,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-13 09:20:29,268 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 09:20:29,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:20:29,285 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;@2de2044e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:20:29,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:20:29,289 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 09:20:29,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:29,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:29,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:29,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -710551530, now seen corresponding path program 1 times [2022-12-13 09:20:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144050081] [2022-12-13 09:20:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144050081] [2022-12-13 09:20:29,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144050081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:29,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:29,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361153113] [2022-12-13 09:20:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:29,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:29,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 71 [2022-12-13 09:20:29,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-13 09:20:29,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:29,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 71 [2022-12-13 09:20:29,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:34,085 INFO L130 PetriNetUnfolder]: 43504/62894 cut-off events. [2022-12-13 09:20:34,086 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 09:20:34,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120803 conditions, 62894 events. 43504/62894 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 474314 event pairs, 11360 based on Foata normal form. 0/38728 useless extension candidates. Maximal degree in co-relation 120791. Up to 48285 conditions per place. [2022-12-13 09:20:34,260 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 40 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2022-12-13 09:20:34,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-13 09:20:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-12-13 09:20:34,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2022-12-13 09:20:34,270 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 154 flow. Second operand 3 states and 146 transitions. [2022-12-13 09:20:34,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 111 transitions, 429 flow [2022-12-13 09:20:34,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 111 transitions, 424 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:34,276 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 94 flow [2022-12-13 09:20:34,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=79, PETRI_TRANSITIONS=41} [2022-12-13 09:20:34,280 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2022-12-13 09:20:34,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:34,281 INFO L89 Accepts]: Start accepts. Operand has 79 places, 41 transitions, 94 flow [2022-12-13 09:20:34,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:34,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:34,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 41 transitions, 94 flow [2022-12-13 09:20:34,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2022-12-13 09:20:34,290 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-13 09:20:34,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:34,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:20:34,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 94 flow [2022-12-13 09:20:34,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-13 09:20:34,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:34,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 09:20:34,449 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2022-12-13 09:20:34,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-13 09:20:34,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:34,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:34,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:20:34,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1665542740, now seen corresponding path program 1 times [2022-12-13 09:20:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:34,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189110343] [2022-12-13 09:20:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:34,600 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-13 09:20:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:34,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189110343] [2022-12-13 09:20:34,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189110343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:34,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:34,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094042302] [2022-12-13 09:20:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:34,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:34,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 09:20:34,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 09:20:34,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:34,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 09:20:34,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:36,138 INFO L130 PetriNetUnfolder]: 16980/23608 cut-off events. [2022-12-13 09:20:36,139 INFO L131 PetriNetUnfolder]: For 913/913 co-relation queries the response was YES. [2022-12-13 09:20:36,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47466 conditions, 23608 events. 16980/23608 cut-off events. For 913/913 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 129944 event pairs, 8259 based on Foata normal form. 0/18657 useless extension candidates. Maximal degree in co-relation 47456. Up to 22336 conditions per place. [2022-12-13 09:20:36,264 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 2/58 dead transitions. [2022-12-13 09:20:36,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 232 flow [2022-12-13 09:20:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 09:20:36,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2022-12-13 09:20:36,267 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 94 flow. Second operand 3 states and 79 transitions. [2022-12-13 09:20:36,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 232 flow [2022-12-13 09:20:36,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:36,270 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 121 flow [2022-12-13 09:20:36,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-13 09:20:36,271 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2022-12-13 09:20:36,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:36,271 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 121 flow [2022-12-13 09:20:36,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:36,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:36,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 121 flow [2022-12-13 09:20:36,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 121 flow [2022-12-13 09:20:36,286 INFO L130 PetriNetUnfolder]: 45/204 cut-off events. [2022-12-13 09:20:36,286 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:36,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 204 events. 45/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1078 event pairs, 23 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 287. Up to 76 conditions per place. [2022-12-13 09:20:36,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 121 flow [2022-12-13 09:20:36,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 1024 [2022-12-13 09:20:36,336 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:36,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 09:20:36,337 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 121 flow [2022-12-13 09:20:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 09:20:36,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:36,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:36,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:20:36,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 851446441, now seen corresponding path program 1 times [2022-12-13 09:20:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580973306] [2022-12-13 09:20:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:36,500 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-13 09:20:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:36,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580973306] [2022-12-13 09:20:36,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580973306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:36,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:36,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:20:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77883065] [2022-12-13 09:20:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:36,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:36,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:20:36,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-13 09:20:36,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:36,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:20:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:37,749 INFO L130 PetriNetUnfolder]: 12559/17572 cut-off events. [2022-12-13 09:20:37,749 INFO L131 PetriNetUnfolder]: For 2799/2799 co-relation queries the response was YES. [2022-12-13 09:20:37,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38491 conditions, 17572 events. 12559/17572 cut-off events. For 2799/2799 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 92220 event pairs, 3481 based on Foata normal form. 284/14854 useless extension candidates. Maximal degree in co-relation 38480. Up to 12401 conditions per place. [2022-12-13 09:20:37,882 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 46 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 09:20:37,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 255 flow [2022-12-13 09:20:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 09:20:37,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 09:20:37,886 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 121 flow. Second operand 3 states and 76 transitions. [2022-12-13 09:20:37,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 255 flow [2022-12-13 09:20:37,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:20:37,887 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 09:20:37,889 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -29 predicate places. [2022-12-13 09:20:37,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:37,889 INFO L89 Accepts]: Start accepts. Operand has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:37,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:37,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,903 INFO L130 PetriNetUnfolder]: 29/131 cut-off events. [2022-12-13 09:20:37,904 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 09:20:37,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 131 events. 29/131 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 612 event pairs, 11 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 211. Up to 53 conditions per place. [2022-12-13 09:20:37,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 09:20:37,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:37,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 09:20:37,914 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 127 flow [2022-12-13 09:20:37,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-13 09:20:37,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:37,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:37,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:20:37,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1437862159, now seen corresponding path program 1 times [2022-12-13 09:20:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040374967] [2022-12-13 09:20:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:38,087 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-13 09:20:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040374967] [2022-12-13 09:20:38,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040374967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:38,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:38,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386445319] [2022-12-13 09:20:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:38,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:38,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:20:38,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-13 09:20:38,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:38,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:20:38,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:39,855 INFO L130 PetriNetUnfolder]: 20595/28741 cut-off events. [2022-12-13 09:20:39,855 INFO L131 PetriNetUnfolder]: For 4386/4479 co-relation queries the response was YES. [2022-12-13 09:20:39,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62037 conditions, 28741 events. 20595/28741 cut-off events. For 4386/4479 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 174841 event pairs, 6058 based on Foata normal form. 1648/20084 useless extension candidates. Maximal degree in co-relation 62024. Up to 22708 conditions per place. [2022-12-13 09:20:39,973 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 70 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2022-12-13 09:20:39,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 109 transitions, 463 flow [2022-12-13 09:20:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 09:20:39,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 09:20:39,974 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 127 flow. Second operand 5 states and 146 transitions. [2022-12-13 09:20:39,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 109 transitions, 463 flow [2022-12-13 09:20:39,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:39,977 INFO L231 Difference]: Finished difference. Result has 59 places, 69 transitions, 316 flow [2022-12-13 09:20:39,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2022-12-13 09:20:39,978 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2022-12-13 09:20:39,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:39,978 INFO L89 Accepts]: Start accepts. Operand has 59 places, 69 transitions, 316 flow [2022-12-13 09:20:39,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:39,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:39,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 69 transitions, 316 flow [2022-12-13 09:20:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 69 transitions, 316 flow [2022-12-13 09:20:40,279 INFO L130 PetriNetUnfolder]: 4760/7220 cut-off events. [2022-12-13 09:20:40,279 INFO L131 PetriNetUnfolder]: For 1660/4408 co-relation queries the response was YES. [2022-12-13 09:20:40,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20845 conditions, 7220 events. 4760/7220 cut-off events. For 1660/4408 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 52223 event pairs, 2607 based on Foata normal form. 2/3064 useless extension candidates. Maximal degree in co-relation 20832. Up to 6158 conditions per place. [2022-12-13 09:20:40,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 69 transitions, 316 flow [2022-12-13 09:20:40,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 1528 [2022-12-13 09:20:41,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:41,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1445 [2022-12-13 09:20:41,423 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 68 transitions, 310 flow [2022-12-13 09:20:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-13 09:20:41,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:41,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:41,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:20:41,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1733598467, now seen corresponding path program 1 times [2022-12-13 09:20:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:41,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078540898] [2022-12-13 09:20:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:41,573 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-13 09:20:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078540898] [2022-12-13 09:20:41,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078540898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:41,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:41,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385223823] [2022-12-13 09:20:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:41,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:41,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:41,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:20:41,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 68 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-13 09:20:41,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:41,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:20:41,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:43,080 INFO L130 PetriNetUnfolder]: 14841/21690 cut-off events. [2022-12-13 09:20:43,080 INFO L131 PetriNetUnfolder]: For 8212/8239 co-relation queries the response was YES. [2022-12-13 09:20:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71911 conditions, 21690 events. 14841/21690 cut-off events. For 8212/8239 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 138861 event pairs, 2065 based on Foata normal form. 1521/15687 useless extension candidates. Maximal degree in co-relation 71895. Up to 14365 conditions per place. [2022-12-13 09:20:43,202 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 80 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-12-13 09:20:43,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 131 transitions, 788 flow [2022-12-13 09:20:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2022-12-13 09:20:43,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2022-12-13 09:20:43,203 INFO L175 Difference]: Start difference. First operand has 59 places, 68 transitions, 310 flow. Second operand 6 states and 179 transitions. [2022-12-13 09:20:43,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 131 transitions, 788 flow [2022-12-13 09:20:43,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 773 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:43,403 INFO L231 Difference]: Finished difference. Result has 63 places, 81 transitions, 551 flow [2022-12-13 09:20:43,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=551, PETRI_PLACES=63, PETRI_TRANSITIONS=81} [2022-12-13 09:20:43,404 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-13 09:20:43,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:43,404 INFO L89 Accepts]: Start accepts. Operand has 63 places, 81 transitions, 551 flow [2022-12-13 09:20:43,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:43,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:43,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 81 transitions, 551 flow [2022-12-13 09:20:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 81 transitions, 551 flow [2022-12-13 09:20:43,723 INFO L130 PetriNetUnfolder]: 3833/6112 cut-off events. [2022-12-13 09:20:43,723 INFO L131 PetriNetUnfolder]: For 5034/11343 co-relation queries the response was YES. [2022-12-13 09:20:43,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27997 conditions, 6112 events. 3833/6112 cut-off events. For 5034/11343 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 45298 event pairs, 1059 based on Foata normal form. 11/2696 useless extension candidates. Maximal degree in co-relation 27981. Up to 5257 conditions per place. [2022-12-13 09:20:43,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 81 transitions, 551 flow [2022-12-13 09:20:43,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 1868 [2022-12-13 09:20:44,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:44,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1287 [2022-12-13 09:20:44,691 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 80 transitions, 543 flow [2022-12-13 09:20:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-13 09:20:44,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:44,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:44,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:20:44,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -830501697, now seen corresponding path program 1 times [2022-12-13 09:20:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575735511] [2022-12-13 09:20:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:44,844 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-13 09:20:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575735511] [2022-12-13 09:20:44,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575735511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:44,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:44,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183003392] [2022-12-13 09:20:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:44,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:44,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:44,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:20:44,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 80 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-13 09:20:44,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:44,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:20:44,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:46,721 INFO L130 PetriNetUnfolder]: 20028/29384 cut-off events. [2022-12-13 09:20:46,721 INFO L131 PetriNetUnfolder]: For 45471/49886 co-relation queries the response was YES. [2022-12-13 09:20:46,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127633 conditions, 29384 events. 20028/29384 cut-off events. For 45471/49886 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 193412 event pairs, 3746 based on Foata normal form. 1354/25426 useless extension candidates. Maximal degree in co-relation 127614. Up to 16589 conditions per place. [2022-12-13 09:20:46,941 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 127 selfloop transitions, 11 changer transitions 4/160 dead transitions. [2022-12-13 09:20:46,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 160 transitions, 1234 flow [2022-12-13 09:20:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-13 09:20:46,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6625 [2022-12-13 09:20:46,942 INFO L175 Difference]: Start difference. First operand has 63 places, 80 transitions, 543 flow. Second operand 6 states and 159 transitions. [2022-12-13 09:20:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 160 transitions, 1234 flow [2022-12-13 09:20:48,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 160 transitions, 1012 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:49,001 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 373 flow [2022-12-13 09:20:49,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2022-12-13 09:20:49,002 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2022-12-13 09:20:49,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:49,002 INFO L89 Accepts]: Start accepts. Operand has 64 places, 73 transitions, 373 flow [2022-12-13 09:20:49,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:49,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:49,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 73 transitions, 373 flow [2022-12-13 09:20:49,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 73 transitions, 373 flow [2022-12-13 09:20:49,682 INFO L130 PetriNetUnfolder]: 5680/8905 cut-off events. [2022-12-13 09:20:49,682 INFO L131 PetriNetUnfolder]: For 5254/6973 co-relation queries the response was YES. [2022-12-13 09:20:49,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31549 conditions, 8905 events. 5680/8905 cut-off events. For 5254/6973 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 66240 event pairs, 1802 based on Foata normal form. 18/4083 useless extension candidates. Maximal degree in co-relation 31533. Up to 7534 conditions per place. [2022-12-13 09:20:49,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 73 transitions, 373 flow [2022-12-13 09:20:49,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 1680 [2022-12-13 09:20:49,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [360] L755-->L758: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 09:20:49,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 09:20:49,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 09:20:50,376 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:20:50,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1375 [2022-12-13 09:20:50,377 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 377 flow [2022-12-13 09:20:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-13 09:20:50,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:50,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:50,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:20:50,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1703665939, now seen corresponding path program 1 times [2022-12-13 09:20:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208008201] [2022-12-13 09:20:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:50,529 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-13 09:20:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:50,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208008201] [2022-12-13 09:20:50,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208008201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:50,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:50,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:20:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034530878] [2022-12-13 09:20:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:20:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:20:50,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:20:50,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 09:20:50,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 09:20:50,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:50,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 09:20:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:52,075 INFO L130 PetriNetUnfolder]: 12996/20121 cut-off events. [2022-12-13 09:20:52,075 INFO L131 PetriNetUnfolder]: For 12184/12332 co-relation queries the response was YES. [2022-12-13 09:20:52,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75190 conditions, 20121 events. 12996/20121 cut-off events. For 12184/12332 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 142521 event pairs, 710 based on Foata normal form. 1757/14234 useless extension candidates. Maximal degree in co-relation 75171. Up to 11881 conditions per place. [2022-12-13 09:20:52,155 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 74 selfloop transitions, 50 changer transitions 18/156 dead transitions. [2022-12-13 09:20:52,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 156 transitions, 1096 flow [2022-12-13 09:20:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:20:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:20:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2022-12-13 09:20:52,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2022-12-13 09:20:52,157 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 377 flow. Second operand 7 states and 214 transitions. [2022-12-13 09:20:52,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 156 transitions, 1096 flow [2022-12-13 09:20:52,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 156 transitions, 1096 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:52,186 INFO L231 Difference]: Finished difference. Result has 72 places, 97 transitions, 755 flow [2022-12-13 09:20:52,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=755, PETRI_PLACES=72, PETRI_TRANSITIONS=97} [2022-12-13 09:20:52,187 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2022-12-13 09:20:52,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:52,187 INFO L89 Accepts]: Start accepts. Operand has 72 places, 97 transitions, 755 flow [2022-12-13 09:20:52,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:52,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:52,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 97 transitions, 755 flow [2022-12-13 09:20:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 97 transitions, 755 flow [2022-12-13 09:20:52,534 INFO L130 PetriNetUnfolder]: 3620/6600 cut-off events. [2022-12-13 09:20:52,534 INFO L131 PetriNetUnfolder]: For 10134/13643 co-relation queries the response was YES. [2022-12-13 09:20:52,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32126 conditions, 6600 events. 3620/6600 cut-off events. For 10134/13643 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 56526 event pairs, 389 based on Foata normal form. 1/3218 useless extension candidates. Maximal degree in co-relation 32105. Up to 5536 conditions per place. [2022-12-13 09:20:52,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 97 transitions, 755 flow [2022-12-13 09:20:52,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 1972 [2022-12-13 09:20:59,369 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:59,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7183 [2022-12-13 09:20:59,370 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 96 transitions, 745 flow [2022-12-13 09:20:59,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 09:20:59,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:59,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:20:59,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1304292505, now seen corresponding path program 1 times [2022-12-13 09:20:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:59,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428883453] [2022-12-13 09:20:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:59,524 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-13 09:20:59,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:59,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428883453] [2022-12-13 09:20:59,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428883453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:59,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778980513] [2022-12-13 09:20:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:59,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:59,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2022-12-13 09:20:59,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 96 transitions, 745 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 09:20:59,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:59,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2022-12-13 09:20:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:01,016 INFO L130 PetriNetUnfolder]: 13377/21890 cut-off events. [2022-12-13 09:21:01,016 INFO L131 PetriNetUnfolder]: For 46374/49216 co-relation queries the response was YES. [2022-12-13 09:21:01,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100397 conditions, 21890 events. 13377/21890 cut-off events. For 46374/49216 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 169828 event pairs, 1411 based on Foata normal form. 758/17818 useless extension candidates. Maximal degree in co-relation 100373. Up to 13311 conditions per place. [2022-12-13 09:21:01,127 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 123 selfloop transitions, 2 changer transitions 6/160 dead transitions. [2022-12-13 09:21:01,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 1429 flow [2022-12-13 09:21:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-12-13 09:21:01,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2022-12-13 09:21:01,129 INFO L175 Difference]: Start difference. First operand has 72 places, 96 transitions, 745 flow. Second operand 4 states and 124 transitions. [2022-12-13 09:21:01,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 1429 flow [2022-12-13 09:21:02,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 160 transitions, 1171 flow, removed 84 selfloop flow, removed 5 redundant places. [2022-12-13 09:21:02,913 INFO L231 Difference]: Finished difference. Result has 70 places, 85 transitions, 493 flow [2022-12-13 09:21:02,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=70, PETRI_TRANSITIONS=85} [2022-12-13 09:21:02,915 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -13 predicate places. [2022-12-13 09:21:02,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:02,916 INFO L89 Accepts]: Start accepts. Operand has 70 places, 85 transitions, 493 flow [2022-12-13 09:21:02,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:02,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:02,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 85 transitions, 493 flow [2022-12-13 09:21:02,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 493 flow [2022-12-13 09:21:03,494 INFO L130 PetriNetUnfolder]: 5399/9513 cut-off events. [2022-12-13 09:21:03,494 INFO L131 PetriNetUnfolder]: For 11092/11172 co-relation queries the response was YES. [2022-12-13 09:21:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37105 conditions, 9513 events. 5399/9513 cut-off events. For 11092/11172 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 81737 event pairs, 687 based on Foata normal form. 1/4583 useless extension candidates. Maximal degree in co-relation 37085. Up to 6076 conditions per place. [2022-12-13 09:21:03,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 493 flow [2022-12-13 09:21:03,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 1706 [2022-12-13 09:21:03,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L755: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~a~0_12 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [553] $Ultimate##0-->L758: Formula: (and (= v_~x~0_46 v_~__unbuffered_p0_EAX~0_117) (= |v_P1Thread1of1ForFork3_#in~arg.offset_18| v_P1Thread1of1ForFork3_~arg.offset_18) (= |v_P1Thread1of1ForFork3_#in~arg.base_18| v_P1Thread1of1ForFork3_~arg.base_18) (= v_~x~0_46 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_18|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_18|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_18, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_18, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_18|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, ~__unbuffered_p0_EAX~0, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-13 09:21:03,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:03,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 740 [2022-12-13 09:21:03,656 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 499 flow [2022-12-13 09:21:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 09:21:03,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:03,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:03,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:21:03,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -405945772, now seen corresponding path program 1 times [2022-12-13 09:21:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036749685] [2022-12-13 09:21:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:03,785 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-13 09:21:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:03,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036749685] [2022-12-13 09:21:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036749685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848324105] [2022-12-13 09:21:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:03,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:03,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2022-12-13 09:21:03,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-13 09:21:03,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:03,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2022-12-13 09:21:03,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:06,546 INFO L130 PetriNetUnfolder]: 24346/38510 cut-off events. [2022-12-13 09:21:06,547 INFO L131 PetriNetUnfolder]: For 71153/73295 co-relation queries the response was YES. [2022-12-13 09:21:06,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155309 conditions, 38510 events. 24346/38510 cut-off events. For 71153/73295 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 305170 event pairs, 2381 based on Foata normal form. 1349/31696 useless extension candidates. Maximal degree in co-relation 155286. Up to 16686 conditions per place. [2022-12-13 09:21:06,721 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 112 selfloop transitions, 11 changer transitions 37/182 dead transitions. [2022-12-13 09:21:06,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 182 transitions, 1365 flow [2022-12-13 09:21:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:21:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:21:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-13 09:21:06,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-13 09:21:06,723 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 499 flow. Second operand 6 states and 153 transitions. [2022-12-13 09:21:06,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 182 transitions, 1365 flow [2022-12-13 09:21:07,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 182 transitions, 1356 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:21:07,217 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 547 flow [2022-12-13 09:21:07,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2022-12-13 09:21:07,218 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2022-12-13 09:21:07,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:07,218 INFO L89 Accepts]: Start accepts. Operand has 78 places, 87 transitions, 547 flow [2022-12-13 09:21:07,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:07,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:07,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 87 transitions, 547 flow [2022-12-13 09:21:07,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 87 transitions, 547 flow [2022-12-13 09:21:08,292 INFO L130 PetriNetUnfolder]: 10151/17133 cut-off events. [2022-12-13 09:21:08,293 INFO L131 PetriNetUnfolder]: For 20808/21005 co-relation queries the response was YES. [2022-12-13 09:21:08,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68190 conditions, 17133 events. 10151/17133 cut-off events. For 20808/21005 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 149075 event pairs, 1339 based on Foata normal form. 1/8116 useless extension candidates. Maximal degree in co-relation 68165. Up to 11503 conditions per place. [2022-12-13 09:21:08,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 87 transitions, 547 flow [2022-12-13 09:21:08,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-13 09:21:08,415 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L758: Formula: (and (= v_~x~0_68 v_~__unbuffered_p0_EAX~0_125) (= v_~a~0_47 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_68} OutVars{~a~0=v_~a~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_125, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_68, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [381] L831-->L834: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] [2022-12-13 09:21:08,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] $Ultimate##0-->L828: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 09:21:08,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] $Ultimate##0-->L828: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [560] $Ultimate##0-->L834: Formula: (and (= v_~a~0_51 1) (= v_~a~0_51 v_~__unbuffered_p3_EBX~0_126) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_72 v_~__unbuffered_p0_EAX~0_129) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_72} OutVars{~a~0=v_~a~0_51, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_126, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_72, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p3_EBX~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:21:08,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] $Ultimate##0-->L834: Formula: (and (= v_P3Thread1of1ForFork2_~arg.offset_23 |v_P3Thread1of1ForFork2_#in~arg.offset_23|) (= |v_P3Thread1of1ForFork2_#in~arg.base_23| v_P3Thread1of1ForFork2_~arg.base_23) (= v_~a~0_53 1) (= v_~z~0_51 1) (= v_~x~0_77 v_~__unbuffered_p0_EAX~0_133) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~a~0_53 v_~__unbuffered_p3_EBX~0_130) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_77, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_23|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_23|, ~a~0=v_~a~0_53, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_133, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_23|, ~z~0=v_~z~0_51, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P3Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p3_EBX~0, ~z~0, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg.base] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 09:21:08,694 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:21:08,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1477 [2022-12-13 09:21:08,695 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 556 flow [2022-12-13 09:21:08,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-13 09:21:08,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:08,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:08,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:21:08,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 858228074, now seen corresponding path program 2 times [2022-12-13 09:21:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:08,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497655544] [2022-12-13 09:21:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:08,877 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-13 09:21:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:08,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497655544] [2022-12-13 09:21:08,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497655544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:08,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:08,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:21:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998801174] [2022-12-13 09:21:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:08,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:21:08,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:21:08,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:21:08,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 09:21:08,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-13 09:21:08,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:08,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 09:21:08,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:11,013 INFO L130 PetriNetUnfolder]: 18075/28906 cut-off events. [2022-12-13 09:21:11,013 INFO L131 PetriNetUnfolder]: For 29147/29717 co-relation queries the response was YES. [2022-12-13 09:21:11,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120008 conditions, 28906 events. 18075/28906 cut-off events. For 29147/29717 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 232676 event pairs, 289 based on Foata normal form. 2688/18760 useless extension candidates. Maximal degree in co-relation 119980. Up to 13186 conditions per place. [2022-12-13 09:21:11,173 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 30 selfloop transitions, 49 changer transitions 51/138 dead transitions. [2022-12-13 09:21:11,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 138 transitions, 1068 flow [2022-12-13 09:21:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:21:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:21:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2022-12-13 09:21:11,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5597826086956522 [2022-12-13 09:21:11,174 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 556 flow. Second operand 8 states and 206 transitions. [2022-12-13 09:21:11,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 138 transitions, 1068 flow [2022-12-13 09:21:12,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 969 flow, removed 41 selfloop flow, removed 4 redundant places. [2022-12-13 09:21:12,344 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 529 flow [2022-12-13 09:21:12,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=529, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2022-12-13 09:21:12,345 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-13 09:21:12,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:12,346 INFO L89 Accepts]: Start accepts. Operand has 83 places, 73 transitions, 529 flow [2022-12-13 09:21:12,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:12,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:12,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 73 transitions, 529 flow [2022-12-13 09:21:12,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 529 flow [2022-12-13 09:21:12,411 INFO L130 PetriNetUnfolder]: 759/1466 cut-off events. [2022-12-13 09:21:12,411 INFO L131 PetriNetUnfolder]: For 1283/1464 co-relation queries the response was YES. [2022-12-13 09:21:12,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 1466 events. 759/1466 cut-off events. For 1283/1464 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 9172 event pairs, 3 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 6528. Up to 892 conditions per place. [2022-12-13 09:21:12,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 73 transitions, 529 flow [2022-12-13 09:21:12,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 09:21:12,885 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:21:12,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-13 09:21:12,887 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 519 flow [2022-12-13 09:21:12,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-13 09:21:12,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:12,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:21:12,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -292544854, now seen corresponding path program 1 times [2022-12-13 09:21:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489974974] [2022-12-13 09:21:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:13,220 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-13 09:21:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489974974] [2022-12-13 09:21:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489974974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:13,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:13,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200026529] [2022-12-13 09:21:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:13,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:13,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:21:13,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 09:21:13,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:13,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:21:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:13,631 INFO L130 PetriNetUnfolder]: 3268/5097 cut-off events. [2022-12-13 09:21:13,631 INFO L131 PetriNetUnfolder]: For 13728/14056 co-relation queries the response was YES. [2022-12-13 09:21:13,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24358 conditions, 5097 events. 3268/5097 cut-off events. For 13728/14056 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 30869 event pairs, 251 based on Foata normal form. 186/3810 useless extension candidates. Maximal degree in co-relation 24329. Up to 2547 conditions per place. [2022-12-13 09:21:13,653 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 68 selfloop transitions, 7 changer transitions 49/145 dead transitions. [2022-12-13 09:21:13,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 145 transitions, 1348 flow [2022-12-13 09:21:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:21:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:21:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-13 09:21:13,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2022-12-13 09:21:13,654 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 519 flow. Second operand 6 states and 115 transitions. [2022-12-13 09:21:13,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 145 transitions, 1348 flow [2022-12-13 09:21:13,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 145 transitions, 1011 flow, removed 66 selfloop flow, removed 13 redundant places. [2022-12-13 09:21:13,866 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 394 flow [2022-12-13 09:21:13,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2022-12-13 09:21:13,867 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2022-12-13 09:21:13,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:13,867 INFO L89 Accepts]: Start accepts. Operand has 64 places, 74 transitions, 394 flow [2022-12-13 09:21:13,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:13,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:13,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 74 transitions, 394 flow [2022-12-13 09:21:13,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 74 transitions, 394 flow [2022-12-13 09:21:14,126 INFO L130 PetriNetUnfolder]: 2168/3342 cut-off events. [2022-12-13 09:21:14,126 INFO L131 PetriNetUnfolder]: For 1667/1681 co-relation queries the response was YES. [2022-12-13 09:21:14,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 3342 events. 2168/3342 cut-off events. For 1667/1681 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 20522 event pairs, 5 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 9369. Up to 1621 conditions per place. [2022-12-13 09:21:14,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 74 transitions, 394 flow [2022-12-13 09:21:14,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 09:21:14,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:14,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-13 09:21:14,297 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 398 flow [2022-12-13 09:21:14,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 09:21:14,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:14,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:14,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:21:14,297 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 873561177, now seen corresponding path program 1 times [2022-12-13 09:21:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:14,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191723448] [2022-12-13 09:21:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:14,721 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-13 09:21:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191723448] [2022-12-13 09:21:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191723448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:14,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:14,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:14,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48806204] [2022-12-13 09:21:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:14,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:21:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:14,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:21:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:21:14,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:21:14,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-13 09:21:14,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:14,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:21:14,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:15,119 INFO L130 PetriNetUnfolder]: 3974/6179 cut-off events. [2022-12-13 09:21:15,120 INFO L131 PetriNetUnfolder]: For 8711/8963 co-relation queries the response was YES. [2022-12-13 09:21:15,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22132 conditions, 6179 events. 3974/6179 cut-off events. For 8711/8963 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 38052 event pairs, 407 based on Foata normal form. 210/4537 useless extension candidates. Maximal degree in co-relation 22111. Up to 2382 conditions per place. [2022-12-13 09:21:15,140 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 49 selfloop transitions, 2 changer transitions 63/134 dead transitions. [2022-12-13 09:21:15,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 955 flow [2022-12-13 09:21:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:21:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:21:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:21:15,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-13 09:21:15,141 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 398 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:21:15,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 955 flow [2022-12-13 09:21:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 134 transitions, 953 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 09:21:15,405 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 377 flow [2022-12-13 09:21:15,405 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2022-12-13 09:21:15,405 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -13 predicate places. [2022-12-13 09:21:15,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:15,406 INFO L89 Accepts]: Start accepts. Operand has 70 places, 69 transitions, 377 flow [2022-12-13 09:21:15,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:15,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:15,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 377 flow [2022-12-13 09:21:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 69 transitions, 377 flow [2022-12-13 09:21:15,466 INFO L130 PetriNetUnfolder]: 851/1482 cut-off events. [2022-12-13 09:21:15,466 INFO L131 PetriNetUnfolder]: For 1617/1620 co-relation queries the response was YES. [2022-12-13 09:21:15,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4461 conditions, 1482 events. 851/1482 cut-off events. For 1617/1620 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 9353 event pairs, 3 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 4439. Up to 730 conditions per place. [2022-12-13 09:21:15,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 69 transitions, 377 flow [2022-12-13 09:21:15,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 09:21:15,488 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:15,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 09:21:15,489 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 377 flow [2022-12-13 09:21:15,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-13 09:21:15,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:15,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:15,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:21:15,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1768052720, now seen corresponding path program 2 times [2022-12-13 09:21:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214368514] [2022-12-13 09:21:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:21:15,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:21:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:21:15,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:21:15,566 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:21:15,568 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:21:15,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 09:21:15,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:21:15,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:21:15,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:21:15,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 09:21:15,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:21:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:21:15,574 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:15,578 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:21:15,578 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:21:15,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:21:15 BasicIcfg [2022-12-13 09:21:15,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:21:15,656 INFO L158 Benchmark]: Toolchain (without parser) took 52992.94ms. Allocated memory was 192.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 155.8MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 09:21:15,656 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:21:15,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.56ms. Allocated memory is still 192.9MB. Free memory was 155.8MB in the beginning and 128.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:21:15,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.30ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 125.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:21:15,656 INFO L158 Benchmark]: Boogie Preprocessor took 37.42ms. Allocated memory is still 192.9MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:21:15,657 INFO L158 Benchmark]: RCFGBuilder took 598.51ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 151.9MB in the end (delta: -28.1MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2022-12-13 09:21:15,657 INFO L158 Benchmark]: TraceAbstraction took 51839.25ms. Allocated memory was 192.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 150.9MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 09:21:15,658 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 192.9MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.56ms. Allocated memory is still 192.9MB. Free memory was 155.8MB in the beginning and 128.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.30ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 125.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.42ms. Allocated memory is still 192.9MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.51ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 151.9MB in the end (delta: -28.1MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * TraceAbstraction took 51839.25ms. Allocated memory was 192.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 150.9MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 137 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 71 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 5589, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3299, independent: 3249, independent conditional: 0, independent unconditional: 3249, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3299, independent: 3249, independent conditional: 0, independent unconditional: 3249, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3299, independent: 3157, independent conditional: 0, independent unconditional: 3157, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 245, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5738, independent: 2340, independent conditional: 2340, independent unconditional: 0, dependent: 99, dependent conditional: 99, dependent unconditional: 0, unknown: 3299, unknown conditional: 3299, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3311, Positive cache size: 3261, Positive conditional cache size: 3261, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 457, independent: 413, independent conditional: 413, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 372, independent conditional: 11, independent unconditional: 361, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 372, independent conditional: 11, independent unconditional: 361, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 81, dependent conditional: 4, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 457, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 402, unknown conditional: 402, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 372, Positive conditional cache size: 372, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 74, independent conditional: 9, independent unconditional: 65, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, independent: 74, independent conditional: 9, independent unconditional: 65, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 31, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 81, unknown conditional: 81, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 446, Positive conditional cache size: 446, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 281, independent conditional: 281, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 456, Positive conditional cache size: 456, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 59 PlacesBefore, 59 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1021, independent: 963, independent conditional: 963, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 105, independent conditional: 69, independent unconditional: 36, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 107, independent: 105, independent conditional: 69, 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: 107, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1021, independent: 858, independent conditional: 858, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 107, unknown conditional: 107, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 561, Positive conditional cache size: 561, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 63 PlacesBefore, 63 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 1868 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 687, independent: 617, independent conditional: 617, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 45, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 45, 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: 48, independent: 48, independent conditional: 0, independent unconditional: 48, 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: 687, independent: 569, independent conditional: 569, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 609, Positive conditional cache size: 609, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 64 PlacesBefore, 63 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 594, independent: 532, independent conditional: 532, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 104, independent conditional: 58, independent unconditional: 46, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 104, independent conditional: 58, independent unconditional: 46, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 594, independent: 428, independent conditional: 428, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 110, unknown conditional: 110, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 758, Positive cache size: 713, Positive conditional cache size: 713, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 72 PlacesBefore, 72 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 1972 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 872, independent: 786, independent conditional: 786, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 50, independent conditional: 48, independent unconditional: 2, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, independent: 50, independent conditional: 48, independent unconditional: 2, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, independent: 50, independent conditional: 0, independent unconditional: 50, 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: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 872, independent: 736, independent conditional: 736, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 763, Positive conditional cache size: 763, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 70 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 739, independent: 675, independent conditional: 675, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 88, independent conditional: 57, independent unconditional: 31, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 88, independent conditional: 57, independent unconditional: 31, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 739, independent: 587, independent conditional: 587, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 89, unknown conditional: 89, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 851, Positive conditional cache size: 851, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 78 PlacesBefore, 77 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 1718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 795, independent: 727, independent conditional: 727, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 108, independent conditional: 92, independent unconditional: 16, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 108, independent conditional: 92, independent unconditional: 16, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 14, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 795, independent: 619, independent conditional: 619, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 110, unknown conditional: 110, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 959, Positive conditional cache size: 959, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 75 PlacesBefore, 70 PlacesAfterwards, 73 TransitionsBefore, 68 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 495, independent: 437, independent conditional: 437, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 73, independent unconditional: 28, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 73, independent unconditional: 28, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 495, independent: 336, independent conditional: 336, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 102, unknown conditional: 102, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1113, Positive cache size: 1060, Positive conditional cache size: 1060, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 64 PlacesBefore, 64 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1125, Positive cache size: 1072, Positive conditional cache size: 1072, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1098, Positive conditional cache size: 1098, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 51.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1742 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 25 mSDtfsCounter, 1742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=755occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:21:15,691 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...